Please wait a minute...
Journal of ZheJiang University (Engineering Science)  2026, Vol. 60 Issue (4): 690-701    DOI: 10.3785/j.issn.1008-973X.2026.04.002
    
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
Download: HTML     PDF(1486KB) HTML
Export: BibTeX | EndNote (RIS)      

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.



Key wordssite selection of pick-up points      K-means clustering      cigarette distribution route planning      retailer priority      multi-objective optimization     
Received: 19 February 2025      Published: 19 March 2026
CLC:  TH 166  
Fund:  国家自然科学基金资助项目(52405565);浙江省尖兵领雁科技计划资助项目(2024C01208).
Corresponding Authors: Liming ZHU     E-mail: syp123gh@zjut.edu.cn;zlm@zjtobacco.com
Cite this article:

Yiping SHAO,Miao WANG,Xin JI,Liming ZHU,Jiansha LU,Peijun XU. Site selection of pick-up points and distribution route planning of cigarette based on EKM-PSA algorithm. Journal of ZheJiang University (Engineering Science), 2026, 60(4): 690-701.

URL:

https://www.zjujournals.com/eng/10.3785/j.issn.1008-973X.2026.04.002     OR     https://www.zjujournals.com/eng/Y2026/V60/I4/690


基于EKM-PSA算法的卷烟自提点选址和配送路径规划

针对传统配送模式在地广人稀区域存在成本高昂、路径重复率高、低效率及零售户服务时效性差等问题,提出基于EKM-PSA算法的卷烟自提点选址和配送路径规划方法. 对于卷烟自提点选址问题,提出融合经济效益指标的改进 K 均值聚类算法,构建自提零售户补贴机制,建立自提点选址模型. 对于卷烟配送路径规划问题,建立包含时间窗约束的多目标卷烟配送路径规划模型,目标函数包括零售户服务优先级成本、车辆固定成本、车辆运输成本、自提点补贴成本、自提点建设及运营成本,提出优先级模拟退火算法进行求解. 以 Z 地市区域烟草配送为例,进行实例研究和算法对比,结果表明总成本较原方案减少20%,运输距离较原方案减少19%,验证了所提模型的有效性及算法的优越性.


关键词: 自提点选址,  K-means聚类,  卷烟配送路径规划,  零售户优先级,  多目标优化 
Fig.1 Flow chart of economic K-means (EKM)
聚类簇数轮廓系数
K-means算法EKM算法
20.89170.9233
30.80580.8376
40.74010.7821
50.71590.7645
Tab.1 Comparison of K-means and EKM
Fig.2 Neighborhood structures in a path
Fig.3 Neighborhood structures between path
Fig.4 Flow chart of PSA algorithm
实验编号因子级别最低成本
$ {T}_{0} $$ {V}_{0} $RC101
13000.995604
23000.997611
33000.999609
45000.995574
55000.997598
65000.999601
78000.995596
88000.997604
98000.999599
Tab.2 Orthogonal experimental table
算例PSASATSGA
CRCRCRCR
RC101574513680607693620682620
RC102624520688573723628694714
RC103579483882735863594732649
RC201582485671559812597713572
RC2025804341033861732662722639
RC203575493629524698592685585
Tab.3 Experimental results of Solomon standard examples
编号X/kmY/km卷烟配送时间订单需求量
14422.1210941.79:003.0
24460.8910983.710:1045.5
34467.6810516.512:2020.0
44408.4910932.714.207.5
Tab.4 Example of actual example data
Fig.5 Distribution diagram of retailers
Fig.6 Site selection results of pick-up points
编号X/kmY/km$ {Z}_{i} $
14412.0210923.12.337
24412.2010920.93.336
34412.8510918.42.154
44414.6410908.92.699
54457.3110983.24.158
64443.6810980.15.215
74473.9410772.25.221
84432.3310832.84.112
94463.1310787.86.123
104468.1210517.95.158
114459.4210520.58.332
124463.1710519.46.215
134468.1210517.96.213
Tab.5 Situation of pick-up points
编号X/kmY/km$ {G}_{i} $编号X/kmY/km$ {G}_{i} $
14463.4110990.815224460.8910983.737
24467.3010514.030234457.3610980.6110
34466.9110995.425244464.9210996.029
44455.7210978.2118254461.1010983.921
54417.6910935.221264466.0610995.329
64460.9410983.735274461.4610986.735
74457.5010978.6113284457.3710980.743
84465.6610994.420294465.6610994.425
94422.1210941.712304412.0210923.198
104417.6110935.317314412.2010920.9155
114461.0410983.910324412.8510918.4207
124457.1210515.24334414.6410908.9236
134463.7710978.324344457.3110983.2101
144457.2310515.049354443.6810980.1127
154460.9010983.718364432.3310832.8223
164464.8010995.918374463.1310787.8207
174463.8510983.736384473.9410772.2102
184417.4410935.312394459.4210520.5197
194459.3910989.231404463.1310519.4335
204461.8910977.97414463.1710519.4320
214417.6210935.130424468.1210517.9299
Tab.6 Retailers and pick-up points to be delivered
Fig.7 Historical priority cost per unit time
Fig.8 Current priority cost per unit time
Fig.9 Optimal delivery route map
路径编号路径R/kmC/元
10-z4-z3-z2-z1-18-16-10-
5-21-9-20-13-17-19-0
141.95158
20-z6-4-7-23-z5-28-22-15-29-
11-25-27-1-6-8-26-3-16-24-0
147.32165
30-z8-z9-z7-0202.68227
40-z12-z13-z10-2-z11-12-11-0725.00812
Tab.7 Optimal distribution plan
Fig.10 Summary of distribution routes
路径编号路径R/kmC/元
10-20-13-17-z5-28-22-26-3-
16-24-z4-z3-0
219.64245
20-4-7-23-15-29-11-25-27-1-6-8-
18-16-10-5-21-9-z6-19-z2-z1-0
315.17353
30-z8 -z13-11-z7-0901.251010
40-z9-z12-12-z10-2-z11-0673.21754
Tab.8 Path result of SA
路径编号路径R/kmC/元
10-20-13-17-19-1-6-8-26-
3-16-24-z4-18-16-10-5-21-9-0
212.68238
20-z3-z2-z1-4-7-23-28-
22-15-29-11-25-27-0
245.54275
30-z6 -z5-z8-0290.18325
40-z9-z7-z12-2-z13-z10-12-
11-z11-0
900.901009
Tab.9 Path result of TS
算法R/kmC/元G/次T/s
PSA1216.9513621500341.0
SA2109.2723621150410.4
TS1649.318471450388.0
Tab.10 Comparison of performance indexes of multiple algorithms
Fig.11 Convergence effect of SA, PSA and TS
[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
[1] Jianhong CHEN,Guoyun WANG,Keqing ZUO,Hongkun ZHANG,Yanke BAO. Operation planning of complex combined heat and power systems based on multi-objective optimization[J]. Journal of ZheJiang University (Engineering Science), 2026, 60(1): 148-157.
[2] Yabo LUO,Shaolong YU,Feng ZHANG,Cunrong LI. Improved migrating bird algorithm for re-entrant hybrid flowshop scheduling problem with lot streaming[J]. Journal of ZheJiang University (Engineering Science), 2025, 59(8): 1598-1607.
[3] Zhaolong LI,Shanmin PANG,Chaoyu WANG,Yifeng WANG,Pengcheng SHI. Pair-wise point cloud registration method based on normal distribution similarity[J]. Journal of ZheJiang University (Engineering Science), 2025, 59(6): 1179-1190.
[4] Yu WANG,Chunrong MA,Mingyue ZHAO. Collaborative multi-task assignment of heterogeneous UAVs based on hybrid strategies based multi-objective particle swarm[J]. Journal of ZheJiang University (Engineering Science), 2025, 59(4): 821-831.
[5] Yong LI,Yue WANG,Fuqiang LIU,Baiqing SUN,Kairu LI. Multi-task allocation framework in context of caregiver-robot collaborative elderly care[J]. Journal of ZheJiang University (Engineering Science), 2025, 59(2): 375-383.
[6] Yingfei ZHANG,Xiaobing HU,Hang ZHOU,Xuzeng FENG. Three-dimensional sector automatic design based on improved NSGA-II algorithm[J]. Journal of ZheJiang University (Engineering Science), 2025, 59(2): 413-422.
[7] Haiye CHEN,Zeqiang ZHANG,Wei LIANG,Lei GUO,Qiyao DUAN. Modeling and optimization of human-robot collaborative U-shaped disassembly line problem with multi-constraint[J]. Journal of ZheJiang University (Engineering Science), 2025, 59(11): 2248-2258.
[8] Chao LIU,Hao DING,Juanjuan ZHENG,Shaofu HUANG,Zuqing LUO,Gang SHEN. Predictive modeling and adaptive optimization method for ball screw whirling milling process[J]. Journal of ZheJiang University (Engineering Science), 2025, 59(11): 2259-2268.
[9] Hao ZOU,Guotun HU,Yunlong QIU,Wei SHI,Weifang CHEN. Multi-objective optimization of wall mass injection flow ratedistribution for hypersonic vehicle[J]. Journal of ZheJiang University (Engineering Science), 2025, 59(11): 2439-2450.
[10] Mengyuan HAO,Leike ZHANG,Xiaolian LIU,Xueni WANG,Yu TIAN. Pumps and valves joint optimization control in complex water conveyance system based on artificial rabbits optimization algorithm[J]. Journal of ZheJiang University (Engineering Science), 2025, 59(10): 2115-2124.
[11] Tingfang YU,Genli ZHANG,Jiapeng ZHOU,Yicun TANG. Performance analysis and optimization of supercritical CO2 Brayton cycle coupled with organic flash cycle[J]. Journal of ZheJiang University (Engineering Science), 2025, 59(1): 130-140.
[12] Ruoqiong LI,Yuan WENG,Xin LI. Parameter optimization of fractional-order magnetically-coupled resonant bidirectional wireless power transfer system[J]. Journal of ZheJiang University (Engineering Science), 2025, 59(1): 141-151.
[13] Qianlin YE,Wanliang WANG,Zheng WANG. Survey of multi-objective particle swarm optimization algorithms and their applications[J]. Journal of ZheJiang University (Engineering Science), 2024, 58(6): 1107-1120.
[14] Yan ZHAN,Jieya CHEN,Weiguang JIANG,Jiansha LU,Hongtao TANG,Xinyu SONG,Lili XU,Saimiao LIU. Multi-objective workshop material distribution method based on improved NSGA-[J]. Journal of ZheJiang University (Engineering Science), 2024, 58(12): 2510-2519.
[15] Haiying ZENG,Peinan YE,Huahui JIN,Jingyu LIU,Duofeng CEN. Rock block shape classification and numerical simulation of soil-rock mixture based on machine learning algorithms[J]. Journal of ZheJiang University (Engineering Science), 2024, 58(10): 2119-2127.