IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v15y2023i6p4800-d1091202.html
   My bibliography  Save this article

Semi-Open Multi-Distribution Center Path Planning with Time Windows

Author

Listed:
  • Qin Song

    (School of Engineering, Cardiff University, Cardiff CF24 3AA, UK
    School of Engineering, Shijiazhuang Tiedao University, Shijiazhuang 050043, China)

Abstract

A well-planned robot dispatching platform reduces costs and increases efficiency for companies while also reducing carbon emissions and achieving sustainable development. At the moment, the solution to the difficulty of warehouse logistics is use of multiple distribution centers with autonomous mobile robots (AMR). To solve this problem, this paper establishes a semi-closed model of multiple distribution centers, considering the number of cycles and the number of vehicles. An improved ant colony algorithm is proposed to improve the heuristic function based on the node distance relationship to improve the quality of path search. Dynamic variable pheromone concentration and volatility factors are set to accelerate the convergence speed of the algorithm while effectively reducing the problem of the premature algorithm. The traditional ant colony algorithm and the improved ant colony algorithm are used to solve the established model. In addition, the results show that the traditional ant colony algorithm has a certain rate of dominance in the single-day cost of the closed distribution model, but the overall comprehensive cost is lower than that of the improved ant colony algorithm. The single-day cost of the semi-open multi-distribution center logistics and distribution model is lower than that of the closed multi-distribution center logistics and distribution model, and the 7 day average cost is reduced by 12%. The improved ant colony algorithm can save about 119 kWh of electricity under the same target volume requirement, which achieves the company’s goals of cost reduction and increased efficiency, as well as green and sustainable development.

Suggested Citation

  • Qin Song, 2023. "Semi-Open Multi-Distribution Center Path Planning with Time Windows," Sustainability, MDPI, vol. 15(6), pages 1-14, March.
    • Handle: RePEc:gam:jsusta:v:15:y:2023:i:6:p:4800-:d:1091202
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/15/6/4800/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/15/6/4800/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    2. Yuntao Zhao & Weigang Li & Xiao Wang & Chengxin Yi, 2019. "Path Planning of Slab Library Crane Based on Improved Ant Colony Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-16, August.
    3. Jia Feng & Guowei Li & Yuxin Shi & Zhengzhong Li & Shanshan Liu, 2022. "Urban Rail Transit Rolling Stock Scheduling Optimization with Shared Depot," Sustainability, MDPI, vol. 14(22), pages 1-16, November.
    4. Pureza, Vitória & Morabito, Reinaldo & Reimann, Marc, 2012. "Vehicle routing with multiple deliverymen: Modeling and heuristic approaches for the VRPTW," European Journal of Operational Research, Elsevier, vol. 218(3), pages 636-647.
    5. Aziez, Imadeddine & Côté, Jean-François & Coelho, Leandro C., 2020. "Exact algorithms for the multi-pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 284(3), pages 906-919.
    6. Naccache, Salma & Côté, Jean-François & Coelho, Leandro C., 2018. "The multi-pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 269(1), pages 353-362.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Majsa Ammouriova & Massimo Bertolini & Juliana Castaneda & Angel A. Juan & Mattia Neroni, 2022. "A Heuristic-Based Simulation for an Education Process to Learn about Optimization Applications in Logistics and Transportation," Mathematics, MDPI, vol. 10(5), pages 1-18, March.
    2. Ali, Ousmane & Côté, Jean-François & Coelho, Leandro C., 2021. "Models and algorithms for the delivery and installation routing problem," European Journal of Operational Research, Elsevier, vol. 291(1), pages 162-177.
    3. Côté, Jean-François & Alves de Queiroz, Thiago & Gallesi, Francesco & Iori, Manuel, 2023. "A branch-and-regret algorithm for the same-day delivery problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    4. Brandstätter, Christian & Reimann, Marc, 2018. "The Line-haul Feeder Vehicle Routing Problem: Mathematical model formulation and heuristic approaches," European Journal of Operational Research, Elsevier, vol. 270(1), pages 157-170.
    5. Kohar, Amit & Jakhar, Suresh Kumar & Agarwal, Yogesh K., 2023. "Strong cutting planes for the capacitated multi-pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 176(C).
    6. Zhen, Lu & Baldacci, Roberto & Tan, Zheyi & Wang, Shuaian & Lyu, Junyan, 2022. "Scheduling heterogeneous delivery tasks on a mixed logistics platform," European Journal of Operational Research, Elsevier, vol. 298(2), pages 680-698.
    7. Jumbo, Olga & Moghaddass, Ramin, 2022. "Resource optimization and image processing for vegetation management programs in power distribution networks," Applied Energy, Elsevier, vol. 319(C).
    8. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    9. Babagolzadeh, Mahla & Zhang, Yahua & Abbasi, Babak & Shrestha, Anup & Zhang, Anming, 2022. "Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem," Transport Policy, Elsevier, vol. 128(C), pages 38-51.
    10. Ido Orenstein & Tal Raviv & Elad Sadan, 2019. "Flexible parcel delivery to automated parcel lockers: models, solution methods and analysis," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 683-711, December.
    11. Tianlu Zhao & Yongjian Yang & En Wang, 2020. "Minimizing the average arriving distance in carpooling," International Journal of Distributed Sensor Networks, , vol. 16(1), pages 15501477198, January.
    12. Dessouky, Maged M & Shao, Yihuan E, 2017. "Routing Strategies for Efficient Deployment of Alternative Fuel Vehicles for Freight Delivery," Institute of Transportation Studies, Working Paper Series qt0nj024qn, Institute of Transportation Studies, UC Davis.
    13. A. Mor & M. G. Speranza, 2020. "Vehicle routing problems over time: a survey," 4OR, Springer, vol. 18(2), pages 129-149, June.
    14. Dessouky, Maged M & Hu, Shichun, 2021. "Dynamic Routing for Ride-Sharing," Institute of Transportation Studies, Working Paper Series qt6qq8r7hz, Institute of Transportation Studies, UC Davis.
    15. Chou, Chang-Chi & Chiang, Wen-Chu & Chen, Albert Y., 2022. "Emergency medical response in mass casualty incidents considering the traffic congestions in proximity on-site and hospital delays," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    16. Coelho, V.N. & Grasas, A. & Ramalhinho, H. & Coelho, I.M. & Souza, M.J.F. & Cruz, R.C., 2016. "An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints," European Journal of Operational Research, Elsevier, vol. 250(2), pages 367-376.
    17. Pradhananga, Rojee & Taniguchi, Eiichi & Yamada, Tadashi & Qureshi, Ali Gul, 2014. "Bi-objective decision support system for routing and scheduling of hazardous materials," Socio-Economic Planning Sciences, Elsevier, vol. 48(2), pages 135-148.
    18. Y H Lee & J I Kim & K H Kang & K H Kim, 2008. "A heuristic for vehicle fleet mix problem using tabu search and set partitioning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(6), pages 833-841, June.
    19. Qi, Mingyao & Lin, Wei-Hua & Li, Nan & Miao, Lixin, 2012. "A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 248-257.
    20. Srinivas, Sharan & Ramachandiran, Surya & Rajendran, Suchithra, 2022. "Autonomous robot-driven deliveries: A review of recent developments and future directions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).

    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:gam:jsusta:v:15:y:2023:i:6:p:4800-:d:1091202. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.