A new ILP-based refinement heuristic for Vehicle Routing Problems.
Roberto De FranceschiMatteo FischettiPaolo TothPublished in: Math. Program. (2006)
Keyphrases
- vehicle routing problem
- multi depot
- tabu search
- benchmark instances
- variable neighborhood search
- guided local search
- tree search algorithm
- test instances
- vehicle routing problem with time windows
- metaheuristic
- combinatorial optimization
- neighborhood search
- greedy randomized adaptive search procedure
- simulated annealing
- routing problem
- exact algorithms
- scheduling problem
- inductive logic programming
- traveling salesman problem
- benchmark problems
- waste collection
- search procedure
- memetic algorithm
- knapsack problem
- path relinking
- test problems
- feasible solution
- job shop scheduling problem
- hyper heuristics
- optimal solution
- branch and bound algorithm
- np hard
- search algorithm
- search space
- pick up and delivery
- genetic algorithm
- nature inspired
- optimization problems
- branch and bound
- solution quality
- search strategies