Routing by ranking: A link analysis method for the constrained dial-a-ride problem |
| |
Authors: | Lauri Hä me,Harri Hakula |
| |
Affiliation: | Department of Mathematics and Systems Analysis, Aalto University School of Science, P.O. Box 11100, FI-00076 Aalto, Finland |
| |
Abstract: | 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. |
| |
Keywords: | Dial-a-ride problem Link analysis HITS Topological ordering |
本文献已被 ScienceDirect 等数据库收录! |