Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading.
Francesco CarrabsJean-François CordeauGilbert LaportePublished in: INFORMS J. Comput. (2007)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- traveling salesman problem
- neighborhood search
- heuristic methods
- routing problem
- minimum spanning tree
- single machine scheduling problem
- benchmark instances
- vehicle routing problem
- hybrid method
- search procedure
- simulated annealing
- combinatorial optimization
- path relinking
- scheduling problem
- combinatorial optimization problems
- genetic algorithm
- ant colony optimization
- search space