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 definitionThe pickup and delivery problem with time windows, multiple stacks, and handling operationsThe multiple vehicle pickup and delivery problem with LIFO constraintsBranch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacksA hybrid approach for the vehicle routing problem with three-dimensional loading constraintsWhat 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 stacksMulti-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loadingMultiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraintsValid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacksA branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costsThe double traveling salesman problem with partial last‐in‐first‐out loading constraintsA metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraintsThe tree representation for the pickup and delivery traveling salesman problem with LIFO loadingRecent Models and Algorithms for One-to-One Pickup and Delivery ProblemsEnergy-efficient rail guided vehicle routing for two-sided loading/unloading automated freight handling systemMaking the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problemThe pickup and delivery traveling salesman problem with handling costsVehicle routing problems with loading constraints: state-of-the-art and future directionsBranch-and-cut for the pickup and delivery traveling salesman problem with FIFO loadingElevator dispatching problem: a mixed integer linear programming formulation and polyhedral results



Cites Work


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