Pickup and delivery problem with time windows: a new compact two-index formulation

DOI10.1016/j.orl.2017.04.013zbMath1409.90033OpenAlexW2339713317WikidataQ57719360 ScholiaQ57719360MaRDI QIDQ1728253

Maria Gabriela S. Furtado, Reinaldo Morabito, Pedro Augusto Munari

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.04.013

zbMATH Keywords

time windowsprecedence constraintscompact formulationpickup and deliverytwo-index formulation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (13)

Event-based MILP models for ridepooling applications ⋮ A study on the pickup and delivery problem with time windows: matheuristics and new instances ⋮ Exact algorithms for the multi-pickup and delivery problem with time windows ⋮ A scalable anticipatory policy for the dynamic pickup and delivery problem ⋮ Disruption recovery for the pickup and delivery problem with time windows -- a scenario-based approach for online food delivery ⋮ A mixed rebalancing strategy in bike sharing systems ⋮ Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed ⋮ Further insights into the allocation of greenhouse gas emissions to shipments in road freight transportation: the pollution routing game ⋮ Solving a pickup and delivery routing problem for fourth‐party logistics providers ⋮ Flexible vehicle scheduling with precedence constraints for tourists ⋮ A branch-and-cut algorithm for the soft-clustered vehicle-routing problem ⋮ Granular tabu search for the pickup and delivery problem with time windows and electric vehicles ⋮ Strong cuts from compatibility relations for the dial-a-ride problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
• An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• The General Pickup and Delivery Problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Vehicle Routing Problem with Time Windows

This page was built for publication: Pickup and delivery problem with time windows: a new compact two-index formulation