An algorithm for the traveling salesman problem with pickup and delivery customers
From MaRDI portal
Publication:1071656
DOI10.1016/0377-2217(85)90257-7zbMath0585.90084OpenAlexW1989019664MaRDI QIDQ1071656
Sant R. Arora, Bahman Kalantari, Arthur V. Hill
Publication date: 1985
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(85)90257-7
traveling salesmanlower boundcomputational resultsbranch and bound algorithmcapacitated problemdelivery pointsdepotpickup pointsseveral salesmenvehicle capacity
Related Items
A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem, Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem, The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING, The traveling salesman problem with backhauls, Self-organizing feature maps for the vehicle routing problem with backhauls, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints, Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems, Better assignment lower bounds for the Euclidean traveling salesman problem, An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading, A multi-commodity, capacitated pickup and delivery problem: the single and two-vehicle cases, The tree representation for the pickup and delivery traveling salesman problem with LIFO loading, Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints, An exact algorithm for the clustered travelling salesman problem, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM, A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading, Exact solutions for the collaborative pickup and delivery problem, The pickup and delivery traveling salesman problem with first-in-first-out loading, A new VRPPD model and a hybrid heuristic solution approach for e-tailing, The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches, A heuristic for the pickup and delivery traveling salesman problem, The multi-commodity one-to-one pickup-and-delivery traveling salesman problem, Heuristic approaches to vehicle routing with backhauls and time windows, Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading, Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding, Perturbation heuristics for the pickup and delivery traveling salesman problem
Cites Work
- Unnamed Item
- Unnamed Item
- Procedures for travelling salesman problems with additional constraints
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- A restricted Lagrangean approach to the traveling salesman problem
- Note—A Note on “The Formulation of the M-Salesman Traveling Salesman Problem”
- Travelling Salesman and Assignment Problems: A Survey
- Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
- Computer Solutions of the Traveling Salesman Problem
- An Algorithm for the Traveling Salesman Problem
- The Traveling Salesman Problem: A Survey
- Pathology of Traveling-Salesman Subtour-Elimination Algorithms
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- Computational Experience with an M-Salesman Traveling Salesman Algorithm
