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
相关论文
共 61 条
[1]   Infrastructure investment planning through scenario-based system-of-systems modelling [J].
Asgarpour, Sahand ;
Hartmann, Andreas ;
Gkiotsalitis, Konstantinos .
TRANSPORTATION PLANNING AND TECHNOLOGY, 2023, 46 (05) :527-572
[2]  
Assi M, 2018, INT ARAB CONF INF TE, P167
[3]   Optimization for Roads' Construction: Selection, Prioritization, and Scheduling [J].
Bagloee, Saeed Asadi ;
Sarvi, Majid ;
Patriksson, Michael ;
Asadi, Mohsen .
COMPUTER-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING, 2018, 33 (10) :833-848
[4]   Solving efficiently the 0-1 multi-objective knapsack problem [J].
Bazgan, Cristina ;
Hugot, Hadrien ;
Vanderpooten, Daniel .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (01) :260-279
[5]  
Berberler Murat Ersen, 2013, Mathematical and Computational Applications, V18, P486
[6]   MATHEMATICAL MODELLING AS AN ELEMENT OF PLANNING RAIL TRANSPORT STRATEGIES [J].
Borucka, Anna ;
Mazurkiewicz, Dariusz ;
Lagowska, Eliza .
TRANSPORT, 2021, 36 (04) :354-363
[7]   Ants and multiple knapsack problem [J].
Boryczka, Urszula .
6TH INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL MANAGEMENT APPLICATIONS, PROCEEDINGS, 2007, :149-+
[8]   Multi-criteria analysis of transport infrastructure projects [J].
Broniewicz, Elzbieta ;
Ogrodnik, Karolina .
TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT, 2020, 83
[9]   Knapsack problems - An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems [J].
Cacchiani, Valentina ;
Iori, Manuel ;
Locatelli, Alberto ;
Martello, Silvano .
COMPUTERS & OPERATIONS RESEARCH, 2022, 143
[10]  
Chen D, 2018, INT CONF CLOUD COMPU, P507, DOI 10.1109/CCIS.2018.8691205