The robust pickup and delivery problem with time windows

DOI10.1016/J.EJOR.2026.03.031MaRDI QIDQ7349326zbMATH OpenFDO

Authors Alex Corrêa Abreu, Maria Battarra, Luciano Da Fontoura Costa, Pedro Munari

Publication date 16 September 2026

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

Full work available at URL https://doi.org/10.1016/J.EJOR.2026.03.031

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A generic exact solver for vehicle routing and related problems
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• A review of vehicle routing with simultaneous pickup and delivery
• A robust approach to multiple vehicle location-routing problems with time windows for optimization of cross docking under uncertainty
• An exact algorithm for the pickup and delivery problem with time windows
• Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
• Dynamic pickup and delivery problems
• Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen
• Layered Formulation for the Robust Vehicle Routing Problem with Time Windows
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• New formulations for the robust vehicle routing problem with time windows under demand and travel time uncertainty
• Path inequalities for the vehicle routing problem with time windows
• Pickup and delivery problem with time windows: a new compact two-index formulation
• Recent models and algorithms for one-to-one pickup and delivery problems
• Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands
• Robust optimization for the vehicle routing problem with multiple deliverymen
• Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty
• Robust vehicle routing under uncertainty via branch-price-and-cut
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The multiple vehicle pickup and delivery problem with LIFO constraints
• The pickup and delivery problem with time windows
• The Price of Robustness
• The robust capacitated vehicle routing problem under demand uncertainty
• The robust vehicle routing problem with time windows
• The robust vehicle routing problem with time windows: solution by branch and price and cut
• The secure time-dependent vehicle routing problem with uncertain demands
• The vehicle routing problem with simultaneous pickup and delivery and handling costs
• Vehicle Routing
• Vehicle routing with backhauls: review and research perspectives

This page was built for publication: The robust pickup and delivery problem with time windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349326)