Effective handling of dynamic time windows and its application to solving the dial-a-ride problem

Publikationstyp:
Zeitschriftenaufsatz
Metadaten:
Autoren
  • Timo Gschwind
  • Stefan Irnich
Sammlungen
  • metadata
ISSN
0041-1655
Ausgabe der Veröffentlichung
2
Schlüsselwörter
  • 330 Wirtschaft
  • 330 Economics
Sprache
eng
Paginierung
Seiten: 335 - 354
Datum der Veröffentlichung
2015
Herausgeber
INFORMS
Herausgeber URL
http://dx.doi.org/10.1287/trsc.2014.0531
Datum der Datenerfassung
2020
Datum, an dem der Datensatz öffentlich gemacht wurde
2020
Zugang
Public
Titel
Effective handling of dynamic time windows and its application to solving the dial-a-ride problem
Ausgabe der Zeitschrift
49

Datenquelle: METADATA.UB

Andere Metadatenquellen:
Autoren
  • Timo Gschwind
  • Stefan Irnich
Autoren-URL
https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=fis-test-1&SrcAuth=WosAPI&KeyUT=WOS:000354704200012&DestLinkType=FullRecord&DestApp=WOS_CPL
DOI
10.1287/trsc.2014.0531
Externe Identifier
  • Clarivate Analytics Document Solution ID: CI4FV
ISSN
0041-1655
Ausgabe der Veröffentlichung
2
Zeitschrift
TRANSPORTATION SCIENCE
Schlüsselwörter
  • transportation
  • vehicle routing
  • dynamic time windows
  • dial-a-ride problem
  • labeling algorithm
  • ride-time constraints
  • time synchronization
  • branch-and-price
Paginierung
335 - 354
Datum der Veröffentlichung
2015
Status
Published
Titel
Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem
Sub types
  • Article
Ausgabe der Zeitschrift
49

Datenquelle: Web of Science (Lite)

Abstract
<jats:p> A dynamic time window relates to two operations that must be executed within a given time meaning that the difference between the points in time when the two operations are performed is bounded from above. The most prevalent context of dynamic time windows is when precedence is given for the two operations so that it is a priori specified that one operation must take place before the other. A prominent vehicle routing problem with dynamic time windows and precedence is the dial-a-ride problem (DARP), where user-specified transportation requests from origin to destination points must be serviced. The paper presents a new branch-and-cut-and-price solution approach for the DARP, the prototypical vehicle-routing problem with ordinary and dynamic time windows. For the first time (to our knowledge), both ordinary and dynamic time windows are handled in the column-generation subproblem. For the solution, an effective column-generation pricing procedure is derived that allows fast shortest-path computations due to new dominance rules. The new approach is compared with alternative column-generation algorithms that handle dynamic time windows either as constraints of the master program or with less effective labeling procedures. Computational experiments indicate the superiority of the new approach. </jats:p>
Autoren
  • Timo Gschwind
  • Stefan Irnich
DOI
10.1287/trsc.2014.0531
eISSN
1526-5447
ISSN
0041-1655
Ausgabe der Veröffentlichung
2
Zeitschrift
Transportation Science
Sprache
en
Paginierung
335 - 354
Datum der Veröffentlichung
2015
Status
Published
Herausgeber
Institute for Operations Research and the Management Sciences (INFORMS)
Herausgeber URL
http://dx.doi.org/10.1287/trsc.2014.0531
Datum der Datenerfassung
2023
Titel
Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem
Ausgabe der Zeitschrift
49

Datenquelle: Crossref

Autoren
  • Timo Gschwind
  • Stefan Irnich
DOI
10.1287/trsc.2014.0531
Zeitschrift
Transp. Sci.
Artikelnummer
2
Paginierung
335 - 354
Datum der Veröffentlichung
2015
Titel
Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem.
Ausgabe der Zeitschrift
49

Datenquelle: DBLP

Beziehungen:
Eigentum von

Werkzeuge