Your new experience awaits. Try the new design now and help us make it even better

ORIGINAL RESEARCH article

Front. Future Transp.

Sec. Freight Transport and Logistics

Volume 6 - 2025 | doi: 10.3389/ffutr.2025.1671246

This article is part of the Research TopicDigital Transformation and Organisational Readiness in Freight Transportation: Enhancing Resilience and Sustainability in Global LogisticsView all articles

Simulation Study on Optimization of Delivery Path for Community Group Buying

Provisionally accepted
Minyan  YuMinyan Yu1Laigen  LuoLaigen Luo1Xuejun  ChengXuejun Cheng2*
  • 1Jiangxi Modern Polytechnic College, Nanchang, China
  • 2Coventry University, Coventry, United Kingdom

The final, formatted version of the article will be published soon.

This paper addresses the optimization of community group-buying distribution paths by considering both cost efficiency and time constraints. Focusing on dense neighbourhoods where such services thrive, the study highlights how current distribution strategies often prioritize proximity over effectiveness. To minimize total costs—including vehicle fixed costs, fuel expenses, and time-constrained penalties—a mathematical model is developed and solved using an improved genetic algorithm. The model incorporates real-world constraints from community group-buying platforms. Simulation in AnyLogic, using actual order data from the Flowers and Fruits platform, demonstrates that the proposed approach reduces distribution costs by 31.62%, achieving the lowest-cost distribution path while meeting time window requirements. The results validate the model's effectiveness in balancing economic and operational efficiency.

Keywords: community group buying, Distribution Routes, Genetic Algorithm, Anylogic simulation, Cost optimization

Received: 22 Jul 2025; Accepted: 25 Sep 2025.

Copyright: © 2025 Yu, Luo and Cheng. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.

* Correspondence: Xuejun Cheng, jackcheng030910@outlook.com

Disclaimer: All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article or claim that may be made by its manufacturer is not guaranteed or endorsed by the publisher.