Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem

DOI10.1287/opre.31.5.938zbMath0549.90072MaRDI QIDQ3342216

Edward Baker

Publication date: 1983

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.31.5.938

zbMATH Keywords

disjunctive graph model; Computational results; time window constraints; branch and bound solution procedure; longest path algorithm; time-constrained traveling salesman

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

90C10: Integer programming

Related Items

Unnamed Item, Shuffling heuristics for the storage location assignment in an AS/RS, The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations, An algorithm for the traveling salesman problem with pickup and delivery customers, Shipping problems with body clock constraints., Minimization of travel time and weighted number of stops in a traffic-light network, Time-constrained Chinese postman problems, Routing problems: A bibliography, Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks, Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints