A mathematical model and a memetic algorithm for berth allocation at inland waterway terminals in developing countries
This paper addresses the Berth Allocation Problem (BAP) in multipurpose Inland Water Transport (IWT) terminals operated in developing countries like India. Conceptually, these are different from the specialized IWT ports operated in developed countries. The IWT terminals in developing countries face issues due to complex combination of cargo types, their mix on barges, variability in handling equipment, and direct transloading in trucks. This paper adds to the research on BAP which otherwise has primarily focused on specialized seaports or IWT ports in developed countries. We developed a mathematical model to deal with BAP in multipurpose IWT terminals which minimizes the waiting and total completion times of the barges. We further propose a novel memetic algorithm (MA), an artificial intelligence (AI) based optimization technique that integrates a genetic algorithm with a local search to obtain near-optimal solutions efficiently. Using real-world data from an Indian IWT terminal, extensive computational experiments are conducted to validate the models’ effectiveness and the algorithm’s efficiency. A sensitivity analysis is carried out to deliver managerial insights. The developed AI?driven method can replace the first-come-first-served (FCFS) approach that is presently in use at IWT termi?nals in developing nations like India. It would improve their operational efficiency and competitiveness
Funding
Ministry of Education, Government of India, and the Commonwealth Scholarship Commission
History
School
- Loughborough Business School
Published in
Engineering Applications of Artificial IntelligenceVolume
152Publisher
Elsevier LtdVersion
- AM (Accepted Manuscript)
Rights holder
© Elsevier LtdPublisher statement
This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/Acceptance date
2025-04-08Publication date
2025-04-19Copyright date
2025ISSN
0952-1976Publisher version
Language
- en