Daniele Pretolani (), Lars Relund Nielsen (), Kim Allan Andersen () and Matthias Ehrgott ()
Additional contact information
Daniele Pretolani: Department of Sciences and Methods of Engineering, Postal: University of Modena and Reggio Emilia, Via Amendola 2, I-42100 Reggio Emilia, Italy
Lars Relund Nielsen: Department of Genetics and Biotechnology, Postal: University of Aarhus, P.O.Box 50, DK-8830 Tjele, Denmark
Kim Allan Andersen: Department of Business Studies, Aarhus School of Business, Postal: The Aarhus School of Business, Fuglesangs Allé 4, 8210 Aarhus V, Denmark
Matthias Ehrgott: Department of Engineering Science, Postal: The University of Auckland, Private Bag 92019, Auckland 1142, New Zealand
Abstract: We compare two different models for multicriterion routing in stochastic time-dependent networks: the classic "time-adaptive'' route choice and the more flexible "history-adaptive'' route choice. We point out some interesting properties of the sets of efficient solutions ("strategies'') found under the two models. We also suggest possible directions for improving computational techniques.
Keywords: Multiple objective programming; shortest paths; stochastic
19 pages, August 26, 2008
Full text files
L_2008_05.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:2008-005This page generated on 2024-09-13 22:19:08.