The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
From MaRDI portal
Publication:847836
DOI10.1007/s10107-008-0234-9zbMath1184.90108OpenAlexW2119673940MaRDI QIDQ847836
Jean-François Cordeau, Gilbert Laporte, Irina Dumitrescu, Stefan Ropke
Publication date: 19 February 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.5050
Related Items
A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem, A branch-and-cut framework for the consistent traveling salesman problem, Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks, A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints, Routing problems with loading constraints, The time-dependent capacitated profitable tour problem with time windows and precedence constraints, Solving the traveling salesperson problem with precedence constraints by deep reinforcement learning, A branch-and-cut algorithm for factory crane scheduling problem, The tree representation for the pickup and delivery traveling salesman problem with LIFO loading, An ILP-based local search procedure for the VRP with pickups and deliveries, New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, Dynamic courier routing for a food delivery service, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem, The pickup and delivery traveling salesman problem with handling costs, Vehicle routing problems with loading constraints: state-of-the-art and future directions, A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading, The pickup and delivery traveling salesman problem with first-in-first-out loading, Decision diagrams for solving traveling salesman problems with pickup and delivery in real time, An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP, The double traveling salesman problem with multiple stacks: A variable neighborhood search approach, Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading, Pickup and delivery problem with incompatibility constraints
Uses Software
Cites Work
- Unnamed Item
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- An efficient implementation of local search algorithms for constrained routing problems
- An algorithm for the traveling salesman problem with pickup and delivery customers
- The pickup and delivery problem: Faces and branch-and-cut algorithm
- A new extension of local search applied to the Dial-A-Ride problem
- A heuristic for the pickup and delivery traveling salesman problem
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
- Perturbation heuristics for the pickup and delivery traveling salesman problem
- The precedence-constrained asymmetric traveling salesman polytope
- The traveling salesman problem with backhauls
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
- TSPLIB—A Traveling Salesman Problem Library
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Shortest Path Problems with Resource Constraints
