IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v330y2026i1p100-119.html

Optimizing delivery systems within the e-retail context: a weighted self-organizing map for delivery region partitioning

Author

Listed:
  • Leung, Eric Ka Ho
  • Das, Sourav
  • Bektaş, Tolga
  • Choi, Tsan-Ming

Abstract

Today, e-tailing operations are well-established. However, managing dispersed same-day, next-day, or immediate deliveries remains a significant challenge. This necessitates refined vehicle routing and scheduling, which depends on efficient partitioning of the delivery regions. To tackle this, this paper develops a novel Weighted Self-Organizing Map Delivery Region Partitioning (WSOM-DRP) model that jointly generates delivery clusters and suggests optimal collection points for e-orders within each cluster. Using real data from a third-party logistics provider, our model is evaluated against alternative clustering methods (k-means, Ward hierarchical clustering, fuzzy c-means) using common clustering performance measures, travel distance and computation time. A comprehensive sensitivity analysis across varying cluster numbers confirms the model’s robustness, showing travel distance reduction of up to 36 % compared to the second-best method, particularly in high-density and high-traffic scenarios. Additionally, it yields significant improvements in clustering quality (e.g., a minimum of 15 % improvement in the silhouette index across scenarios) and an 18 % reduction in computation time compared to the next fastest benchmark. These findings highlight the practical value and adaptability of WSOM-DRP for optimizing delivery operations under diverse operational conditions and across different cluster granularities. The model also offers guidance on how to balance efficiency gains with operational complexity when selecting the number of clusters. By generating efficient delivery partitions and recommending optimal e-order collection locations during online checkout, our proposed WSOM-DRP model offers an e-commerce solution which is delivery efficient and cost-effective.

Suggested Citation

  • Leung, Eric Ka Ho & Das, Sourav & Bektaş, Tolga & Choi, Tsan-Ming, 2026. "Optimizing delivery systems within the e-retail context: a weighted self-organizing map for delivery region partitioning," European Journal of Operational Research, Elsevier, vol. 330(1), pages 100-119.
  • Handle: RePEc:eee:ejores:v:330:y:2026:i:1:p:100-119
    DOI: 10.1016/j.ejor.2025.09.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725007234
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2025.09.006?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Hendri Sutrisno & Chao-Lung Yang, 2023. "A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method," Annals of Operations Research, Springer, vol. 323(1), pages 203-228, April.
    2. Tsai, Pei-Hsuan & Tang, Jia-Wei, 2023. "Consumers' switching intention towards E-commerce platforms’ store-to-store pickup services: The application of the extended PPM model," Journal of Retailing and Consumer Services, Elsevier, vol. 75(C).
    3. Oliveira, Beatriz Brito & Carravilla, Maria Antónia & Oliveira, José Fernando & Toledo, Franklina M.B., 2014. "A relax-and-fix-based algorithm for the vehicle-reservation assignment problem in a car rental company," European Journal of Operational Research, Elsevier, vol. 237(2), pages 729-737.
    4. Yadav, Deepanshu & Nagar, Deepak & Ramu, Palaniappan & Deb, Kalyanmoy, 2023. "Visualization-aided multi-criteria decision-making using interpretable self-organizing maps," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1183-1200.
    5. Ouyang, Zhiyuan & Leung, Eric Ka Ho & Huang, George Q., 2022. "Community logistics for dynamic vehicle dispatching: The effects of community departure “time” and “space”," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    6. Raj, G. & Roy, D. & de Koster, R. & Bansal, V., 2024. "Stochastic modeling of integrated order fulfillment processes with delivery time promise: Order picking, batching, and last-mile delivery," European Journal of Operational Research, Elsevier, vol. 316(3), pages 1114-1128.
    7. 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.
    8. Bai, Chunguang & Dhavale, Dileep & Sarkis, Joseph, 2016. "Complex investment decisions using rough set and fuzzy c-means: An example of investment in green supply chains," European Journal of Operational Research, Elsevier, vol. 248(2), pages 507-521.
    9. Dieter, Peter & Caron, Matthew & Schryen, Guido, 2023. "Integrating driver behavior into last-mile delivery routing: Combining machine learning and optimization in a hybrid decision support framework," European Journal of Operational Research, Elsevier, vol. 311(1), pages 283-300.
    10. Silva, Marco & Pedroso, João Pedro & Viana, Ana, 2023. "Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints," European Journal of Operational Research, Elsevier, vol. 307(1), pages 249-265.
    11. Bengio, Yoshua & Lodi, Andrea & Prouvost, Antoine, 2021. "Machine learning for combinatorial optimization: A methodological tour d’horizon," European Journal of Operational Research, Elsevier, vol. 290(2), pages 405-421.
    12. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    13. Hintsch, Timo & Irnich, Stefan, 2018. "Large multiple neighborhood search for the clustered vehicle-routing problem," European Journal of Operational Research, Elsevier, vol. 270(1), pages 118-131.
    14. Ruibin Bai & Xinan Chen & Zhi-Long Chen & Tianxiang Cui & Shuhui Gong & Wentao He & Xiaoping Jiang & Huan Jin & Jiahuan Jin & Graham Kendall & Jiawei Li & Zheng Lu & Jianfeng Ren & Paul Weng & Ning Xu, 2023. "Analytics and machine learning in vehicle routing research," International Journal of Production Research, Taylor & Francis Journals, vol. 61(1), pages 4-30, January.
    15. Sheu, Jiuh-Biing, 2008. "A hybrid neuro-fuzzy analytical approach to mode choice of global logistics management," European Journal of Operational Research, Elsevier, vol. 189(3), pages 971-986, September.
    16. Eric K.H. Leung & Zhiyuan Ouyang & George Q. Huang, 2023. "Community logistics: a dynamic strategy for facilitating immediate parcel delivery to smart lockers," International Journal of Production Research, Taylor & Francis Journals, vol. 61(9), pages 2936-2961, May.
    17. Ouyang, Zhiyuan & Leung, Eric K.H. & Huang, George Q., 2023. "Community logistics and dynamic community partitioning: A new approach for solving e-commerce last mile delivery," European Journal of Operational Research, Elsevier, vol. 307(1), pages 140-156.
    18. Sajeesh, S. & Singh, Ashutosh & Bhardwaj, Pradeep, 2022. "Optimal checkout strategies for online retailers," Journal of Retailing, Elsevier, vol. 98(3), pages 378-394.
    19. Serap Ercan Comert & Harun Resit Yazgan & Sena Kır & Furkan Yener, 2018. "A cluster first-route second approach for a capacitated vehicle routing problem: a case study," International Journal of Procurement Management, Inderscience Enterprises Ltd, vol. 11(4), pages 399-419.
    20. Giménez-Palacios, Iván & Parreño, Francisco & Álvarez-Valdés, Ramón & Paquay, Célia & Oliveira, Beatriz Brito & Carravilla, Maria Antónia & Oliveira, José Fernando, 2022. "First-mile logistics parcel pickup: Vehicle routing with packing constraints under disruption," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    21. Dhirendra Prajapati & Arjun R Harish & Yash Daultani & Harpreet Singh & Saurabh Pratap, 2023. "A Clustering Based Routing Heuristic for Last-Mile Logistics in Fresh Food E-Commerce," Global Business Review, International Management Institute, vol. 24(1), pages 7-20, February.
    22. Nooshin Salari & Sheng Liu & Zuo-Jun Max Shen, 2022. "Real-Time Delivery Time Forecasting and Promising in Online Retailing: When Will Your Package Arrive?," Manufacturing & Service Operations Management, INFORMS, vol. 24(3), pages 1421-1436, May.
    23. Maria Battarra & Güneş Erdoğan & Daniele Vigo, 2014. "Exact Algorithms for the Clustered Vehicle Routing Problem," Operations Research, INFORMS, vol. 62(1), pages 58-71, February.
    24. Hintsch, Timo & Irnich, Stefan, 2020. "Exact solution of the soft-clustered vehicle-routing problem," European Journal of Operational Research, Elsevier, vol. 280(1), pages 164-178.
    25. Li Jiang & Mohamed Dhiaf & Junfeng Dong & Changyong Liang & Shuping Zhao, 2020. "A traveling salesman problem with time windows for the last mile delivery in online shopping," International Journal of Production Research, Taylor & Francis Journals, vol. 58(16), pages 5077-5088, July.
    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. Ouyang, Zhiyuan & Leung, Eric K.H. & Huang, George Q., 2023. "Community logistics and dynamic community partitioning: A new approach for solving e-commerce last mile delivery," European Journal of Operational Research, Elsevier, vol. 307(1), pages 140-156.
    2. Zhou, Fangting & Lischka, Attila & Kulcsár, Balázs & Wu, Jiaming & Haghir Chehreghani, Morteza & Laporte, Gilbert, 2025. "Learning for routing: A guided review of recent developments and future directions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 202(C).
    3. Emde, Simon & Tudoran, Ana Alina, 2025. "The first mile is the hardest: A deep learning-assisted matheuristic for container assignment in first-mile logistics," European Journal of Operational Research, Elsevier, vol. 324(1), pages 335-350.
    4. Zhou, Yangming & Liu, Lingheng & Benlic, Una & Li, Zhi-Chun & Wu, Qinghua, 2025. "Solving soft and hard-clustered vehicle routing problems: A bi-population collaborative memetic search approach," European Journal of Operational Research, Elsevier, vol. 324(3), pages 825-838.
    5. Leung, Eric Ka Ho, 2025. "Total fulfillment management: principles, practices and use cases," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 194(C).
    6. Senna, Fernando & Coelho, Leandro C. & Morabito, Reinaldo & Munari, Pedro, 2026. "The two-echelon location-routing problem: A comparative analysis of novel and existing compact formulations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 205(C).
    7. Zhou, Yangming & Qu, Chenhui & Wu, Qinghua & Kou, Yawen & Jiang, Zhibin & Zhou, MengChu, 2024. "A bilevel hybrid iterated search approach to soft-clustered capacitated arc routing problems," Transportation Research Part B: Methodological, Elsevier, vol. 184(C).
    8. Katrin Heßler & Stefan Irnich, 2020. "A Branch-and-Cut Algorithm for the Soft-Clustered Vehicle-Routing Problem," Working Papers 2001, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    9. Yangming Zhou & Yawen Kou & MengChu Zhou, 2023. "Bilevel Memetic Search Approach to the Soft-Clustered Vehicle Routing Problem," Transportation Science, INFORMS, vol. 57(3), pages 701-716, May.
    10. Timo Hintsch, 2019. "Large Multiple Neighborhood Search for the Soft-Clustered Vehicle-Routing Problem," Working Papers 1904, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    11. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.
    12. Kerscher, Christoph & Minner, Stefan, 2025. "Decompose-route-improve framework for solving large-scale vehicle routing problems with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 204(C).
    13. Archetti, C. & Coelho, L.C. & Speranza, M.G. & Vansteenwegen, P., 2026. "Beyond fifty years of vehicle routing: Insights into the history and the future," European Journal of Operational Research, Elsevier, vol. 330(2), pages 355-372.
    14. Ouyang, Zhiyuan & Leung, Eric K.H. & Shen, Chuanfu & Huang, George Q., 2024. "Synchronizing order picking and delivery in e-commerce warehouses under community logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 188(C).
    15. Said Dabia & Stefan Ropke & Tom van Woensel, 2019. "Cover Inequalities for a Vehicle Routing Problem with Time Windows and Shifts," Transportation Science, INFORMS, vol. 53(5), pages 1354-1371, September.
    16. Rui Xu & Yumiao Huang & Wei Xiao, 2023. "A Two-Level Variable Neighborhood Descent for a Split Delivery Clustered Vehicle Routing Problem with Soft Cluster Conflicts and Customer-Related Costs," Sustainability, MDPI, vol. 15(9), pages 1-22, May.
    17. Timo Hintsch & Stefan Irnich, 2018. "Exact Solution of the Soft-Clustered Vehicle Routing Problem," Working Papers 1813, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    18. Yu, Yue & Wang, Jianzhou & Jiang, He & Lu, Haiyan, 2025. "How to manage a multifactor-driven crude oil market more effectively? A revisit based on the multiple criteria perspective," Resources Policy, Elsevier, vol. 100(C).
    19. Timo Hintsch & Stefan Irnich & Lone Kiilerich, 2021. "Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem," Transportation Science, INFORMS, vol. 55(3), pages 687-705, May.
    20. Lin, Yun Hui & Yin, Xiao Feng & Tian, Qingyun, 2024. "Unlocking efficiency: End-to-end optimization learning for recurrent facility operational planning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 189(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    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:eee:ejores:v:330:y:2026:i:1:p:100-119. 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/eor .

    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.