A two-echelon routing problem in forest-industry logistics with a nonlinear cost function: A modified ant colony algorithm on a transport graph with transit vertices
Abstract
This paper studies the problem of planning forest-product transportation from a single shipping point through a network of intermediate transfer hubs to final consumers over a real road network. A key feature of the formulation is that the unit cost per kilometer depends nonlinearly on vehicle load: partially loaded trucks cost the industry more per unit of goods delivered. The aim of the study is to propose a mathematical model of this two-level logistics problem and an algorithm to solve it that is suitable for transportation networks of realistic size. A modified version of the ant colony optimization algorithm – a bio-inspired optimization method – has been developed; it jointly optimizes the routes of both delivery levels. The proposed algorithm is compared with three reference approaches: an exact method based on mixed integer linear programming, its lower bound, and a simple nearest-neighbor greedy heuristic. Experiments were carried out on a training scenario with fifty consumers and on the real road network of the Primorsky Krai region of Russia, containing 203 nodes. The proposed algorithm outperformed the greedy heuristic in 49 out of 50 runs with an average improvement of about 7.7%, and outperformed the exact method in 76 out of 80 cases. On the real road network the improvement over the greedy heuristic was about 7%, and the algorithm results were stable: the spread between runs did not exceed 1%. The practical value of the work is the applicability of the model and algorithm to transportation planning in the forest-industry sector and in other sectors with extensive delivery networks.
Downloads
References
Rogulin R. S. (2026). Two-echelon transport-system model and an ant colony algorithm: scalability analysis of computational solutions. Informatics and Automation, 25(2), 478–516 (in Russian). https://doi.org/10.15622/ia.25.2.8
Injac, Z., & Drašković, D. (2024). Classification of vehicle routing problem. Journal of Traffic and Transport Theory and Practice, 9(1), 36–41. https://doi.org/10.7251/JTTTP2401036I
Usman, H., & Obafemi, O. R. (2024). Enhancing transportation efficiency in Sokoto state metropolis through vehicle routing problem optimization. International Journal of Science for Global Sustainability, 10(3), 160–166. https://doi.org/10.57233/ijsgs.v10i3.716
Alba, E., & Dorronsoro, B. (2006). Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm. Information Processing Letters, 98(6), 225–230. https://doi.org/10.1016/j.ipl.2006.02.006
Cavaliere, F., Accorsi, L., Laganà, D., Musmanno, R., & Vigo, D. (2024). An efficient heuristic for very large-scale vehicle routing problems with simultaneous pickup and delivery. Transportation Research Part E: Logistics and Transportation Review, 186, 103550. https://doi.org/10.1016/j.tre.2024.103550
Shehab, W. A.-A., Muhsan, H. B., Alrikabi, B., Abdul-Razaq, A.-A., Nasser, H. K., & Hameed, A. S. (2024). Comparative analysis of new solutions for the capacitated vehicle routing problem against CVRPLIB benchmark. International Journal of Computational and Experimental Science and Engineering, 10(4), 1450–1457. https://doi.org/10.22399/ijcesen.626
Blum, C. (2024). Ant colony optimization: A bibliometric review. Physics of Life Reviews, 51, 87–95. https://doi.org/10.1016/j.plrev.2024.09.014
Tang, K., Wei, X. F., Jiang, Y. H., Chen, Z. W., & Yang, L. (2023). An adaptive ant colony optimization for solving large-scale traveling salesman problem. Mathematics, 11(21), 4439. https://doi.org/10.3390/math11214439
Chen, G., Gao, J., & Chen, D. (2025). Research on vehicle routing problem with time windows based on improved genetic algorithm and ant colony algorithm. Electronics, 14(4), 647. https://doi.org/10.3390/electronics14040647
Ahmed, Z. H., Hameed, A. S., Mutar, M. L., & Haron, H. (2023). An enhanced ant colony system algorithm based on subpaths for solving the capacitated vehicle routing problem. Symmetry, 15(11), 2020. https://doi.org/10.3390/sym15112020
Bai, X., Liu, D., & Xu, X. (2024). A review of improved methods for ant colony optimization in path planning. Journal of Ship Research, 68(2), 77–92. https://doi.org/10.5957/JOSR.10230029
Starzec, G., Starzec, M., Rutkowski, L., Kisiel-Dorohinicki, M., & Byrski, A. (2024). Ant colony optimization using two-dimensional pheromone for single-objective transport problems. Journal of Computational Science, 79, 102308. https://doi.org/10.1016/j.jocs.2024.102308
Ivković, N., Kudelić, R., & Golub, M. (2023). Adjustable pheromone reinforcement strategies for problems with efficient heuristic information. Algorithms, 16(5), 251. https://doi.org/10.3390/a16050251
de Mello Filho, L. V. F., de Sousa, F. P. L., de Godoi, G., Emiliano, W. M., Canteras, F. B., Molina Júnior, V. E., Bertini Junior, J. R., & Meyer, Y. A. (2025). Application of the ant colony optimization metaheuristic in transport engineering: A case study on vehicle routing and highway service stations. Modelling, 6(3), 62. https://doi.org/10.3390/modelling6030062
Li, T., Deng, S., Lu C., Wang, Y., & Liao, H. (2023). Optimization of green vehicle paths considering the impact of carbon emissions: A case study of municipal solid waste collection and transportation. Sustainability, 15(22), Article 16128. https://doi.org/10.3390/su152216128
Sun, Y., Zhang, C., & Sun, G. (2024). An interval fuzzy programming approach to solve a green intermodal routing problem for timber transportation under uncertain information. Forests, 15(11), 2003. https://doi.org/10.3390/f15112003
Jamaluddin, J., Kamarudin, N., Ismail, M. H., & Ahmad, S. A. (2023). Optimizing timber transportation planning for timber harvesting using bees algorithm in Malaysia. Journal of Environmental Management, 340, 117977. https://doi.org/10.1016/j.jenvman.2023.117977
Nunes, L. J. R. (2025). The role of artificial intelligence (AI) in the future of forestry sector logistics. Future Transportation, 5(2), 63. https://doi.org/10.3390/futuretransp5020063
Palander, T., Tokola, T., Borz, S. A., & Rauch, P. (2024). Forest supply chains during digitalization: Current implementations and prospects in near future. Current Forestry Reports, 10(3), 223–238. https://doi.org/10.1007/s40725-024-00218-4
Helo, P., & Rouzafzoon, J. (2023). An agent-based simulation and logistics optimization model for managing uncertain demand in forest supply chains. Supply Chain Analytics, 4, 100042. https://doi.org/10.1016/j.sca.2023.100042
Bektaş T., Laporte G. The Pollution-Routing Problem. Transportation Research Part B: Methodological, 2011, vol. 45, no. 8, pp. 1232–1250. DOI: 10.1016/j.trb.2011.02.004.
Bektaş, T., & Laporte, G. (2011). The pollution-routing problem. Transportation Research Part B: Methodological, 45(8), 1232–1250. https://doi.org/10.1016/j.trb.2011.02.004
Demir, E., Bektaş, T., & Laporte, G. (2014). A review of recent research on green road freight transportation. European Journal of Operational Research, 237(3), 775–793. https://doi.org/10.1016/j.ejor.2013.12.033
Rogulin, R. S., Pleshanov, D. E., & Nechaev, P. V. (2018). A complex optimization model of production and transportation processes. Discourse, 4(5), 66–73 (in Russian). https://discourse.etu.ru/assets/files/r.-s.-rogulin-p.-v.-nechaev-d.-e.-pleshanov.pdf
Rogulin R. S. (2024). Management of pricing policy of a timber enterprise considering the problems of formation of raw material supply chains and determining production volumes. Business Informatics, 18(4), 98–111. https://doi.org/10.17323/2587-814X.2024.4.98.111
Rogulin R. S. (2023). Mathematical model of the formation of supply chains of raw materials from a commodity exchange under conditions of uncertainty. Business Informatics, 17(4), 41–56. https://doi.org/10.17323/2587-814X.2023.4.41.56
Dorigo, M., & Gambardella, L. M. (1997). Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1), 53–66. https://doi.org/10.1109/4235.585892
Stützle, T., & Hoos, H. H. (2000). MAX–MIN ant system. Future Generation Computer Systems, 16(8), 889–914. https://doi.org/10.1016/S0167-739X(00)00043-1
Copyright (c) 2026 National Research University Higher School of Economics

This work is licensed under a Creative Commons Attribution 4.0 International License.







