A biased random-key genetic algorithm with variable mutants to solve a vehicle routing problem.
Paola FestaFrancesca GuerrieroMauricio G. C. ResendeEdoardo ScalzoPublished in: CoRR (2024)
Keyphrases
- vehicle routing problem
- genetic algorithm
- metaheuristic
- tabu search
- hybrid metaheuristic
- routing problem
- vehicle routing
- memetic algorithm
- traveling salesman problem
- particle swarm optimization
- test instances
- initial population
- scatter search
- combinatorial optimization
- vehicle routing problem with time windows
- ant colony optimization
- simulated annealing
- travel time
- fitness function
- np hard
- benchmark problems
- neural network
- logistics distribution
- path relinking
- multi depot
- knapsack problem
- search methods
- optimization problems
- search space
- job shop scheduling problem
- search strategies
- genetic algorithm ga
- pick up and delivery
- crossover operator
- hybrid algorithm
- differential evolution
- variable neighborhood search
- information retrieval systems