IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v244y2022ics0925527321003388.html
   My bibliography  Save this article

A deep reinforcement learning-based approach for the home delivery and installation routing problem

Author

Listed:
  • Qiu, Huaxin
  • Wang, Sutong
  • Yin, Yunqiang
  • Wang, Dujuan
  • Wang, Yanzhang

Abstract

This paper investigates a home delivery and installation routing problem with synchronization constraints stemming from a home industry company in China who provides the last-mile delivery of home decoration and furniture. The company first arranges for products to be delivered from door to door, and later the technicians come to perform the installation service for the customers. The products for each customer must be firstly delivered to the customer by a vehicle and then installed by technicians. The objective is to identify the optimal delivery routes of the vehicles and optimal service routes of the technicians so as to minimize the total travel distance of the delivery and service routes. A deep reinforcement learning method in an Encoder-Decoder fashion with multi-head attention mechanism and beam search strategy is developed to solve the problem. To evaluate the designed method, extensive numerical experiments based on real service networks provided by the company are conducted. The results show that the proposed method can effectively solve the problem, which outperforms some classical strategies, and some meaningful management implications are provided.

Suggested Citation

  • Qiu, Huaxin & Wang, Sutong & Yin, Yunqiang & Wang, Dujuan & Wang, Yanzhang, 2022. "A deep reinforcement learning-based approach for the home delivery and installation routing problem," International Journal of Production Economics, Elsevier, vol. 244(C).
    • Handle: RePEc:eee:proeco:v:244:y:2022:i:c:s0925527321003388
    DOI: 10.1016/j.ijpe.2021.108362
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527321003388
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2021.108362?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.

    References listed on IDEAS

    as
    1. Egeblad, Jens & Garavelli, Claudio & Lisi, Stefano & Pisinger, David, 2010. "Heuristics for container loading of furniture," European Journal of Operational Research, Elsevier, vol. 200(3), pages 881-892, February.
    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. Paraskevopoulos, Dimitris C. & Laporte, Gilbert & Repoussis, Panagiotis P. & Tarantilis, Christos D., 2017. "Resource constrained routing and scheduling: Review and research prospects," European Journal of Operational Research, Elsevier, vol. 263(3), pages 737-754.
    4. Kraus, Mathias & Feuerriegel, Stefan & Oztekin, Asil, 2020. "Deep learning in business analytics and operations research: Models, applications and managerial implications," European Journal of Operational Research, Elsevier, vol. 281(3), pages 628-641.
    5. Michael Drexl, 2012. "Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints," Transportation Science, INFORMS, vol. 46(3), pages 297-316, August.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Jung, Seung Hwan & Yang, Yunsi, 2023. "On the value of operational flexibility in the trailer shipment and assignment problem: Data-driven approaches and reinforcement learning," International Journal of Production Economics, Elsevier, vol. 264(C).
    2. Fadaki, Masih & Asadikia, Atie, 2024. "Augmenting Monte Carlo Tree Search for managing service level agreements," International Journal of Production Economics, Elsevier, vol. 271(C).
    3. Dey, Bikash Koli & Sarkar, Mitali & Chaudhuri, Kripasindhu & Sarkar, Biswajit, 2023. "Do you think that the home delivery is good for retailing?," Journal of Retailing and Consumer Services, Elsevier, vol. 72(C).
    4. Hashemi-Petroodi, S. Ehsan & Thevenin, Simon & Kovalev, Sergey & Dolgui, Alexandre, 2023. "Markov decision process for multi-manned mixed-model assembly lines with walking workers," International Journal of Production Economics, Elsevier, vol. 255(C).
    5. Zheng, Zhijun & Li, Gang & Cheng, T.C.E & Wu, Feng, 2022. "Offline supplementary service strategies for the online marketplace: Third-party service or marketplace service?," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).

    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. Soares, Ricardo & Marques, Alexandra & Amorim, Pedro & Parragh, Sophie N., 2024. "Synchronisation in vehicle routing: Classification schema, modelling framework and literature review," European Journal of Operational Research, Elsevier, vol. 313(3), pages 817-840.
    2. Fazi, Stefano & Choudhary, Sourabh Kumar & Dong, Jing-Xin, 2023. "The multi-trip container drayage problem with synchronization for efficient empty containers re-usage," European Journal of Operational Research, Elsevier, vol. 310(1), pages 343-359.
    3. Dukkanci, Okan & Campbell, James F. & Kara, Bahar Y., 2024. "Facility location decisions for drone delivery: A literature review," European Journal of Operational Research, Elsevier, vol. 316(2), pages 397-418.
    4. Naderi, Bahman & Begen, Mehmet A. & Zaric, Gregory S. & Roshanaei, Vahid, 2023. "A novel and efficient exact technique for integrated staffing, assignment, routing, and scheduling of home care services under uncertainty," Omega, Elsevier, vol. 116(C).
    5. Dumez, Dorian & Tilk, Christian & Irnich, Stefan & Lehuédé, Fabien & Olkis, Katharina & Péton, Olivier, 2023. "A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows," European Journal of Operational Research, Elsevier, vol. 305(1), pages 64-84.
    6. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    7. Alexander Jungwirth & Guy Desaulniers & Markus Frey & Rainer Kolisch, 2022. "Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1157-1175, March.
    8. Stefan Feuerriegel & Mateusz Dolata & Gerhard Schwabe, 2020. "Fair AI," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 62(4), pages 379-384, August.
    9. Gahm, Christian & Uzunoglu, Aykut & Wahl, Stefan & Ganschinietz, Chantal & Tuma, Axel, 2022. "Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning," European Journal of Operational Research, Elsevier, vol. 296(3), pages 819-836.
    10. Niels Agatz & Paul Bouman & Marie Schmidt, 2018. "Optimization Approaches for the Traveling Salesman Problem with Drone," Transportation Science, INFORMS, vol. 52(4), pages 965-981, August.
    11. Patrick Büchel & Michael Kratochwil & Maximilian Nagl & Daniel Rösch, 2022. "Deep calibration of financial models: turning theory into practice," Review of Derivatives Research, Springer, vol. 25(2), pages 109-136, July.
    12. Suyuan Luo & Tsan-Ming Choi, 2024. "Great partners: how deep learning and blockchain help improve business operations together," Annals of Operations Research, Springer, vol. 339(1), pages 53-78, August.
    13. Kaffash, Sepideh & Nguyen, An Truong & Zhu, Joe, 2021. "Big data algorithms and applications in intelligent transportation system: A review and bibliometric analysis," International Journal of Production Economics, Elsevier, vol. 231(C).
    14. Gunnarsson, Björn Rafn & vanden Broucke, Seppe & Baesens, Bart & Óskarsdóttir, María & Lemahieu, Wilfried, 2021. "Deep learning for credit scoring: Do or don’t?," European Journal of Operational Research, Elsevier, vol. 295(1), pages 292-305.
    15. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    16. Timo Gschwind & Stefan Irnich, 2012. "Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing," Working Papers 1211, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    17. repec:iim:iimawp:14638 is not listed on IDEAS
    18. Ren, Xuan & Froger, Aurélien & Jabali, Ola & Liang, Gongqian, 2024. "A competitive heuristic algorithm for vehicle routing problems with drones," European Journal of Operational Research, Elsevier, vol. 318(2), pages 469-485.
    19. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    20. Sheng, Liu & Hongxia, Zhao & Xisong, Dong & Changjian, Cheng, 2016. "A heuristic algorithm for container loading of pallets with infill boxes," European Journal of Operational Research, Elsevier, vol. 252(3), pages 728-736.
    21. Kleprlík Jaroslav & Brázdová Markéta, 2024. "Design of Restrictive Conditions for Simultaneous Loading and Unloading of Goods with Different Temperature Regimes in Vehicle Routing Problem," LOGI – Scientific Journal on Transport and Logistics, Sciendo, vol. 15(1), pages 97-108.

    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:eee:proeco:v:244:y:2022:i:c:s0925527321003388. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.