Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective.
Boadu Mensah SarpongChristian ArtiguesNicolas JozefowiezPublished in: ATMOS (2013)
Keyphrases
- min max
- column generation
- vehicle routing problem with time windows
- bi objective
- vehicle routing
- vehicle routing problem
- multiple objectives
- set covering problem
- routing problem
- multi objective
- branch and bound
- efficient solutions
- linear programming
- multiobjective optimization
- optimal solution
- ant colony optimization
- linear program
- integer programming
- metaheuristic
- max min
- constraint programming
- mixed integer programming
- exact solution
- knapsack problem
- integer linear programming
- multi objective optimization
- network design
- cutting plane
- lagrangian relaxation
- integer program
- valid inequalities
- shortest path problem
- tabu search
- traveling salesman problem
- benchmark problems
- np hard
- combinatorial optimization problems
- particle swarm optimization
- combinatorial optimization
- lower bound
- travel time
- nsga ii
- search space
- simulated annealing
- scatter search
- neighborhood search