A Tabu Search Approach for the Prize Collecting Traveling Salesman Problem.
Odivaney PedroRodney Rezende SaldanhaRicardo Saraiva de CamargoPublished in: Electron. Notes Discret. Math. (2013)
Keyphrases
- traveling salesman problem
- prize collecting
- tabu search
- metaheuristic
- path relinking
- combinatorial optimization
- ant colony optimization
- vehicle routing problem
- simulated annealing
- travel time
- optimization problems
- genetic algorithm
- scheduling problem
- memetic algorithm
- test problems
- variable neighborhood search
- hybrid algorithm
- heuristic methods
- feasible solution
- combinatorial optimization problems
- benchmark instances
- search algorithm
- scatter search
- combinatorial problems
- search procedure
- job shop scheduling problem
- single machine scheduling problem
- search space
- crossover operator
- minimum spanning tree
- evolutionary algorithm
- flowshop
- particle swarm optimization
- search methods
- valid inequalities
- routing problem
- cost function
- neighborhood search
- objective function
- optimal solution
- fitness function
- multi objective
- single machine
- branch and bound