Two-stage vehicle routing problem with arc time windows: A mixed integer programming formulation and a heuristic approach.
Cihan ÇetinkayaIsmail KaraoglanHadi GökçenPublished in: Eur. J. Oper. Res. (2013)
Keyphrases
- vehicle routing problem
- integer programming formulation
- tabu search
- tabu search algorithm
- valid inequalities
- benchmark instances
- traveling salesman problem
- test instances
- randomly generated
- multi depot
- linear programming relaxation
- combinatorial optimization
- metaheuristic
- knapsack problem
- vehicle routing
- routing problem
- variable neighborhood search
- randomly generated problems
- simulated annealing
- lp relaxation
- np hard
- feasible solution
- branch and bound algorithm
- optimal solution
- neighborhood search
- job shop scheduling problem
- combinatorial optimization problems
- memetic algorithm
- benchmark problems
- search strategies
- mixed integer programming
- travel time
- search procedure
- heuristic methods
- optimization problems
- particle swarm optimization
- path relinking
- test problems
- linear programming
- scheduling problem
- scatter search
- greedy algorithm
- global optimization
- dynamic programming
- np complete
- constraint satisfaction
- ant colony optimization