The multiple vehicle pickup and delivery problem with LIFO constraints

DOI10.1016/j.ejor.2014.12.029zbMath1346.90078OpenAlexW2014215914MaRDI QIDQ319195

Gregorio Tirado, Mercedes Landete, Enrique Benavent, Enrique Mota

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.12.029

zbMATH Keywords

vehicle routingbranch and cutmixed-integer programmingpickup and deliveryLIFO constraints

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (9)

The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading ⋮ Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks ⋮ A metaheuristic algorithm for a locomotive routing problem arising in the steel industry ⋮ Competition and Cooperation in Pickup and Multiple Delivery Problems ⋮ Dynamic courier routing for a food delivery service ⋮ The pickup and delivery traveling salesman problem with handling costs ⋮ The single-vehicle two-echelon one-commodity pickup and delivery problem ⋮ The vehicle routing problem with simultaneous pickup and delivery and handling costs

Uses Software

• VRP

Cites Work

• Heuristics for dynamic and stochastic routing in industrial shipping
• A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
• The vehicle routing problem. Latest advances and new challenges.
• Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The Vehicle Routing Problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
• Integer Programming Formulation of Traveling Salesman Problems
• Tabu Search—Part I
• A unified tabu search heuristic for vehicle routing problems with time windows
• An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading

This page was built for publication: The multiple vehicle pickup and delivery problem with LIFO constraints