Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers

DOI10.1016/j.orl.2013.01.007zbMath1286.90085OpenAlexW2006815288MaRDI QIDQ2450604

Renaud Masson, Olivier Péton, Fabien Lehuédé

Publication date: 14 May 2014

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

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

zbMATH Keywords

transferspickup and delivery problemfeasibility checkforward time slack

Mathematics Subject Classification ID

Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)

Related Items (15)

A heuristic approach for a real-world electric vehicle routing problem ⋮ A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations ⋮ An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization ⋮ An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization ⋮ A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking ⋮ Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks ⋮ The vessel swap-body routing problem ⋮ Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels ⋮ The rendezvous vehicle routing problem ⋮ Parcel delivery cost minimization with time window constraints using trucks and drones ⋮ Graph representation of the fixed route dial-a-ride problem ⋮ A comparison of two meta-heuristics for the pickup and delivery problem with transshipment ⋮ On the one-to-one pickup-and-delivery problem with time windows and trailers ⋮ Scheduling truck drivers with interdependent routes under European Union regulations ⋮ A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows

Cites Work

• Unnamed Item
• Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
• Efficient feasibility testing for dial-a-ride problems
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
• The Pickup And Delivery Problem With Time Windows And Transshipment

This page was built for publication: Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers