A heuristic for vehicle fleet mix problem using tabu search and set partitioning.
Y. H. LeeJ. I. KimK. H. KangK. H. KimPublished in: J. Oper. Res. Soc. (2008)
Keyphrases
- tabu search
- vehicle routing problem
- set partitioning
- vehicle routing problem with time windows
- routing problem
- vehicle routing
- metaheuristic
- simulated annealing
- benchmark instances
- iterated local search
- column generation
- heuristic methods
- feasible solution
- path relinking
- memetic algorithm
- search algorithm
- job shop scheduling problem
- scheduling problem
- travel time
- genetic algorithm
- search procedure
- tabu search algorithm
- variable neighborhood search
- branch and bound
- initial solution
- integer programming
- combinatorial optimization
- combinatorial optimization problems
- solution quality
- benchmark problems
- mathematical programming
- ant colony optimization
- optimization problems
- linear programming relaxation
- evolutionary algorithm
- special case
- lp relaxation
- beam search
- search heuristics
- mixed integer programming
- computational complexity
- max sat
- lagrangian relaxation
- neural network