Nielsen, Lars Relund () (Research Unit of Statistics and Decision Analysis) Andersen, Kim Allan () (Department of Management Science and Logistics, Aarhus School of Business) Pretolani, Daniele () (Department of Sciences and Methods of Engineering)
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
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by University of Aarhus, Aarhus School of Business, Department of Business Studies in its series CORAL Working Papers with number
L-2006-10.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: