A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints.
Philip KilbyPatrick ProsserPaul ShawPublished in: Constraints An Int. J. (2000)
Keyphrases
- heuristic methods
- variable neighborhood search
- vehicle routing problem
- tabu search
- neighborhood search
- metaheuristic
- vehicle routing problem with time windows
- optimal solution
- constraint satisfaction
- hyper heuristics
- benchmark instances
- simulated annealing
- exact algorithms
- combinatorial optimization problems
- test problems
- traveling salesman problem
- routing problem
- memetic algorithm
- guided local search
- test instances
- path relinking
- genetic algorithm
- multi depot
- waste collection
- search algorithm
- scheduling problem
- constraint programming
- benchmark problems
- combinatorial problems
- feasible solution
- job shop scheduling problem