Lower-bounding and heuristic methods for a refuse collection vehicle routing problem.
Maria Cândida MourãoMaria Teresa AlmeidaPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- heuristic methods
- tabu search
- lower bounding
- vehicle routing problem
- mathematical programming
- metaheuristic
- simulated annealing
- feasible solution
- memetic algorithm
- test instances
- scheduling problem
- search algorithm
- path relinking
- neighborhood search
- routing problem
- test problems
- variable neighborhood search
- benchmark instances
- branch and bound algorithm
- lower bound
- optimal solution
- dynamic time warping
- search procedure
- genetic algorithm
- multi step
- exact algorithms
- vehicle routing problem with simultaneous
- document collections
- lower and upper bounds
- max sat
- benchmark problems
- scatter search
- traveling salesman problem
- neural network
- edit distance
- search strategy
- search methods
- ant colony optimization
- search space