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

Travel time
Mathematical models
Costs

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
Domuţa, Claudiu ; Tipi, Nicoleta S. ; Radu, Dan ; Hulea, Mihai ; Aştilean, Adina. / Finding intermodal and multi-objective time-dependent best routes with exact algorithm. 2012 IEEE International Conference on Automation, Quality and Testing, Robotics, AQTR 2012 - Proceedings. 2012. pp. 531-535
@inproceedings{a7c5e0a0006b44d1ae8d5aa7dd03e348,
title = "Finding intermodal and multi-objective time-dependent best routes with exact algorithm",
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.",
keywords = "intermodal transportation, Martins' algorithm, multi-objective, non-dominated paths, Pareto front",
author = "Claudiu Domuţa and Tipi, {Nicoleta S.} and Dan Radu and Mihai Hulea and Adina Aştilean",
year = "2012",
doi = "10.1109/AQTR.2012.6237768",
language = "English",
isbn = "9781467307024",
pages = "531--535",
booktitle = "2012 IEEE International Conference on Automation, Quality and Testing, Robotics, AQTR 2012 - Proceedings",

}

Domuţa, C, Tipi, NS, 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., 6237768, pp. 531-535, 18th IEEE International Conference on Automation, Quality and Testing, Robotics, Cluj-Napoca, Romania, 24/05/12. https://doi.org/10.1109/AQTR.2012.6237768

Finding intermodal and multi-objective time-dependent best routes with exact algorithm. / Domuţa, Claudiu; Tipi, Nicoleta S.; Radu, Dan; Hulea, Mihai; Aştilean, Adina.

2012 IEEE International Conference on Automation, Quality and Testing, Robotics, AQTR 2012 - Proceedings. 2012. p. 531-535 6237768.

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

TY - GEN

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

AU - Domuţa, Claudiu

AU - Tipi, Nicoleta S.

AU - Radu, Dan

AU - Hulea, Mihai

AU - Aştilean, Adina

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - intermodal transportation

KW - Martins' algorithm

KW - multi-objective

KW - non-dominated paths

KW - Pareto front

UR - http://www.scopus.com/inward/record.url?scp=84864982539&partnerID=8YFLogxK

U2 - 10.1109/AQTR.2012.6237768

DO - 10.1109/AQTR.2012.6237768

M3 - Conference contribution

SN - 9781467307024

SP - 531

EP - 535

BT - 2012 IEEE International Conference on Automation, Quality and Testing, Robotics, AQTR 2012 - Proceedings

ER -

Domuţa C, Tipi NS, Radu D, Hulea M, Aştilean A. 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. 2012. p. 531-535. 6237768 https://doi.org/10.1109/AQTR.2012.6237768