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

DOI10.1016/j.dam.2011.01.021zbMath1220.90075OpenAlexW2093856210MaRDI QIDQ540153

Jean-François Cordeau, Géraldine Heilporn, Gilbert 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

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

Related Items

An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization, Vehicle routing with probabilistic capacity constraints, The probabilistic orienteering problem, A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction, 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, Typology and literature review for dial-a-ride problems

Cites Work

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