A maximum cluster algorithm for checking the feasibility of dial-a-ride instances
Year of publication: |
2015
|
---|---|
Authors: | Häme, Lauri ; Hakula, Harri |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 49.2015, 2, p. 295-310
|
Subject: | dial-a-ride problem | algorithms | dynamic programming | Mathematische Optimierung | Mathematical programming | Clusteranalyse | Cluster analysis | USA | United States | Theorie | Theory | Algorithmus | Algorithm |
-
Multiechelon lot sizing : new complexities and inequalities
Zhao, Ming, (2020)
-
Moazeni, Somayeh, (2020)
-
Schilde, Michael, (2014)
- More ...
-
Dynamic journeying under uncertainty
Häme, Lauri, (2013)
-
Routing by ranking : a link analysis method for the constrained dial-a-ride problem
Häme, Lauri, (2013)
-
Dynamic journeying under uncertaincy
Häme, Lauri, (2013)
- More ...