A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints.
Dirk MännelAndreas BortfeldtPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- vehicle routing problem
- hybrid algorithm
- tabu search
- particle swarm optimization
- metaheuristic
- simulated annealing
- vehicle routing
- memetic algorithm
- benchmark instances
- test instances
- vehicle routing problem with time windows
- benchmark problems
- scheduling problem
- routing problem
- ant colony optimization
- hybrid metaheuristic
- particle swarm optimization pso
- genetic algorithm
- path relinking
- global optimization
- travel time
- tabu search algorithm
- test problems
- artificial bee colony algorithm
- imperialist competitive algorithm
- combinatorial optimization
- feasible solution
- neighborhood search
- hybrid method
- job shop scheduling problem
- particle swarm
- initial solution
- hybrid optimization algorithm
- vehicle routing problem with simultaneous
- scatter search
- search algorithm
- pso algorithm
- search procedure
- optimal solution
- standard test problems
- multi objective
- np hard
- initial population
- combinatorial optimization problems
- differential evolution
- optimization method
- traveling salesman problem
- solution space
- nonlinear integer programming
- swarm intelligence