Infeasible path formulations for the time-dependent TSP with time windows.
Isabel Méndez-DíazJuan José Miranda BrontPaolo TothPaula ZabalaPublished in: CTW (2011)
Keyphrases
- traveling salesman problem
- valid inequalities
- search space
- vehicle routing problem
- travel time
- combinatorial optimization
- ant colony optimization
- shortest path
- vehicle routing
- optimization problems
- multiple paths
- genetic algorithm
- np hard
- search algorithm
- feasible solution
- information systems
- optimization methods
- endpoints
- data sets
- subtour elimination
- tabu search
- relational databases
- data mining