IDEAS home Printed from https://ideas.repec.org/a/ids/ijlsma/v52y2025i2p263-286.html
   My bibliography  Save this article

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

Author

Listed:
  • Tieu Trong Minh Luan
  • Truong Tran Mai Anh
  • Nguyen Van Hop

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.

Suggested Citation

  • Tieu Trong Minh Luan & Truong Tran Mai Anh & Nguyen Van Hop, 2025. "Loading and multi-trip routing problem using hierarchical ant colony optimisation algorithm," International Journal of Logistics Systems and Management, Inderscience Enterprises Ltd, vol. 52(2), pages 263-286.
    • Handle: RePEc:ids:ijlsma:v:52:y:2025:i:2:p:263-286
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=149653
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijlsma:v:52:y:2025:i:2:p:263-286. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=134 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.