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

Research output: Scientific - peer-reviewArticle

Standard

Routing by ranking : A link analysis method for the constrained dial-A-ride problem. / Häme, Lauri; Hakula, Harri.

In: Operations Research Letters, Vol. 41, No. 6, 2013, p. 664-669.

Research output: Scientific - peer-reviewArticle

Harvard

APA

Vancouver

Author

Häme, Lauri; Hakula, Harri / Routing by ranking : A link analysis method for the constrained dial-A-ride problem.

In: Operations Research Letters, Vol. 41, No. 6, 2013, p. 664-669.

Research output: Scientific - peer-reviewArticle

Bibtex - Download

@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äme and Harri Hakula",
year = "2013",
doi = "10.1016/j.orl.2013.09.007",
volume = "41",
pages = "664--669",
journal = "OPERATIONS RESEARCH LETTERS",
issn = "0167-6377",
publisher = "Elsevier",
number = "6",

}

RIS - Download

TY - JOUR

T1 - Routing by ranking

T2 - OPERATIONS RESEARCH LETTERS

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

VL - 41

SP - 664

EP - 669

JO - OPERATIONS RESEARCH LETTERS

JF - OPERATIONS RESEARCH LETTERS

SN - 0167-6377

IS - 6

ER -

ID: 12919706