Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots.
Alvina G. H. KekRuey Long CheuQiang MengPublished in: Math. Comput. Model. (2008)
Keyphrases
- vehicle routing problem
- routing problem
- tabu search
- metaheuristic
- benchmark problems
- vehicle routing problem with time windows
- test instances
- multi depot
- combinatorial optimization
- traveling salesman problem
- travel time
- memetic algorithm
- benchmark instances
- np hard
- knapsack problem
- particle swarm optimization
- neighborhood search
- waste collection
- search strategies
- search strategy
- simulated annealing
- job shop scheduling problem
- scheduling problem
- genetic algorithm