| Article ID: | iaor20102959 |
| Volume: | 37 |
| Issue: | 3 |
| Start Page Number: | 201 |
| End Page Number: | 205 |
| Publication Date: | May 2009 |
| Journal: | Operations Research Letters |
| Authors: | Pretolani Daniele, Andersen Kim Allan, Ehrgott Matthias, Nielsen Lars Relund |
| Keywords: | vehicle routing & scheduling |
We compare two different models for multicriterion routing in stochastic time-dependent networks: the classic ‘time-adaptive’ model and the more flexible ‘history-adaptive’ one. We point out several properties of the sets of efficient solutions found under the two models. We also devise a method for finding supported history-adaptive solutions.