Exact algorithms for the multi-pickup and delivery problem with time windows

DOI10.1016/j.ejor.2020.01.040zbMath1441.90016OpenAlexW3002201407MaRDI QIDQ2178121

Imadeddine Aziez, Jean-François Côté, Leandro C. Coelho

Publication date: 7 May 2020

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

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

zbMATH Keywords

vehicle routing problembranch-and-cutsequential ordering problemmulti-pickup and delivery problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items

Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels, Covering delivery problem with electric vehicle and parcel lockers: variable neighborhood search approach, Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands, Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics, Scheduling heterogeneous delivery tasks on a mixed logistics platform

Uses Software

• CVRPSP

Cites Work

• Unnamed Item
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
• Efficient symmetry breaking formulations for the job grouping problem
• A general heuristic for vehicle routing problems
• An efficient implementation of local search algorithms for constrained routing problems
• A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• An inexact algorithm for the sequential ordering problem
• On dual based lower bounds for the sequential ordering problem with precedences and due dates
• A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
• The pickup and delivery problem with time windows and handling operations
• Pickup and delivery problem with time windows: a new compact two-index formulation
• The multi-pickup and delivery problem with time windows
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• The precedence-constrained asymmetric traveling salesman polytope
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
• The pickup and delivery problem with time windows and occasional drivers
• A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities
• An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut