Routing by ranking: A link analysis method for the constrained dial-A-ride problem

Lauri Häme*, Harri Hakula

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

4 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)664-669
Number of pages6
JournalOperations Research Letters
Volume41
Issue number6
DOIs
Publication statusPublished - 2013
MoE publication typeA1 Journal article-refereed

Keywords

  • Dial-a-ride problem
  • HITS
  • Link analysis
  • Topological ordering

Fingerprint Dive into the research topics of 'Routing by ranking: A link analysis method for the constrained dial-A-ride problem'. Together they form a unique fingerprint.

Cite this