A hybrid algorithm for the vehicle routing problem with compatibility constraints.
Can LiuZizhen ZhangXinxin SuHu QinPublished in: ICNSC (2018)
Keyphrases
- hybrid algorithm
- vehicle routing problem
- tabu search
- particle swarm optimization
- metaheuristic
- simulated annealing
- hybrid metaheuristic
- benchmark problems
- benchmark instances
- ant colony optimization
- initial population
- routing problem
- vehicle routing
- memetic algorithm
- vehicle routing problem with time windows
- path relinking
- particle swarm optimization pso
- feasible solution
- test instances
- standard test problems
- hybrid method
- test problems
- combinatorial optimization
- search procedure
- travel time
- hybrid optimization algorithm
- multi depot
- genetic algorithm
- optimal solution
- imperialist competitive algorithm
- search algorithm
- scheduling problem
- pso algorithm
- np hard
- optimization method
- differential evolution
- artificial bee colony algorithm
- job shop scheduling problem
- multi objective
- vehicle routing problem with simultaneous
- traveling salesman problem
- scatter search
- constraint satisfaction
- search space
- particle swarm
- pick up and delivery
- integer programming
- search strategies
- nonlinear integer programming
- ant colony optimization algorithm
- swarm intelligence