IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v72y2021i8p1780-1793.html
   My bibliography  Save this article

Dispatch and conflict-free routing of capacitated vehicles with storage stack allocation

Author

Listed:
  • Emmanouil Thanos
  • Tony Wauters
  • Greet Vanden Berghe

Abstract

Congested traffic networks impose great difficulties upon scheduling material transportation in industrial settings. Dispatching decisions become complex when, in addition to conflict-free routes, storage location must also be considered. The present paper integrates the dispatch and conflict-free routing of capacitated vehicles with the storage allocation problem and proposes a heuristic approach for minimising the total completion time of box pickup, delivery and relocation requests in a warehouse environment. The developed formulation models a warehouse setting in which boxes are stored in stacks and considers different forward and reverse speeds for the vehicles, real-world movement restrictions and a LIFO loading policy. The proposed approach is evaluated using two different metaheuristics and the results are compared against existing schedules prepared by an industry partner. Experimental results demonstrate the effectiveness of the proposed method for large-scale instances and highlight how improved storage allocation decisions can reduce service times.

Suggested Citation

  • Emmanouil Thanos & Tony Wauters & Greet Vanden Berghe, 2021. "Dispatch and conflict-free routing of capacitated vehicles with storage stack allocation," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(8), pages 1780-1793, August.
    • Handle: RePEc:taf:tjorxx:v:72:y:2021:i:8:p:1780-1793
    DOI: 10.1080/01605682.2019.1595191
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2019.1595191
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2019.1595191?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.

    More about this item

    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:taf:tjorxx:v:72:y:2021:i:8:p:1780-1793. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.