Next Article in Journal
Solitons, Lumps, Breathers, and Interaction Phenomena for a (21)-Dimensional Variable-Coefficient Extended Shallow-Water Wave Equation+
Previous Article in Journal
Parametric Optimization for Fully Fuzzy Linear Programming Problems with Triangular Fuzzy Numbers
Previous Article in Special Issue
Integrating Risk-Averse and Constrained Reinforcement Learning for Robust Decision-Making in High-Stakes Scenarios
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Article

Solving Transport Infrastructure Investment Project Selection and Scheduling Using Genetic Algorithms

Department of Air Transport, Czech Technical University in Prague, 128 03 Prague, Czech Republic
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(19), 3056; https://doi.org/10.3390/math12193056 (registering DOI)
Submission received: 30 August 2024 / Revised: 18 September 2024 / Accepted: 27 September 2024 / Published: 29 September 2024

Abstract

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.
Keywords: genetic algorithms; multiple knapsack problem; scheduling; transport infrastructure investment projects; transport infrastructure development genetic algorithms; multiple knapsack problem; scheduling; transport infrastructure investment projects; transport infrastructure development

Share and Cite

MDPI and ACS Style

Ječmen, K.; Mocková, D.; Teichmann, D. Solving Transport Infrastructure Investment Project Selection and Scheduling Using Genetic Algorithms. Mathematics 2024, 12, 3056. https://doi.org/10.3390/math12193056

AMA Style

Ječmen K, Mocková D, Teichmann D. Solving Transport Infrastructure Investment Project Selection and Scheduling Using Genetic Algorithms. Mathematics. 2024; 12(19):3056. https://doi.org/10.3390/math12193056

Chicago/Turabian Style

Ječmen, Karel, Denisa Mocková, and Dušan Teichmann. 2024. "Solving Transport Infrastructure Investment Project Selection and Scheduling Using Genetic Algorithms" Mathematics 12, no. 19: 3056. https://doi.org/10.3390/math12193056

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop