Optimization of multistage timeliness transit consolidation problem using adaptive-weighted genetic algorithm

Bowen Lv (), Bin Yang () and Ek Peng Chew ()
Additional contact information
Bowen Lv: Shanghai Maritime University
Bin Yang: Shanghai Maritime University
Ek Peng Chew: National University of Singapore

Annals of Operations Research, 2025, vol. 346, issue 2, No 24, 1345-1376

Abstract: Abstract Cargo consolidation is becoming a crucial part of international transportation and changing the customer consumption patterns of the international community. Poor connections between different operations and the delay of international express have motivated sellers and logistics organizers to put timeliness first in international multimodal transport, especially during the COVID-19 epidemic. However, for cargo with small quality and multiple batches, designing an efficient consolidation network presents a set of unique challenges, including the coupling of multiple origins and destinations (ODs), and fully utilizing the capacity of the container. We defined a multistage timeliness transit consolidation problem to decouple the multiple ODs of the logistics resource. By solving this problem, we can increase the connectivity between different phases and make full use of the container. To make this systematic multistage transit consolidation more flexible, we proposed a two-stage adaptive-weighted genetic algorithm that mainly focuses on the edge area of the Pareto front space and the diversity of the population. Computational experiments indicate that the correlation between parameters has certain regular trends, and appropriate parameter settings can lead to more satisfactory results. We also confirm that the pandemic has a giant influence on the market share of different transportation modes. Moreover, the comparison with other approaches demonstrates the feasibility and effectiveness of the proposed method.

Keywords: Timeliness transit consolidation; Coupling of multiple ODs; Tonnage utilization; Improved genetic algorithm; The COVID-19 (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-023-05417-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:346:y:2025:i:2:d:10.1007_s10479-023-05417-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-023-05417-z

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().