Routing by ranking: A link analysis method for the constrained dial-A-ride problem
Research output: Scientific - peer-review › Article
|Number of pages||6|
|Journal||Operations Research Letters|
|State||Published - 2013|
|MoE publication type||A1 Journal article-refereed|
The dial-a-ride problem involves the dispatching of a fleet of vehicles in order to transport a set of customers from specific pick-up nodes to specific drop-off nodes. Using a modified version of hyperlink-induced topic search (HITS), we characterize hubs as nodes with many out-links to other hubs and calculate a hub score for each pick-up and drop-off node. Ranking the nodes by hub score gives guidance to a backtracking algorithm for efficiently finding feasible solutions to the dial-a-ride problem. © 2013 Elsevier B.V. All rights reserved.
- Dial-a-ride problem, HITS, Link analysis, Topological ordering