A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints.
Henriette KochAndreas BortfeldtGerhard WäscherPublished in: OR Spectr. (2018)
Keyphrases
- vehicle routing problem
- hybrid algorithm
- tabu search
- particle swarm optimization
- metaheuristic
- simulated annealing
- vehicle routing
- memetic algorithm
- benchmark instances
- vehicle routing problem with time windows
- routing problem
- feasible solution
- path relinking
- ant colony optimization
- genetic algorithm
- standard test problems
- scheduling problem
- hybrid metaheuristic
- travel time
- particle swarm optimization pso
- test instances
- hybrid method
- test problems
- search algorithm
- search procedure
- combinatorial optimization
- artificial bee colony algorithm
- job shop scheduling problem
- multi objective
- pso algorithm
- tabu search algorithm
- variable neighborhood search
- combinatorial optimization problems
- optimal solution
- hybrid optimization algorithm
- scatter search
- search space
- ant colony optimization algorithm
- global optimization
- initial population
- differential evolution
- benchmark problems
- np hard
- traveling salesman problem
- imperialist competitive algorithm
- nonlinear integer programming
- optimization method
- neighborhood search
- swarm intelligence
- initial solution
- search strategies
- evolutionary algorithm
- neural network
- particle swarm
- solution quality