Memetic algorithm based on sequential variable neighborhood descent for the minmax multiple traveling salesman problem.
Yongzhen WangYan ChenYan LinPublished in: Comput. Ind. Eng. (2017)
Keyphrases
- traveling salesman problem
- memetic algorithm
- crossover operator
- combinatorial optimization
- path relinking
- vehicle routing problem
- variable neighborhood descent
- tabu search
- benchmark instances
- optimization problems
- ant colony optimization
- combinatorial optimization problems
- discrete particle swarm optimization
- metaheuristic
- job shop scheduling problem
- evolutionary algorithm
- combinatorial problems
- simulated annealing
- traveling salesman
- search strategies
- timetabling problem
- genetic algorithm
- branch and bound algorithm
- branch and bound
- heuristic search
- minimum spanning tree
- valid inequalities
- upper bound
- multi objective