Article ID: | iaor20119105 |
Volume: | 61 |
Issue: | 2 |
Start Page Number: | 391 |
End Page Number: | 401 |
Publication Date: | Sep 2011 |
Journal: | Computers & Industrial Engineering |
Authors: | Ayed H, Galvez-Fernandez C, Habbas Z, Khadraoui D |
Keywords: | vehicle routing & scheduling, graphs |
In this paper we present an hybrid approach for solving the time‐dependent multimodal transport problem. This approach has been tested on realistic instances of the problem providing an adequate balance between computation time and memory space. This solution can be applied to real transport networks in order to reduce the impact of traffic congestion on pollution, economy, and citizen’s welfare. A comparison with two previous approaches are given from theoretical point of view as well as experimental performance.