Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem

Timo Gschwind
Timo Gschwind
[email protected]
Gutenberg School of Management and Economics, Johannes Gutenberg University Mainz, D-55128 Mainz, Germany
Search for more papers by this author
,
Stefan Irnich
Stefan Irnich
[email protected]
Gutenberg School of Management and Economics, Johannes Gutenberg University Mainz, D-55128 Mainz, Germany
Search for more papers by this author

Timo Gschwind

[email protected]

Gutenberg School of Management and Economics, Johannes Gutenberg University Mainz, D-55128 Mainz, Germany

Search for more papers by this author

Stefan Irnich

[email protected]

Gutenberg School of Management and Economics, Johannes Gutenberg University Mainz, D-55128 Mainz, Germany

Search for more papers by this author

Published Online:18 Sep 2014https://doi.org/10.1287/trsc.2014.0531

Supplemental Material

trsc.2014.0531-sm-ec.pdf (245 KB)

Cited by
- On solving a real-world dial-a-ride problem for disabled passenger transportation in Barcelona
  Transportation Research Part E: Logistics and Transportation Review, Vol. 212
- Anticipatory demand planning for microtransit with strategic use of latent capacity at fixed stops
  Transportation Research Part E: Logistics and Transportation Review, Vol. 212
- Beyond fifty years of vehicle routing: Insights into the history and the future
  European Journal of Operational Research, Vol. 330, No. 2
- Efficient Post-Disaster Emergency Energy Delivery Under Dynamic Constraints: An Electric Vehicle Routing Approach
  IEEE Transactions on Intelligent Transportation Systems, Vol. 27, No. 4
- Subset‐Row Inequalities and Unreachability in Path‐Based Formulations for Vehicle Routing and Scheduling Problems
  22 October 2025 | Networks, Vol. 87, No. 2
- Optimizing customized bus routes with integrated passenger guidance under stochastic travel times
  Expert Systems with Applications, Vol. 297
- On-demand DAR system considering traffic dynamics and network partitioning
  Transportation Research Part C: Emerging Technologies, Vol. 183
- Dial-a-ride operational problems
- Revisiting Large Neighborhood Search with On-the-Fly Charging Station Insertion for the Electric Autonomous Dial-a-Ride Problem
  9 December 2025 | ACM Transactions on Evolutionary Learning and Optimization, Vol. 23
- The Dial-a-Ride Problem with Limited Pickups per Trip
  European Journal of Operational Research, Vol. 327, No. 3
- Boosting column generation with graph neural networks for joint rider trip planning and crew shift scheduling
  Transportation Research Part E: Logistics and Transportation Review, Vol. 202
- Multiple plan approach for a dynamic dial-a-ride problem
  3 February 2025 | OR Spectrum, Vol. 47, No. 3
- The urban air mobility problem
  26 December 2023 | Annals of Operations Research, Vol. 351, No. 1
- An exact branch-and-price-and-cut algorithm for a practical and large-scale dial-a-ride problem
  10 October 2024 | Journal of the Operational Research Society, Vol. 76, No. 6
- A new effective heuristic for the Prisoner Transportation Problem
  European Journal of Operational Research, Vol. 323, No. 3
- The dial-a-ride problem in primary care with flexible scheduling
  9 April 2025 | OR Spectrum, Vol. 34
- A tight formulation for the dial-a-ride problem
  European Journal of Operational Research, Vol. 321, No. 2
- A multiple asset-type, collaborative vehicle routing problem with proximal servicing of demands
  European Journal of Operational Research, Vol. 321, No. 3
- Solving the equity-aware dial-a-ride problem using an exact branch-cut-and-price algorithm
  Transportation Research Part B: Methodological, Vol. 192
- Event-based models for the electric autonomous dial-a-ride problem
  Transportation Research Part C: Emerging Technologies, Vol. 171
- The Dial-a-Tour Problem
  Computers & Operations Research, Vol. 173
- Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
  26 June 2024 | OR Spectrum, Vol. 46, No. 4
- Offline planning and online operation of zonal-based flexible transit service under demand uncertainties and dynamic cancellations
  Transportation Research Part C: Emerging Technologies, Vol. 168
- Flexible Microtransit Scheduling with Time Sensitive Travelers
- A Branch-and-Price algorithm for the electric autonomous Dial-A-Ride Problem
  Transportation Research Part B: Methodological, Vol. 186
- Letting a Large Neighborhood Search for an Electric Dial-A-Ride Problem Fly: On-The-Fly Charging Station Insertion
  14 July 2024
- A scalable combinatorial benders decomposition for the Stochastic Dial-a-Ride Problem
  Transportation Research Part C: Emerging Technologies, Vol. 163
- Vehicle dispatching and routing of on-demand intercity ride-pooling services: A multi-agent hierarchical reinforcement learning approach
  Transportation Research Part E: Logistics and Transportation Review, Vol. 186
- A linearly decreasing deterministic annealing algorithm for the multi-vehicle dial-a-ride problem
  8 February 2024 | PLOS ONE, Vol. 19, No. 2
- Autonomous Ride-Sharing Service Using Graph Embedding and Dial-a-Ride Problem: Application to the Last-Mile Transit in Lyon City
  10 February 2024 | Mathematics, Vol. 12, No. 4
- The Dial-a-Ride Problem
  10 January 2025
- Profits in the Dial-a-Ride Problem
  10 January 2025
- Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
  European Journal of Operational Research, Vol. 312, No. 2
- A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types
  Transportation Research Part E: Logistics and Transportation Review, Vol. 181
- An Exact Method for a First-Mile Ridesharing Problem
  Sihan Wang,
  Roberto Baldacci,
  Yang Yu,
  Yu Zhang,
  Jiafu Tang,
  Xinggang Luo,
  Wei Sun
  29 September 2023 | Transportation Science, Vol. 57, No. 6
- Bilevel large neighborhood search for the electric autonomous dial-a-ride problem
  Transportation Research Interdisciplinary Perspectives, Vol. 21
- Integrating dial-a-ride with transportation network companies for cost efficiency: A Maryland case study
  Transportation Research Part E: Logistics and Transportation Review, Vol. 175
- A Branch-and-Price Algorithm for the Online Scheduling of Valet Drivers
  27 April 2023 | Algorithms, Vol. 16, No. 5
- Decentralized multi-agent approach based on A* algorithm for on-demand transport problem
  15 March 2023 | Web Intelligence, Vol. 21, No. 1
- Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem
  Katrin Heßler,
  Stefan Irnich
  1 December 2022 | INFORMS Journal on Computing, Vol. 35, No. 1
- The Dial-a-Ride Problem with School Bell Time Adjustment
  Samuel Vercraene,
  Fabien Lehuédé,
  Thibaud Monteiro,
  Olivier Péton
  22 July 2022 | Transportation Science, Vol. 57, No. 1
- A Semi-online Ambulance Routing and Scheduling Problem with Complex Patient-Vehicle Relations
  5 September 2023
- A Hierarchical Grouping Algorithm for the Multi-Vehicle Dial-a-Ride Problem
  6 March 2023 | Proceedings of the VLDB Endowment, Vol. 16, No. 5
- A Linearly Decreasing Deterministic Annealing Algorithm for the Multivehicle Dial-a-Ride Problem
  1 January 2023 | SSRN Electronic Journal, Vol. 35
- Comparison of anticipatory algorithms for a dial-a-ride problem
  European Journal of Operational Research, Vol. 301, No. 2
- Event-based MILP models for ridepooling applications
  European Journal of Operational Research, Vol. 301, No. 3
- Clustering-based iterative heuristic framework for a non-emergency patients transportation problem
  Journal of Transport & Health, Vol. 26
- Online Ridesharing with Meeting Points
  20 January 2023 | Proceedings of the VLDB Endowment, Vol. 15, No. 13
- A column generation and Combinatorial Benders Decomposition algorithm for the Selective Dial-A-Ride-Problem
  Computers & Operations Research, Vol. 140
- The vehicle routing problem of intercity ride-sharing between two cities
  Transportation Research Part B: Methodological, Vol. 158
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
  5 November 2021 | OR Spectrum, Vol. 44, No. 1
- Positioning a Handshake Bay for Twin Stacking Cranes in an Automated Container Terminal Yard Block
  Journal of Advanced Transportation, Vol. 2022
- A New Lower Bound for the Static Dial-a-Ride Problem with Ride and Waiting Time Minimization
  5 May 2022
- Routing optimization of shared autonomous electric vehicles under uncertain travel time and uncertain service time
  Transportation Research Part E: Logistics and Transportation Review, Vol. 157
- Zonal-based flexible bus service under elastic stochastic demand
  Transportation Research Part E: Logistics and Transportation Review, Vol. 152
- A congestion-aware Tabu search heuristic to solve the shared autonomous vehicle routing problem
  27 September 2019 | Journal of Intelligent Transportation Systems, Vol. 25, No. 4
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
  Computers & Operations Research, Vol. 129
- Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
  European Journal of Operational Research, Vol. 290, No. 1
- Implementing Horizontal Cooperation in Public Transport and Parcel Deliveries: The Cooperative Share-A-Ride Problem
  14 April 2021 | Sustainability, Vol. 13, No. 8
- The benefits of autonomous vehicles for community-based trip sharing
  Transportation Research Part C: Emerging Technologies, Vol. 124
- Accurate Tracking, Collision Detection, and Optimal Scheduling of Airport Ground Support Equipment
  IEEE Internet of Things Journal, Vol. 8, No. 1
- Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location
  14 September 2019 | Networks, Vol. 75, No. 1
- PTAS for the Euclidean Capacitated Vehicle Routing Problem with Time Windows
  22 January 2020
- A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing
  Omega, Vol. 89
- Exact Branch-Price-and-Cut Algorithms for Vehicle Routing
  Luciano Costa,
  Claudio Contardo,
  Guy Desaulniers
  28 June 2019 | Transportation Science, Vol. 53, No. 4
- Route feasibility testing and forward time slack for the Synchronized Pickup and Delivery Problem
  17 December 2018 | OR Spectrum, Vol. 41, No. 2
- Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem
  Timo Gschwind,
  Michael Drexl
  14 January 2019 | Transportation Science, Vol. 53, No. 2
- A Two-Phase Branch-and-Price-and-Cut for a Dial-a-Ride Problem in Patient Transportation
  Zhixing Luo,
  Mengyang Liu,
  Andrew Lim
  1 August 2018 | Transportation Science, Vol. 53, No. 1
- Approximation Scheme for the Capacitated Vehicle Routing Problem with Time Windows and Non-uniform Demand
  12 June 2019
- Towards an efficient approximability for the Euclidean Capacitated Vehicle Routing Problem with Time Windows and multiple depots
  IFAC-PapersOnLine, Vol. 52, No. 13
- Operational Design for a Real-Time Flexible Transit System Considering Passenger Demand and Willingness to Pay
  IEEE Access, Vol. 7
- A survey of dial-a-ride problems: Literature review and recent developments
  Transportation Research Part B: Methodological, Vol. 111
- Typology and literature review for dial-a-ride problems
  18 May 2017 | Annals of Operations Research, Vol. 259, No. 1-2
- Benefits of horizontal cooperation in dial-a-ride services
  Transportation Research Part E: Logistics and Transportation Review, Vol. 107
- Congestion-aware system optimal route choice for shared autonomous vehicles
  Transportation Research Part C: Emerging Technologies, Vol. 82
- Exact approaches for the pickup and delivery problem with loading cost
  Omega, Vol. 59
- A comparison of column-generation approaches to the Synchronized Pickup and Delivery Problem
  European Journal of Operational Research, Vol. 247, No. 1

Volume 49, Issue 2

May 2015

Pages 163-431

Article Information

Supplemental Material

Metrics

Information

Received:April 01, 2013
Accepted:January 01, 2014
Published Online:September 18, 2014

Cite as

Timo Gschwind, Stefan Irnich (2014) Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem. Transportation Science 49(2):335-354.

https://doi.org/10.1287/trsc.2014.0531

Keywords

PDF download

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Available Issues

Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem

Supplemental Material

Volume 49, Issue 2

Article Information

Supplemental Material

Metrics

Information

Cite as

Keywords

Sign Up for INFORMS Publications Updates and News