Two-Echelon Transport System Model and Ant Colony Optimization Algorithm: Scalability Analysis of Computational Solutions
Informatics and Automation · 06.04.2026 · 25 (2) · 478-516
DOI: 10.15622/ia.25.2.8 ↗Kurz gefasst
Fachartikel in der Zeitschrift Informatics and Automation, online erschienen am 06.04.2026. Verfasst von Rodion Rogulin. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 48 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
The paper presents a two-echelon transportation system model designed for the analysis of distribution logistics with intermediate hubs and end consumers. The model captures the joint optimization of trunk-level routing and distribution routing under vehicle capacity constraints and demand satisfaction requirements. The resulting optimization problem belongs to the class of NP-hard problems, which significantly limits the applicability of exact optimization methods as the size of the transportation network increases. To solve the proposed model, a two-echelon Ant Colony Optimization algorithm (2E-ACO) is employed. In the algorithm, the solution construction processes for the first and second echelons are formulated separately, but are coordinated through a unified objective function that incorporates transportation costs and penalties for unmet demand. The focus of the study is a computational experiment aimed at analyzing the scalability and robustness of the algorithm under increasing problem size. Several scaling scenarios are considered, including variations in the cardinality of the consumer set, the number of hubs, and the complexity of the transportation infrastructure. Experiments are conducted under a scalable resource regime, which allows the impact of algorithmic behavior to be isolated from resource-related effects. Reproducibility is assessed using multiple independent runs with fixed random seeds. The experimental results demonstrate a predictable growth of computational effort as the model size increases, while maintaining stable solution quality across runs. A comparison with a baseline greedy heuristic shows that 2E-ACO achieves comparable demand satisfaction levels at the cost of higher computational time, which is inherent to its iterative search mechanism. The results confirm the suitability of the proposed model and algorithm for the analysis of large-scale two-echelon transportation systems.
Zitieren
APA
Rogulin, R. (2026). Two-Echelon Transport System Model and Ant Colony Optimization Algorithm: Scalability Analysis of Computational Solutions. Informatics and Automation, 25(2), 478-516. https://doi.org/10.15622/ia.25.2.8
Vancouver
Rogulin R. Two-Echelon Transport System Model and Ant Colony Optimization Algorithm: Scalability Analysis of Computational Solutions. Informatics and Automation. 2026;25(2):478-516. doi:10.15622/ia.25.2.8
BibTeX
@article{Rogulin2026,
author = {Rogulin, Rodion},
title = {Two-Echelon Transport System Model and Ant Colony Optimization Algorithm: Scalability Analysis of Computational Solutions},
journal = {Informatics and Automation},
year = {2026},
volume = {25},
number = {2},
pages = {478--516},
doi = {10.15622/ia.25.2.8}
}
EUVIMED