基于NSGA-II-RD的电商物流配送中心选址–路径–调度联合优化研究
Research on Joint Optimization of E-Commerce Logistics Distribution Center Location-Route-Dispatch Based on NSGA-II-RD
摘要: 针对电商平台需要规划向消费者配送商品的具体路径和库存调度量的情境,进行了全过程联合优化,提出了低碳视角下电商物流配送中心选址–路径–调度联合策略研究。首先,考虑到配送过程中时间存在不确定性,引用前景理论刻画消费者对预期配送时间的心理期望。同时,考虑到促销期间订单量激增导致库存有限,因此用订单满足率衡量消费者的满意度水平,与前一指标相结合计算配送效率。其次,在计算配送成本时,除了基本的运输成本,还创新性地引入了缺货成本系数这一变量,结合订单满足率,衡量缺货损失成本,从而建立起配送效率最大、配送成本最小的多目标优化模型。最后,使用改进设计的NSGA-II-RD (Non-dominated sorting genetic algorithms for route and dispatch)算法进行求解,将第一部分选址中的部分最终备选点作为本部分的配送中心,使用上海市相关数据进行案例分析,验证了该模型和算法的可行性。
Abstract: In response to the situation where e-commerce platforms need to plan specific delivery routes and inventory dispatch quantities to consumers, a joint optimization of the entire process was carried out, and a low-carbon perspective was proposed to study the joint strategy of e-commerce logistics distribution center location, route, and dispatch. Firstly, considering the uncertainty of delivery time, prospect theory is used to depict consumers’ psychological expectations towards expected delivery time. Meanwhile, considering the limited inventory due to surging orders during promotional periods, the order fulfillment rate is used to measure consumer satisfaction level, and combined with the previous indicator to calculate delivery efficiency. Secondly, when calculating delivery costs, in addition to basic transportation costs, an innovative variable called the stockout cost coefficient was introduced. Combined with the order fulfillment rate, the stockout loss cost was measured to establish a multi-objective optimization model that maximizes delivery efficiency and minimizes delivery costs. Finally, the improved NSGA-II-RD algorithm was used to solve the problem. Some of the final candidate points in the first part of location were selected as distribution centers. Case analysis was conducted using relevant data from Shanghai to verify the feasibility of the model and algorithm.
文章引用:高亚慧, 刘勤明, 彭舒悦. 基于NSGA-II-RD的电商物流配送中心选址–路径–调度联合优化研究[J]. 电子商务评论, 2025, 14(12): 4896-4908. https://doi.org/10.12677/ecl.2025.14124444

参考文献

[1] Ouyang, Z., Leung, E.K.H., Cai, Y. and Huang, G.Q. (2023) Dynamic Community Partitioning for E-Commerce Last Mile Delivery with Time Window Constraints. Computers & Operations Research, 160, Article ID: 106394. [Google Scholar] [CrossRef
[2] Côté, J., Queiroz, T., Gallesi, F. and Iori, M. (2021) Dynamic Optimization Algorithms for Same-Day Delivery Problems.
[3] Cui, S., Sun, Q. and Zhang, Q. (2022) A Time-Dependent Vehicle Routing Problem for Instant Delivery Based on Memetic Algorithm. Computational Intelligence and Neuroscience, 2022, Article ID: 5099008. [Google Scholar] [CrossRef] [PubMed]
[4] Flamini, M., Nigro, M. and Pacciarelli, D. (2017) The Value of Real-Time Traffic Information in Urban Freight Distribution. Journal of Intelligent Transportation Systems, 22, 26-39. [Google Scholar] [CrossRef
[5] Zhao, S., Pu, L. and Li, Q. (2024) The Vehicle Routing Problem Considering Customers’ Multiple Preferences in Last-Mile Delivery. Tehnicki vjesnik-Technical Gazette.
[6] Ulmer, M.W., Thomas, B.W. and Mattfeld, D.C. (2019) Preemptive Depot Returns for Dynamic Same-Day Delivery. EURO Journal on Transportation and Logistics, 8, 327-361. [Google Scholar] [CrossRef
[7] Kasuri Abhilashani, G., Ranathunga, M.I.D. and Wijayanayake, A.N. (2023) Minimising Last-Mile Delivery Cost and Vehicle Usage through an Optimised Delivery Network Considering Customer-Preferred Time Windows. 2023 International Research Conference on Smart Computing and Systems Engineering (SCSE), Kelaniya, 29 June 2023, 1-7. [Google Scholar] [CrossRef
[8] Shao, Q. and Cheng, S. (2023) Preference-Aware Delivery Planning for Last-Mile Logistics.
[9] Wang, S., Tao, F., Shi, Y. and Wen, H. (2017) Optimization of Vehicle Routing Problem with Time Windows for Cold Chain Logistics Based on Carbon Tax. Sustainability, 9, Article No. 694. [Google Scholar] [CrossRef
[10] Cirullies, J., Klingebiel, K. and Scavarda, L. (2012) A Conceptual Framework for Green Supply Chain Design.
[11] Said, M. and Abdullah, R. (2012) Green Supply Chain Management towards Sustainable Performance.
[12] Qin, G., Tao, F. and Li, L. (2019) A Vehicle Routing Optimization Problem for Cold Chain Logistics Considering Customer Satisfaction and Carbon Emissions. International Journal of Environmental Research and Public Health, 16, Article No. 576. [Google Scholar] [CrossRef] [PubMed]
[13] Bräysy, O. and Gendreau, M. (2005) Vehicle Routing Problem with Time Windows, Part II: Metaheuristics. Transportation Science, 39, 119-139. [Google Scholar] [CrossRef
[14] Elshaer, R. and Awad, H. (2020) A Taxonomic Review of Metaheuristic Algorithms for Solving the Vehicle Routing Problem and Its Variants. Computers & Industrial Engineering, 140, Article ID: 106242. [Google Scholar] [CrossRef
[15] Cordeau, J., Gendreau, M., Hertz, A., Laporte, G. and Sormany, J. (2005) New Heuristics for the Vehicle Routing Problem. In: Langevin, A. and Riopel, D., Eds., Logistics Systems: Design and Optimization, Springer-Verlag, 279-297. [Google Scholar] [CrossRef