Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem.
Antonio Augusto ChavesLuiz Antonio Nogueira LorenaPublished in: EvoCOP (2008)
Keyphrases
- prize collecting
- hybrid metaheuristic
- vehicle routing problem
- travel time
- scatter search
- metaheuristic
- multi objective
- variable neighborhood search
- minimum spanning tree
- initial population
- path relinking
- genetic algorithm
- single machine scheduling problem
- traveling salesman problem
- tabu search
- benchmark problems
- routing problem
- lp relaxation
- benchmark instances
- evolutionary algorithm
- combinatorial optimization
- mutation operator
- memetic algorithm
- search strategies
- genetic algorithm ga
- particle swarm optimization
- optimization problems
- simulated annealing
- upper bound
- np hard