The multi-depot split delivery vehicle routing problem: An integer programming-based heuristic, new test problems, and computational results.
Damon GulczynskiBruce L. GoldenEdward A. WasilPublished in: Comput. Ind. Eng. (2011)
Keyphrases
- multi depot
- test problems
- vehicle routing problem
- integer programming
- vehicle routing problem with time windows
- benchmark problems
- tabu search
- np hard
- cutting plane
- knapsack problem
- vehicle routing problem with simultaneous
- branch and bound algorithm
- metaheuristic
- simulated annealing
- optimization problems
- scheduling problem
- test instances
- routing problem
- solution quality
- optimal solution
- vehicle routing
- linear programming
- feasible solution
- lagrangian relaxation
- nsga ii
- travel time
- memetic algorithm
- column generation
- combinatorial optimization problems
- heuristic methods
- valid inequalities
- integer program
- genetic algorithm
- exact algorithms
- evolutionary algorithm
- production planning
- np complete
- combinatorial optimization
- constraint programming
- search procedure
- max sat
- neural network
- search algorithm
- special case
- genetic programming
- lower bound
- traveling salesman problem