Scatter search for the fleet size and mix vehicle routing problem with time windows.
Patrícia Prado BelfioreLuiz Paulo Lopes FáveroPublished in: Central Eur. J. Oper. Res. (2007)
Keyphrases
- branch and bound algorithm
- scatter search
- vehicle routing problem
- vehicle routing problem with time windows
- metaheuristic
- combinatorial optimization
- routing problem
- optimal solution
- tabu search
- waste collection
- np hard
- path relinking
- combinatorial optimization problems
- ant colony optimization
- simulated annealing
- traveling salesman problem
- optimization problems
- search space
- combinatorial problems
- genetic algorithm
- travel time
- benchmark problems
- hyper heuristics
- search methods
- memetic algorithm
- particle swarm optimization
- knapsack problem
- heuristic methods
- scheduling problem
- neural network
- feasible solution
- integer programming
- solution quality
- constraint satisfaction
- column generation
- search procedure
- special case
- evolutionary algorithm
- search algorithm