Finding intermodal and multi-objective time-dependent best routes with exact algorithm

Claudiu Domuţa, Nicoleta S. Tipi, Dan Radu, Mihai Hulea, Adina Aştilean

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The paper presents a solution of finding the Pareto front for the intermodal and multi-objective time-dependent shortest path problem from a source to a destination. In the considered case, the travel time and route cost must be minimized. A mathematical model of the multimodal time-dependent freight transport network is constructed and then an exact multi-objective algorithm is proposed and implemented. Finally, the performance and effectiveness of the method are assessed by analyzing the algorithm's behavior when different network's parameters change.

Original languageEnglish
Title of host publication2012 IEEE International Conference on Automation, Quality and Testing, Robotics, AQTR 2012 - Proceedings
Pages531-535
Number of pages5
DOIs
Publication statusPublished - 2012
Event18th IEEE International Conference on Automation, Quality and Testing, Robotics - Cluj-Napoca, Romania
Duration: 24 May 201227 May 2012
Conference number: 18

Conference

Conference18th IEEE International Conference on Automation, Quality and Testing, Robotics
Abbreviated titleAQTR 2012
CountryRomania
CityCluj-Napoca
Period24/05/1227/05/12

Fingerprint Dive into the research topics of 'Finding intermodal and multi-objective time-dependent best routes with exact algorithm'. Together they form a unique fingerprint.

  • Cite this

    Domuţa, C., Tipi, N. S., Radu, D., Hulea, M., & Aştilean, A. (2012). Finding intermodal and multi-objective time-dependent best routes with exact algorithm. In 2012 IEEE International Conference on Automation, Quality and Testing, Robotics, AQTR 2012 - Proceedings (pp. 531-535). [6237768] https://doi.org/10.1109/AQTR.2012.6237768