A comparison of column-generation approaches to the synchronized pickup and delivery problem

DOI10.1016/j.ejor.2015.06.017zbMath1346.90117OpenAlexW2215640555MaRDI QIDQ319923

Timo Gschwind

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.2015.06.017

zbMATH Keywords

vehicle routingbranch-and-cut-and-pricepickup and deliverylabeling algorithmtemporal synchronization

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06)

Related Items

Daily aircraft routing for amphibious ready groups ⋮ A practical vehicle routing problem with desynchronized arrivals to depot ⋮ Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels ⋮ Typology and literature review for dial-a-ride problems ⋮ Optimisation of maintenance routing and scheduling for offshore wind farms ⋮ An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics

Cites Work

• Unnamed Item
• Unnamed Item
• Single liner shipping service design
• A note on ``Efficient feasibility testing for dial-a-ride problems
• \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
• Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
• An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
• The pickup and delivery problem with time windows
• Modelling path flows for a combined ship routing and inventory management problem
• Fleet assignment and routing with schedule synchronization constraints
• Efficient feasibility testing for dial-a-ride problems
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
• The vehicle routing problem with time windows and temporal dependencies
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints