Lars Relund Nielsen (), Kim Allan Andersen () and Daniele Pretolani ()
Additional contact information
Lars Relund Nielsen: Research Unit of Statistics and Decision Analysis, Postal: DIAS, P.O. Box 50, DK-8830 Tjele, Denmark
Kim Allan Andersen: Department of Management Science and Logistics, Aarhus School of Business, Postal: The Aarhus School of Business, Fuglesangs Allé 4, 8210 Aarhus V, Denmark
Daniele Pretolani: Department of Sciences and Methods of Engineering, Postal: University of Modena and Reggio Emilia, Via Amendola 2, I-42100 Reggio Emilia, Italy
Abstract: In recent years there has been a growing interest in using stochastic time-dependent (STD) networks as a modelling tool for a number of applications within such areas as transportation and telecommunications. It is known that an optimal routing policy does not necessarily correspond to a path, but rather to a time-adaptive strategy. In some applications, however, it makes good sense to require that the routing policy corresponds to a loopless path in the network, that is, the time-adaptive aspect disappears and a priori route choice is considered.
In this paper we consider bicriterion a priori route choice in STD networks, i.e. the problem of finding the set of efficient paths. Both expectation and min-max criteria are considered and a solution method based on the two-phase approach is devised. Experimental results reveal that the full set of efficient solutions can be determined on rather large test instances, which is in contrast to previously reported results for the time-adaptive case
Keywords: Stochastic time-dependent networks; Bicriterion shortest path; A priori route choice; Two-phase method
23 pages, September 18, 2006
Full text files
L_2006_10.pdf
Questions (including download problems) about the papers in this series should be directed to Helle Vinbaek Stenholt ()
Report other problems with accessing this service to Sune Karlsson ().
RePEc:hhb:aarbls:2006-010This page generated on 2024-09-13 22:18:12.