Mixed integer programming formulations for the generalized traveling salesman problem with time windows.
Yuan YuanDiego CattaruzzaMaxime OgierCyriaque RousselotFrédéric SemetPublished in: 4OR (2021)
Keyphrases
- traveling salesman problem
- mixed integer programming
- valid inequalities
- piecewise linear functions
- vehicle routing problem
- combinatorial optimization
- mixed integer
- ant colony optimization
- column generation
- lot sizing
- optimization problems
- branch and bound method
- production planning
- traveling salesman
- transportation networks
- hamiltonian cycle
- lagrangian relaxation
- multi objective
- subtour elimination
- search algorithm
- routing problem
- linear program
- cost function