|
|
|
| Site selection of pick-up points and distribution route planning of cigarette based on EKM-PSA algorithm |
Yiping SHAO1( ),Miao WANG1,Xin JI1,Liming ZHU2,*( ),Jiansha LU1,Peijun XU3 |
1. College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou 310023, China 2. China Tobacco Zhejiang Industrial Co. Ltd, Hangzhou 310024, China 3. School of Business Administration, Zhejiang Gongshang University, Hangzhou 310012, China |
|
|
|
Abstract An EKM-PSA-based method for cigarette pick-up point site selection and distribution route planning was proposed, in order to address the problems of high costs, high path repetition rates, low efficiency and poor timeliness of retailer services in the traditional distribution mode for sparsely populated areas. For the problem of cigarette pick-up point site selection, an improved K-means clustering algorithm integrated with economic benefit indicators was proposed, a subsidy mechanism for pick-up retailers was constructed, and a site selection model for pick-up points was established. For the problem of cigarette distribution route planning, a multi-objective cigarette distribution route planning model with time window constraints was built, where the objective function included retailer service priority cost, vehicle fixed cost, vehicle transportation cost, pick-up point subsidy cost, as well as pick-up point construction and operation costs, and a priority simulated annealing algorithm was proposed for solving the model. Taking the cigarette distribution of Z city as an example, a case study and algorithm comparisons were conducted. The results indicated that the total cost was reduced by 20%, and the transportation distance was reduced by 19% compared with the original scheme, thereby verifying the effectiveness of the proposed model and the superiority of the proposed algorithm.
|
|
Received: 19 February 2025
Published: 19 March 2026
|
|
|
| Fund: 国家自然科学基金资助项目(52405565);浙江省尖兵领雁科技计划资助项目(2024C01208). |
|
Corresponding Authors:
Liming ZHU
E-mail: syp123gh@zjut.edu.cn;zlm@zjtobacco.com
|
基于EKM-PSA算法的卷烟自提点选址和配送路径规划
针对传统配送模式在地广人稀区域存在成本高昂、路径重复率高、低效率及零售户服务时效性差等问题,提出基于EKM-PSA算法的卷烟自提点选址和配送路径规划方法. 对于卷烟自提点选址问题,提出融合经济效益指标的改进 K 均值聚类算法,构建自提零售户补贴机制,建立自提点选址模型. 对于卷烟配送路径规划问题,建立包含时间窗约束的多目标卷烟配送路径规划模型,目标函数包括零售户服务优先级成本、车辆固定成本、车辆运输成本、自提点补贴成本、自提点建设及运营成本,提出优先级模拟退火算法进行求解. 以 Z 地市区域烟草配送为例,进行实例研究和算法对比,结果表明总成本较原方案减少20%,运输距离较原方案减少19%,验证了所提模型的有效性及算法的优越性.
关键词:
自提点选址,
K-means聚类,
卷烟配送路径规划,
零售户优先级,
多目标优化
|
|
| [1] |
ARCHETTI C, SPERANZA M G Vehicle routing problems with split deliveries[J]. International Transactions in Operational Research, 2012, 19 (1/2): 3- 22
|
|
|
| [2] |
范文兵, 冯文 混合遗传算法的带时间窗卷烟物流车辆路径优化[J]. 现代电子技术, 2018, 41 (11): 119- 123,128 FAN Wenbing, FENG Wen Hybrid genetic algorithm based cigarette logistics vehicle routing optimization with time window[J]. Modern Electronics Technique, 2018, 41 (11): 119- 123,128
doi: 10.16652/j.issn.1004-373x.2018.11.027
|
|
|
| [3] |
方文婷, 艾时钟, 王晴, 等 基于混合蚁群算法的冷链物流配送路径优化研究[J]. 中国管理科学, 2019, 27 (11): 107- 115 FANG Wenting, AI Shizhong, WANG Qing, et al Research on cold chain logistics distribution path optimization based on hybrid ant colony algorithm[J]. Chinese Journal of Management Science, 2019, 27 (11): 107- 115
doi: 10.16381/j.cnki.issn1003-207x.2019.11.011
|
|
|
| [4] |
TAN K C, CHEW Y H, LEE L H A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows[J]. Computational Optimization and Applications, 2006, 34 (1): 115- 151
doi: 10.1007/s10589-005-3070-3
|
|
|
| [5] |
方昕 一种新型启发式PSO算法求解市区最优路径规划研究[J]. 计算机与数字工程, 2018, 46 (2): 270- 275 FANG Xin Plan research on a new heuristic PSO to solving urban optimal path[J]. Computer and Digital Engineering, 2018, 46 (2): 270- 275
doi: 10.3969/j.issn.1672-9722.2018.02.013
|
|
|
| [6] |
张思宇. 基于送提一体的生鲜自提点选址问题研究 [D]. 北京: 北京交通大学, 2020. ZHANG Siyu. Research on the location-selection problem of pick-up points for fresh good based on the integration of self-delivery and home delivery [D]. Beijing: Beijing Jiaotong University, 2020.
|
|
|
| [7] |
李谊, 李勇杰, 宋振霄 卷烟配送中心选址优化研究与应用[J]. 中国烟草学报, 2023, 29 (2): 98- 104 LI Yi, LI Yongjie, SONG Zhenxiao Research and application of tobacco distribution center location optimization[J]. Acta Tabacaria Sinica, 2023, 29 (2): 98- 104
doi: 10.16472/j.chinatobacco.2021.t0073
|
|
|
| [8] |
ZHU E, MA R An effective partitional clustering algorithm based on new clustering validity index[J]. Applied Soft Computing, 2018, 71: 608- 621
doi: 10.1016/j.asoc.2018.07.026
|
|
|
| [9] |
LIN J L, KUO J C, CHUANG H W Improving density peak clustering by automatic peak selection and single linkage clustering[J]. Symmetry, 2020, 12 (7): 1168
doi: 10.3390/sym12071168
|
|
|
| [10] |
LI Y, YE C, WANG H, et al A discrete multi-objective grey wolf optimizer for the home health care routing and scheduling problem with priorities and uncertainty[J]. Computers and Industrial Engineering, 2022, 169: 108256
doi: 10.1016/j.cie.2022.108256
|
|
|
| [11] |
张平莉. 考虑顾客优先级的B2C个性化物流动态路径规划研究 [D]. 上海: 东华大学, 2018. ZHANG Pingli. Research on dynamic routing planning of B2C personalized logistics considering customer priorities [D]. Shanghai: Donghua university, 2018.
|
|
|
| [12] |
陈刚, 付江月, 何美玲 考虑居民选择行为的应急避难场所选址问题研究[J]. 运筹与管理, 2019, 28 (9): 6- 14 CHEN Gang, FU Jiangyue, HE Meiling Emergency shelter location problem considering residents’ choice behavior[J]. Operations Research and Management Science, 2019, 28 (9): 6- 14
doi: 10.12005/orms.2019.0193
|
|
|
| [13] |
SALEHI SARBIJAN M, BEHNAMIAN J Multi-fleet feeder vehicle routing problem using hybrid metaheuristic[J]. Computers and Operations Research, 2022, 141: 105696
doi: 10.1016/j.cor.2022.105696
|
|
|
| [14] |
AMINE MASMOUDI M, MANCINI S, BALDACCI R, et al Vehicle routing problems with drones equipped with multi-package payload compartments[J]. Transportation Research Part E: Logistics and Transportation Review, 2022, 164: 102757
doi: 10.1016/j.tre.2022.102757
|
|
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
| |
Shared |
|
|
|
|
| |
Discussed |
|
|
|
|