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

DOI10.1016/J.EJOR.2020.01.040MaRDI QIDQ2178121zbMATH OpenOpenAlexFDO

Authors 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

branch-and-cutvehicle routing problemsequential 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)

Recommendations

• An exact algorithm for the pickup and delivery problem with time windows
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• The multi-pickup and delivery problem with time windows
• The pickup and delivery problem with time windows
• Pickup and delivery problem with time windows: a new compact two-index formulation

Cites work

• scientific article; zbMATH DE number 2013522 (Why is no real title available?)
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
• A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities
• A general heuristic for vehicle routing problems
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading
• An efficient implementation of local search algorithms for constrained routing problems
• An exact algorithm for the pickup and delivery problem with time windows
• An inexact algorithm for the sequential ordering problem
• Efficient symmetry breaking formulations for the job grouping problem
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• On dual based lower bounds for the sequential ordering problem with precedences and due dates
• Pickup and delivery problem with time windows: a new compact two-index formulation
• 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
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
• The multi-pickup and delivery problem with time windows
• The pickup and delivery problem with time windows and handling operations
• The pickup and delivery problem with time windows and occasional drivers
• The precedence-constrained asymmetric traveling salesman polytope

Cited in

(15)

• Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands
• Model formulations for pickup and delivery problems in designated driver services
• Scheduling heterogeneous delivery tasks on a mixed logistics platform
• An exact algorithm for the pickup and delivery problem with time windows
• A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities
• Covering delivery problem with electric vehicle and parcel lockers: variable neighborhood search approach
• Operations optimization for third-party e-grocery platforms
• Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels
• The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms
• Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics
• Pickup and delivery problem with time windows: a new compact two-index formulation
• The multi-pickup and delivery problem with time windows
• Exact algorithms for the order picking problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery

Describes a project that uses

Uses Software

• CVRPSP

This page was built for publication: Exact algorithms for the multi-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 Q2178121)