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

doi:10.1109/AQTR.2012.6237768

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

Northern Productivity Hub

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Citation (Scopus)

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 language	English
Title of host publication	2012 IEEE International Conference on Automation, Quality and Testing, Robotics, AQTR 2012 - Proceedings
Pages	531-535
Number of pages	5
DOIs	https://doi.org/10.1109/AQTR.2012.6237768
Publication status	Published - 2012
Event	18th IEEE International Conference on Automation, Quality and Testing, Robotics - Cluj-Napoca, Romania Duration: 24 May 2012 → 27 May 2012 Conference number: 18

Conference

Conference	18th IEEE International Conference on Automation, Quality and Testing, Robotics
Abbreviated title	AQTR 2012
Country/Territory	Romania
City	Cluj-Napoca
Period	24/05/12 → 27/05/12

Access to Document

10.1109/AQTR.2012.6237768

Cite this

@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{\c t}a and Tipi, {Nicoleta S.} and Dan Radu and Mihai Hulea and Adina A{\c s}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",

note = "18th IEEE International Conference on Automation, Quality and Testing, Robotics, AQTR 2012 ; Conference date: 24-05-2012 Through 27-05-2012",

}

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 et al.

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 proceeding › Conference contribution › peer-review

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

N1 - Conference code: 18

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

AN - SCOPUS:84864982539

SN - 9781467307024

SP - 531

EP - 535

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

T2 - 18th IEEE International Conference on Automation, Quality and Testing, Robotics

Y2 - 24 May 2012 through 27 May 2012

ER -

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

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this