An integer L-shaped algorithm for the dial-a-ride problem with stochastic customer delays

DOI10.1016/J.DAM.2011.01.021MaRDI QIDQ540153zbMATH OpenOpenAlexFDO

Authors Géraldine Heilporn, Jean-François Cordeau, G. Laporte

Publication date 1 June 2011

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2011.01.021

zbMATH Keywords

stochastic programmingdial-a-ride probleminteger \(L\)-shaped algorithm

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)

Recommendations

• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows

Cites work

• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
• An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
• Handbooks in operations Research \& management science: Transportation
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• New optimality cuts for a single-vehicle stochastic routing problem
• Partitioning procedures for solving mixed-variables programming problems
• Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
• Stochastic vehicle routing
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• The dial-a-ride problem: Models and algorithms
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse

Cited in

(8)

• The probabilistic orienteering problem
• Vehicle routing with probabilistic capacity constraints
• An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
• Parcel delivery cost minimization with time window constraints using trucks and drones
• Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system
• A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction
• The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
• Typology and literature review for dial-a-ride problems

This page was built for publication: An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays

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