A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction
DOI10.1016/J.EJOR.2022.01.033OpenAlexW4207052675WikidataQ114184360 ScholiaQ114184360MaRDI QIDQ2672126
Shanchuan Yu, Yuehui Wu, Chang Lu
Publication date: 8 June 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.01.033
routingdemand responsive transitmultigraph routing problemstochastic dial-a-ride problemuser satisfaction
Programming involving graphs or networks (90C35) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Local search heuristics for the probabilistic dial-a-ride problem
- A unified heuristic for a large class of vehicle routing problems with backhauls
- On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands
- Empirical analysis for the VRPTW with a multigraph representation for the road network
- Typology and literature review for dial-a-ride problems
- Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows
- A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- The Sample Average Approximation Method for Stochastic Discrete Optimization
This page was built for publication: A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction
