Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed

DOI10.1080/0305215X.2021.1996570MaRDI QIDQ6048503zbMATH OpenOpenAlexFDO

Authors Andy Ham

Publication date 10 October 2023

Published in Engineering Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0305215x.2021.1996570

zbMATH Keywords

DARPTWreal-time reschedulingridesharingwarm-start

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Mixed integer programming (90C11)

Recommendations

• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• An effective and fast heuristic for the dial-a-ride problem
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
• A matheuristic for the dial-a-ride problem

Cites work

• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
• An exact algorithm for the pickup and delivery problem with time windows
• Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
• Modeling and optimizing dynamic dial-a-ride problems
• Pickup and delivery problem with time windows: a new compact two-index formulation
• Simulated annealing heuristic for the general share-a-ride problem
• Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
• Solving nesting problems with non-convex polygons by constraint logic programming
• Temporal linear relaxation in IBM ILOG CP optimizer

Cited in

(9)

• A note on solving DiDi's driver-order matching problem
• Complexity of scheduling for DARP with soft ride times
• A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• scientific article; zbMATH DE number 1420897 (Why is no real title available?)
• Euler is standing in line dial-a-ride problems with precedence-constraints
• Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems
• Solving the dynamic Dial-a-Ride problem using a rolling-horizon event-based graph
• The dial-a-tour problem

This page was built for publication: Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6048503)