An integer programming approach for the time-dependent traveling salesman problem with time windows.
Agustín MonteroIsabel Méndez-DíazJuan José Miranda BrontPublished in: Comput. Oper. Res. (2017)
Keyphrases
- traveling salesman problem
- integer programming
- vehicle routing problem
- travel time
- combinatorial optimization
- np hard
- ant colony optimization
- lagrangian relaxation
- production planning
- linear programming
- cutting plane
- combinatorial optimization problems
- optimization problems
- constraint programming
- combinatorial problems
- column generation
- hamiltonian cycle
- valid inequalities
- traveling salesman
- integer program
- computational complexity
- genetic local search
- transportation networks
- evolutionary algorithm
- network flow
- multi objective