An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
From MaRDI portal
Publication:6160334
DOI10.3138/infor.45.4.223MaRDI QIDQ6160334
Raffaele Cerulli, Francesco Carrabs, Jean-François Cordeau
Publication date: 9 May 2023
Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)
Related Items (21)
Rich vehicle routing problems: from a taxonomy to a definition ⋮ The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ The multiple vehicle pickup and delivery problem with LIFO constraints ⋮ Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks ⋮ A hybrid approach for the vehicle routing problem with three-dimensional loading constraints ⋮ What are the worst cases in constrained last-in-first-out pick-up and delivery problems? ⋮ Formulations and algorithms for the pickup and delivery traveling salesman problem with multiple stacks ⋮ Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading ⋮ Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints ⋮ Valid inequalities and branch-and-cut algorithm 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 handling costs ⋮ The double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ The tree representation for the pickup and delivery traveling salesman problem with LIFO loading ⋮ Recent Models and Algorithms for One-to-One Pickup and Delivery Problems ⋮ Energy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling system ⋮ 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 ⋮ Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading ⋮ Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient implementation of local search algorithms for constrained routing problems
- An algorithm for the traveling salesman problem with pickup and delivery customers
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- An additive bounding procedure for the asymmetric travelling salesman problem
- 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
- Perturbation heuristics for the pickup and delivery traveling salesman problem
- The traveling salesman problem and its variations
- New lower bounds for the symmetric travelling salesman problem
- Optimal routing of multiple-load AGV subject to LIFO loading constraints
- Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
- An Additive Bounding Procedure for Combinatorial Optimization Problems
- A note on finding optimum branchings
- Finding optimum branchings
- An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
- Optimum branchings
- An Algorithm for the Traveling Salesman Problem
This page was built for publication: An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading