IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v59y2021i14p4434-4452.html
   My bibliography  Save this article

Robust possibilistic programming for joint order batching and picker routing problem in warehouse management

Author

Listed:
  • Mahdi Yousefi Nejad Attari
  • Ali Ebadi Torkayesh
  • Behnam Malmir
  • Ensiyeh Neyshabouri Jami

Abstract

Decisions made for designing and operating a warehouse system are of great significance. These operational decisions are strongly affected by total logistics costs, including investment and direct operating costs. The number of orders made by customers in the logistics section of warehouse management is very high because the number, type of products and items ordered by different customers vary broadly. However, machines layout for picking up products at logistics centres is minimal, inflexible, and, in some cases, inconclusive. In this study, we address joint order batching procedures of orders considering picker routing problem as a mixed-integer programming model. Extensive numerical experiments were generated in small, medium, and large sizes. In order to consider the uncertainty of parameters, we applied robust possibilistic programming for this problem. Three different meta-heuristic algorithms; genetic algorithm, particle swarm optimisation algorithm, and honey artificial bee colony algorithms are used as solution approaches to solve the formulated model. The performance of solution approaches over the problem was analysed using several test indexes. In all three group examples, there was no significant difference among mean values of the objective function, while there was a remarkable difference among computing times.

Suggested Citation

  • Mahdi Yousefi Nejad Attari & Ali Ebadi Torkayesh & Behnam Malmir & Ensiyeh Neyshabouri Jami, 2021. "Robust possibilistic programming for joint order batching and picker routing problem in warehouse management," International Journal of Production Research, Taylor & Francis Journals, vol. 59(14), pages 4434-4452, July.
    • Handle: RePEc:taf:tprsxx:v:59:y:2021:i:14:p:4434-4452
    DOI: 10.1080/00207543.2020.1766712
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dhirendra Prajapati & M. Manoj Kumar & Saurabh Pratap & H. Chelladurai & Mohd Zuhair, 2021. "Sustainable Logistics Network Design for Delivery Operations with Time Horizons in B2B E-Commerce Platform," Logistics, MDPI, vol. 5(3), pages 1-13, September.
    2. Alireza Goli & Ali Ala & Seyedali Mirjalili, 2023. "A robust possibilistic programming framework for designing an organ transplant supply chain under uncertainty," Annals of Operations Research, Springer, vol. 328(1), pages 493-530, September.
    3. Grzegorz Tarczyński, 2023. "Linear programming models for optimal workload and batching in pick-and-pass warehousing systems," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 33(3), pages 141-158.
    4. Kamilla Hamre Bolstad & Manu Joshi & Lars Magnus Hvattum & Magnus Stålhane, 2022. "Composing Vessel Fleets for Maintenance at Offshore Wind Farms by Solving a Dual-Level Stochastic Programming Problem Using GRASP," Logistics, MDPI, vol. 6(1), pages 1-22, January.

    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:tprsxx:v:59:y:2021:i:14:p:4434-4452. 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/TPRS20 .

    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.