The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method

DOI10.1016/j.ejor.2009.01.022zbMath1177.90412MaRDI QIDQ1044088

Cristián E. Cortés, Claudio Contardo, Martin Matamala

Publication date: 10 December 2009

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

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

zbMATH Keywords

branch-and-bound; branch-and-cut; Benders decomposition; mixed-integer programming; dial-a-ride; pickup and delivery

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

Related Items

The school bus routing and scheduling problem with transfers, The pickup and delivery problem with time windows and scheduled lines, Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels, Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems, Public transport for smart cities: recent innovations and future challenges, A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations, Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures, The dial-A-ride problem with transfers, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines, A post-improvement procedure for the mixed load school bus routing problem, A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources, The school bus routing problem: a review, Vehicle routing with cross-dock selection, A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking, Typology and literature review for dial-a-ride problems, Moving products between location pairs: cross-docking versus direct-shipping, A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment, A comparison of two meta-heuristics for the pickup and delivery problem with transshipment, An on-demand same-day delivery service using direct peer-to-peer transshipment strategies, A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments, The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach, Modeling and solving the multimodal car- and ride-sharing problem, The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation, Event-based MILP models for ridepooling applications, Optimization for dynamic ride-sharing: a review, New mixed integer-programming model for the pickup-and-delivery problem with transshipment, A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities, Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers, Synchronized routing of active and passive means of transport, A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), Selective routing problem with synchronization, Interrelated trips in the rural dial-a-ride problem with autonomous vehicles, The vessel swap-body routing problem, A dynamic scheduling process and methodology using route deviations and synchronized passenger transfers for flexible feeder transit services, Mathematical programming formulations and metaheuristics for biological sample transportation problems in healthcare, Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments, Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
• Partitioning procedures for solving mixed-variables programming problems
• The pickup and delivery problem with time windows
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• An effective genetic algorithm approach to multiobjective routing problems (MORPs)
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
• A dynamic vehicle routing problem with time-dependent travel times
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• Very large-scale vehicle routing: new test problems, algorithms, and results
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The Vehicle Routing Problem
• Drive: Dynamic Routing of Independent Vehicles
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• Survey Paper—Time Window Constrained Routing and Scheduling Problems
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• The General Pickup and Delivery Problem
• A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
• Integer Programming and Combinatorial Optimization
• The Pickup And Delivery Problem With Time Windows And Transshipment