Creating lasso-solutions for the traveling salesman problem with pickup and delivery by Tabu search.
Arild HoffArne LøkketangenPublished in: Central Eur. J. Oper. Res. (2006)
Keyphrases
- traveling salesman problem
- path relinking
- tabu search
- benchmark instances
- variable neighborhood search
- metaheuristic
- vehicle routing problem
- ant colony optimization
- combinatorial optimization
- feasible solution
- iterated local search
- neighborhood search
- combinatorial problems
- optimization problems
- simulated annealing
- nature inspired
- initial solution
- memetic algorithm
- tabu search algorithm
- scatter search
- traveling salesman
- heuristic methods
- combinatorial optimization problems
- solution quality
- hybrid algorithm
- job shop scheduling problem
- solution space
- test instances
- search algorithm
- optimal solution
- test problems
- aco algorithm
- valid inequalities
- special case
- evolutionary algorithm
- genetic algorithm
- minimum spanning tree
- max min
- routing problem
- search procedure
- benchmark problems
- scheduling problem