The delivery man problem and cumulative matroids
Operations Research
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
A New Heuristic for the Traveling Salesman Problem with Time Windows
Transportation Science
A Hybrid Exact Algorithm for the TSPTW
INFORMS Journal on Computing
Paths, Trees, and Minimum Latency Tours
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The open vehicle routing problem: Algorithms, large-scale test problems, and computational results
Computers and Operations Research
Invited review: A comparative analysis of several asymmetric traveling salesman problem formulations
Computers and Operations Research
A new formulation for the Traveling Deliveryman Problem
Discrete Applied Mathematics
Mixed integer programming formulations for single machine scheduling problems
Computers and Industrial Engineering
Exact algorithms for the minimum latency problem
Information Processing Letters
Computers and Operations Research
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several customer locations. Two mixed integer linear programming formulations are presented for this problem: a classical arc flow model and a sequential assignment model. Several polyhedral results are provided for the second formulation, in the special case arising when there is a closed time window only at the depot, while open time windows are considered at all other locations. Exact and heuristic algorithms are also proposed for the problem. Computational results show that medium size instances can be solved exactly with both models, while the heuristic provides good quality solutions for medium to large size instances.