Mixed integer formulations for a coupled lot-scheduling and vehicle routing problem in furniture settings.
Pedro MirandaReinaldo MorabitoDeisemara FerreiraPublished in: INFOR Inf. Syst. Oper. Res. (2019)
Keyphrases
- vehicle routing problem
- mixed integer
- valid inequalities
- tabu search
- mixed integer linear programming
- feasible solution
- vehicle routing
- scheduling problem
- metaheuristic
- linear program
- vehicle routing problem with time windows
- routing problem
- traveling salesman problem
- cutting plane
- optimal solution
- np hard
- benchmark problems
- mixed integer programming
- travel time
- lot sizing
- combinatorial optimization
- convex hull
- simulated annealing
- continuous relaxation
- network design problem
- combinatorial optimization problems
- continuous variables
- linear programming
- column generation
- particle swarm optimization
- knapsack problem
- genetic algorithm
- search space
- dynamic programming
- search algorithm
- vehicle routing problem with simultaneous