IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v24y2024i4d10.1007_s11067-024-09650-2.html
   My bibliography  Save this article

A Metaheuristic Approach for In-Plant Milk-Run System with Autonomous Vehicles

Author

Listed:
  • Aydin Sipahioglu

    (Eskisehir Osmangazi University)

  • Ilgin Acar

    (Western Michigan University)

  • Islam Altin

    (Eskisehir Osmangazi University)

Abstract

Milk-run is a cyclic material delivery system, that aims to increase the efficiency of transportation and supply chain considering the lean logistics aspect. There are two types of milk-run systems in the literature: supplier and in-plant milk-run. The in-plant milk-run system, which has attracted increasing attention with the Industry 4.0 concept, is applied to manage the delivery process of materials from the warehouse to the assembly stations in plants. This system can be implemented using Autonomous Vehicles (AV), which provide automated material handling. However, a challenging problem appears in determining milk-run routes and periods simultaneously for each AV. Furthermore, this problem becomes more difficult in the presence of assembly stations with buffer stock constraints requiring multi-commodity pickup and delivery demands. In this study, the Simulated Annealing algorithm was used due to the Np-Hard nature of the problem. Hence, we generated test instances to show the performance of the proposed algorithm. It is seen that the proposed algorithm is efficient in terms of computational times as well as determining both milk-run routes and periods.

Suggested Citation

  • Aydin Sipahioglu & Ilgin Acar & Islam Altin, 2024. "A Metaheuristic Approach for In-Plant Milk-Run System with Autonomous Vehicles," Networks and Spatial Economics, Springer, vol. 24(4), pages 1021-1041, December.
    • Handle: RePEc:kap:netspa:v:24:y:2024:i:4:d:10.1007_s11067-024-09650-2
    DOI: 10.1007/s11067-024-09650-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11067-024-09650-2
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-024-09650-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:kap:netspa:v:24:y:2024:i:4:d:10.1007_s11067-024-09650-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.