Exact algorithms for the multi-pickup and delivery problem with time windows
DOI10.1016/J.EJOR.2020.01.040zbMATH Open1441.90016OpenAlexW3002201407MaRDI QIDQ2178121FDOQ2178121
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
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Cites Work
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- An inexact algorithm for the sequential ordering problem
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- A general heuristic for vehicle routing problems
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
- 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
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- The precedence-constrained asymmetric traveling salesman polytope
- Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
- Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015
- 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
- The pickup and delivery problem with time windows and handling operations
- The multi-pickup and delivery problem with time windows
- The pickup and delivery problem with time windows and occasional drivers
- An efficient implementation of local search algorithms for constrained routing problems
- Pickup and delivery problem with time windows: a new compact two-index formulation
- Title not available (Why is that?)
- On dual based lower bounds for the sequential ordering problem with precedences and due dates
- Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
- A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities
Cited In (11)
- The single vehicle pickup and delivery problem with time windows: Intelligent operators for heuristic and metaheuristic algorithms
- Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands
- Operations optimization for third-party e-grocery platforms
- Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics
- The multi-pickup and delivery problem with time windows
- Exact algorithms for the order picking problem
- Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels
- A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
- Covering delivery problem with electric vehicle and parcel lockers: variable neighborhood search approach
- Scheduling heterogeneous delivery tasks on a mixed logistics platform
- Model formulations for pickup and delivery problems in designated driver services
Uses Software
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)