A hybrid algorithm for the vehicle routing problem with three-dimensional loading constraints and mixed backhauls.
Henriette KochMaximilian SchlögellAndreas BortfeldtPublished in: J. Sched. (2020)
Keyphrases
- vehicle routing problem
- hybrid algorithm
- tabu search
- particle swarm optimization
- metaheuristic
- simulated annealing
- benchmark instances
- vehicle routing
- test instances
- routing problem
- ant colony optimization
- vehicle routing problem with time windows
- memetic algorithm
- search algorithm
- benchmark problems
- feasible solution
- genetic algorithm
- scheduling problem
- test problems
- path relinking
- imperialist competitive algorithm
- tabu search algorithm
- hybrid metaheuristic
- combinatorial optimization
- particle swarm optimization pso
- hybrid optimization algorithm
- travel time
- artificial bee colony algorithm
- search procedure
- combinatorial optimization problems
- ant colony optimization algorithm
- np hard
- hybrid method
- standard test problems
- swarm intelligence
- constraint satisfaction
- pso algorithm
- search space
- pick up and delivery
- variable neighborhood search
- job shop scheduling problem
- initial solution
- initial population
- differential evolution
- evolutionary algorithm
- cost function
- solution quality
- constraint programming
- global optimization