Solving Transport Infrastructure Investment Project Selection and Scheduling Using Genetic Algorithms

被引:0
作者
Jecmen, Karel [1 ]
Mockova, Denisa [1 ]
Teichmann, Dusan [1 ]
机构
[1] Czech Tech Univ, Dept Air Transport, Prague 12803, Czech Republic
关键词
genetic algorithms; multiple knapsack problem; scheduling; transport infrastructure investment projects; transport infrastructure development; BOUND ALGORITHM;
D O I
10.3390/math12193056
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The development of transport infrastructure is crucial for economic growth, social connectivity, and sustainable development. Many countries have historically underinvested in transport infrastructure, necessitating more efficient strategic planning in the implementation of transport infrastructure investment projects. This article addresses the selection and scheduling of transport infrastructure projects, specifically within the context of utilizing pre-allocated funds within a multi-annual budget investment program. The current decision-making process relies heavily on expert judgment and lacks quantitative decision support methods. We propose a genetic algorithm as a decision-support tool, framing the problem as an NP-hard 0-1 multiple knapsack problem. The proposed genetic algorithm (GA) is unique for its matrix-encoded chromosomes, specially designed genetic operators, and a customized repair operator to address the large number of invalid chromosomes generated during the GA computation. In computational experiments, the proposed GA is compared to an exact solution and proves to be efficient in terms of quality of obtained solutions and computational time, with an average computational time of 108 s and the quality of obtained solutions typically ranging between 85% and 95% of the optimal solution. These results highlight the potential of the proposed GA to enhance strategic decision-making in transport infrastructure development.
引用
收藏
页数:28
相关论文
共 55 条
[31]   The efficiency of transport infrastructure investment and the role of government quality: An empirical analysis [J].
Kyriacou, Andreas P. ;
Muinelo-Gallo, Leonel ;
Roca-Sagales, Oriol .
TRANSPORT POLICY, 2019, 74 :93-102
[32]   A Branch-and-Price Algorithm for the Multiple Knapsack Problem [J].
Lalonde, Olivier ;
Cote, Jean-Francois ;
Gendron, Bernard .
INFORMS JOURNAL ON COMPUTING, 2022, 34 (06) :3134-3150
[33]   2-D Parameter Estimation of Near Field Source Based on Robust Propagator Method [J].
Li, Sen ;
Lin, Bin ;
Li, Bing ;
He, Rongxi .
IEEE JOURNAL OF RADIO FREQUENCY IDENTIFICATION, 2019, 3 (03) :157-163
[34]   A New Artificial Fish Swarm Algorithm for the Multiple Knapsack Problem [J].
Liu, Qing ;
Odaka, Tomohiro ;
Kuroiwa, Jousuke ;
Shirai, Haruhiko ;
Ogura, Hisakazu .
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2014, E97D (03) :455-468
[35]   The contribution of transport infrastructure to economic activity: The case of Belgium [J].
Meersman H. ;
Nazemzadeh M. .
Case Studies on Transport Policy, 2017, 5 (02) :316-324
[36]   An Improved Genetic Algorithm for Solving the Multi-AGV Flexible Job Shop Scheduling Problem [J].
Meng, Leilei ;
Cheng, Weiyao ;
Zhang, Biao ;
Zou, Wenqiang ;
Fang, Weikang ;
Duan, Peng .
SENSORS, 2023, 23 (08)
[37]   Optimizing the selection and scheduling of multi-class projects using a Stackelberg framework [J].
Miralinaghi, Mohammad ;
Seilabi, Sania E. ;
Chen, Sikai ;
Hsu, Yu-Ting ;
Labi, Samuel .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 286 (02) :508-522
[38]   Cost overruns of Belgian transport infrastructure projects: Analyzing variations over three land transport modes and two project phases [J].
Molinari, Laura ;
Haezendonck, Elvira ;
Mabillard, Vincent .
TRANSPORT POLICY, 2023, 134 :167-179
[39]   Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning [J].
Morrison, David R. ;
Jacobson, Sheldon H. ;
Sauppe, Jason J. ;
Sewell, Edward C. .
DISCRETE OPTIMIZATION, 2016, 19 :79-102
[40]   An integrated rough group multicriteria decision-making model for the ex-ante prioritization of infrastructure projects: The Serbian Railways case [J].
Pamucar, Dragan ;
Macura, Dragana ;
Tavana, Madjid ;
Bozanic, Darko ;
Knezevic, Nikola .
SOCIO-ECONOMIC PLANNING SCIENCES, 2022, 79