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

Lauri Häme; Harri Hakula

doi:10.1016/j.orl.2013.09.007

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

Lauri Häme^*, Harri Hakula

^*Corresponding author for this work

Department of Mathematics and Systems Analysis

Research output: Contribution to journal › Article › Scientific › peer-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 language	English
Pages (from-to)	664-669
Number of pages	6
Journal	Operations Research Letters
Volume	41
Issue number	6
DOIs	https://doi.org/10.1016/j.orl.2013.09.007
Publication status	Published - 2013
MoE publication type	A1 Journal article-refereed

Keywords

Dial-a-ride problem
HITS
Link analysis
Topological ordering

Access to Document

10.1016/j.orl.2013.09.007

Link to publication in Scopus

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

@article{21ad2759c1334957a9cb372641e7e4d3,

title = "Routing by ranking: A link analysis method for the constrained dial-A-ride problem",

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, HITS, Link analysis, Topological ordering",

author = "Lauri H{\"a}me and Harri Hakula",

year = "2013",

doi = "10.1016/j.orl.2013.09.007",

language = "English",

volume = "41",

pages = "664--669",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "6",

}

TY - JOUR

T1 - Routing by ranking

T2 - A link analysis method for the constrained dial-A-ride problem

AU - Häme, Lauri

AU - Hakula, Harri

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - Dial-a-ride problem

KW - HITS

KW - Link analysis

KW - Topological ordering

UR - http://www.scopus.com/inward/record.url?scp=84885338588&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2013.09.007

DO - 10.1016/j.orl.2013.09.007

M3 - Article

AN - SCOPUS:84885338588

VL - 41

SP - 664

EP - 669

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 6

ER -