Loading and multi-trip routing problem using hierarchical ant colony optimisation algorithm

Tieu Trong Minh Luan, Truong Tran Mai Anh and Nguyen Van Hop

International Journal of Logistics Systems and Management, 2025, vol. 52, issue 2, 263-286

Abstract: In this paper, we formulate the loading and routing problem as a new mixed-integer programming model with multi-trip routing and loading constraints. The objective is to minimise the total costs of delivery and outbound cross-docking operations and delivery. We also modify an ant colony optimisation algorithm to a so-called four-level ant colony optimisation heuristics (FLACO) to search for the best loading and routing solution in hierarchical levels of trips, trucks, periods, and routes. At each level, the ACO parameters are updated iteratively to process the problem constraints. The case of a large dairy company in Vietnam is used to validate the proposed model and FLACO. The FLACO could give as close as about 2.46% to the optimal solution and outperform the genetic algorithm for small-sized and large-sized problems, respectively.

Keywords: loading; vehicle routing problem; ant colony optimisation; ACO. (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=149653 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijlsma:v:52:y:2025:i:2:p:263-286

Access Statistics for this article

More articles in International Journal of Logistics Systems and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().