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

Tutkimustuotos: Lehtiartikkelivertaisarvioitu

Tutkijat

Organisaatiot

Kuvaus

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.

Yksityiskohdat

AlkuperäiskieliEnglanti
Sivut664-669
Sivumäärä6
JulkaisuOperations Research Letters
Vuosikerta41
Numero6
TilaJulkaistu - 2013
OKM-julkaisutyyppiA1 Julkaistu artikkeli, soviteltu

ID: 12919706