IDEAS home Printed from https://ideas.repec.org/a/ids/ijnvor/v32y2025i1-2-3-4p238-253.html
   My bibliography  Save this article

Multi-level logistics supply chain transportation scheduling method based on improved fruit fly algorithm

Author

Listed:
  • Ping Guo

Abstract

This paper proposes a logistics multi-level supply chain transportation scheduling method based on an improved fruit fly algorithm to address the problems of high transportation costs and low transportation efficiency in logistics multi-level supply chain transportation scheduling methods. Firstly, clarify the research scope and objectives by setting objective functions and constraints. Secondly, information exchange, mutation strategy, and probabilistic flight strategy were introduced to improve the fruit fly algorithm. Finally, based on the set algorithm parameters, use the improved Drosophila algorithm to evaluate the fitness of various logistics transportation plans and output the optimal results. After experimental verification, the total transportation time of the logistics transportation plan designed in this paper is 854 min, with 8 dispatched vehicles and a corresponding fuel cost of 2140.31 yuan. This method can effectively reduce transportation costs, improve logistics transportation efficiency, and has certain practical application value.

Suggested Citation

  • Ping Guo, 2025. "Multi-level logistics supply chain transportation scheduling method based on improved fruit fly algorithm," International Journal of Networking and Virtual Organisations, Inderscience Enterprises Ltd, vol. 32(1/2/3/4), pages 238-253.
    • Handle: RePEc:ids:ijnvor:v:32:y:2025:i:1/2/3/4:p:238-253
    as

    Download full text from publisher

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

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ijnvor:v:32:y:2025:i:1/2/3/4:p:238-253. 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=22 .

    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.