Routing by ranking : a link analysis method for the constrained dial-a-ride problem
Year of publication: |
2013
|
---|---|
Authors: | Häme, Lauri ; Hakula, Harri |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 41.2013, 6, p. 664-669
|
Subject: | Dial-a-ride problem | Link analysis | HITS | Topological ordering |
-
Determining operations affected by delay in predictive train timetables
Burdett, Robert, (2014)
-
Samavati, Mehran, (2017)
-
Formal versus self-organised knowledge systems: A network approach
Masucci, A.P., (2011)
- More ...
-
A maximum cluster algorithm for checking the feasibility of dial-a-ride instances
Häme, Lauri, (2015)
-
Dynamic journeying under uncertaincy
Häme, Lauri, (2013)
-
Dynamic journeying under uncertainty
Häme, Lauri, (2013)
- More ...