EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Multi-objective optimization for multimodal transportation routing problem with stochastic transportation time based on data-driven approaches

Yong Peng, Shu Han Gao, Dennis Yu, Yun Peng Xiao, Yi Juan Luo

RAIRO - Operations Research · 2023-07 · 57 (4) · 1745-1765

DOI: 10.1051/ro/2023090 ↗

Kurz gefasst

Fachartikel in der Zeitschrift RAIRO - Operations Research, online erschienen am 11.07.2023. Verfasst von Yong Peng und 4 weiteren Autor:innen. Die Arbeit wurde bisher 31-mal zitiert (Crossref) und nennt 47 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Chongqing Social Science Planning Fund, Chongqing Municipal Transportation Bureau.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We study a multi-objective optimization model of a stochastic multimodal transportation network considering key impact factors such as transit cost, time, and transport mode schedule while minimizing total transportation cost and transportation time. In this study, we apply the Monte Carlo simulation to deal with the stochastic transportation time in the network and propose a data-driven approach that combines historical data and the dataset generated by the data mining algorithm to accelerate the search for the nondominated solution in the simulation. To validate the effectiveness of the proposed Data-Driven Multi-Objective Simulation Ant Colony (DD-MSAC) algorithm, we compare the optimum-seeking performance and the running time consumption of the Nondominated Sorting Genetic Algorithm-II (NSGA-II) and the Multi-Objective Simulation Ant Colony (MSAC) algorithm. Then, the MSAC algorithm is adopted as the benchmark for the comparison study on the solving performance of the proposed DD-MSAC algorithm. We conducted 30 times simulation run under different network scales in our numerical examples to show that the DD-MSAC algorithm can be equally effective as the non-data-driven MSAC algorithm in finding a nondominated solution as the average error does not exceed 5%. Meanwhile, we analyze the impact of different data-driven approaches, including data pool and support vector machine, on the solution quality and the running time. Finally, we use an example of China’s Belt Road Initiative to verify the effectiveness of the proposed algorithm.

Förderung

  • Chongqing Social Science Planning Fund
  • Chongqing Municipal Transportation Bureau

Zitieren

APA

Peng, Y., Gao, S. H., Yu, D., Xiao, Y. P., & Luo, Y. J. (2023). Multi-objective optimization for multimodal transportation routing problem with stochastic transportation time based on data-driven approaches. RAIRO - Operations Research, 57(4), 1745-1765. https://doi.org/10.1051/ro/2023090

Vancouver

Peng Y, Gao SH, Yu D, Xiao YP, Luo YJ. Multi-objective optimization for multimodal transportation routing problem with stochastic transportation time based on data-driven approaches. RAIRO - Operations Research. 2023;57(4):1745-1765. doi:10.1051/ro/2023090

BibTeX
@article{Peng2023,
  author = {Peng, Yong and Gao, Shu Han and Yu, Dennis and Xiao, Yun Peng and Luo, Yi Juan},
  title = {Multi-objective optimization for multimodal transportation routing problem with stochastic transportation time based on data-driven approaches},
  journal = {RAIRO - Operations Research},
  year = {2023},
  volume = {57},
  number = {4},
  pages = {1745--1765},
  doi = {10.1051/ro/2023090}
}
Kostenlos starten →