全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

高强度快递需求区域移动仓库选址算法

, PP. 69-75

Keywords: 物流工程,快递需求区域,移动仓库,集合覆盖问题,相遇蚁群算法

Full-Text   Cite this paper   Add to My Lib

Abstract:

研究了高强度快递需求区域移动仓库选址问题的特点,以移动仓库总建设规模最小为目标函数,以区域需求量和仓库服务能力为约束条件,提出了基于多粒度集合覆盖问题的相遇蚁群算法。将需求点虚拟成粒子,利用K-means算法对粒子聚类,在划分好的粒子群里得到移动仓库备选点,分别应用传统的蚁群算法和相遇蚁群算法进行实例验证。计算结果表明运用传统的蚁群算法,运算时间为12.7144s,最优解个数为13,最差解个数为15,平均解个数为13,解的正确率为79%;运用相遇蚁群算法,运算时间为3.8064s,最优解个数为12,最差解个数为13,平均解个数为12,解的正确率为98%,移动仓库选址方案的建设数量为12,有10个备选移动仓库是多余的。

References

[1]  谷淑娟,高学东,刘燕驰,等.基于多尺度网格模型的物流配送中心选址候选集构建方法[J].控制与决策,2011,26(8):1141-1146. GU Shu-juan, GAO Xue-dong, LIU Yan-chi, et al. Candidate set construction method in distribution center location based on multi-scale gridding model[J]. Control and Decision, 2011, 26(8): 1141-1146.(in Chinese)
[2]  周爱莲,李旭宏,毛海军.企业物流中心稳健性选址模型[J].交通运输工程学报,2010,10(1):60-65. ZHOU Ai-lian, LI Xu-hong, MAO Hai-jun. Robusth location model of enterprise logistics center[J]. Journal of Traffic and Transportation Engineering, 2010, 10(1): 60-65.(in Chinese)
[3]  秦 进,史 峰.物流设施选址问题的双层模拟退火算法[J].系统工程,2007,25(2):36-40. QIN Jin, SHI Feng. Bi-level simulated annealing algorithm for facility location[J]. Systems Engineering, 2007, 25(2): 36-40.(in Chinese)
[4]  秦 固.基于蚁群优化的多物流配送中心选址算法[J].系统工程理论与实践,2006,26(4):120-124. QIN Gu. Logistics distribution center allocation based on ant colony optimization[J]. Systems Engineering―Theory and Practice, 2006, 26(4): 120-124.(in Chinese)
[5]  KUO M S. Optimal location selection for an international distribution center by using a new hybrid method[J].Expert Systems with Applications, 2011, 38(6): 7208-7221.
[6]  BATANOVIC V, PETROVIC D, PETROVIC R. Fuzzy logic based algorithms for maximum covering location problems[J]. Information Sciences, 2009, 179(1/2): 120-129.
[7]  SUN Hui-jun, GAO Zi-you, WU Jian-juan. A bi-level programming model and solution algorithm for the location of logistics distribution centers[J]. Applied Mathematical Model-ling, 2008, 32(4): 610-616.
[8]  YANG Li-xing, JI Xiao-yu, GAO Zi-you, et al. Logistics distribution centers location problem and algorithm under fuzzy environment[J]. Journal of Computational and Applied Mathematics, 2007, 208(2): 303-315.
[9]  黄 宇.快递配送中心配送模型及应用研究[D].长沙:长沙理工大学,2010. HUANG Yu. Research on express distribution center distribution model and its application[D]. Changsha: Changsha University of Science and Technology, 2010.(in Chinese)
[10]  DORIGO M, GAMBARDELLA L M. Ant colony system: a cooperative learning approach to traveling salesman problem[J]. IEEE Transactions on Evolutionary Computation, 1997, 1(1): 53-66.
[11]  MULLEN R J, MONEKOSSO D, BARMAN S, et al. A review of ant algorithms[J]. Expert Systems with Applications, 2009, 36(6): 9608-9617.
[12]  CHEN C H, TING C J. Combining Lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem[J]. Transportation Research Part E: Logistics and Transportation Review, 2008, 44(6): 1099-1122.
[13]  王 非,孙浩杰,罗卫华,等.指定备选点的配送中心选址-库存模型[J].长安大学学报:自然科学版,2012,32(2):91-95. WANG Fei, SUN Hao-jie, LUO Wei-hua, et al. Location-inventory model of distribution center with appointed alternative location[J]. Journal of Chang'an University: Natural Science Edition, 2012, 32(2): 91-95.(in Chinese)
[14]  李卫江,郭晓汾,张 毅,等.基于MATLAB优化算法的物流中心选址[J].长安大学学报:自然科学版,2006,26(3):76-79. LI Wei-jiang, GUO Xiao-fen, ZHANG Yi, et al. Logistics center location based on MATLAB optimization algorithm[J]. Journal of Chang'an University: Natural Science Edition, 2006, 26(3): 76-79.(in Chinese)
[15]  冯富宝.集合覆盖问题研究[D].济南:山东大学,2006. FENG Fu-bao. Research on set cover problem[D]. Jinan: Shandong University, 2006.(in Chinese)
[16]  张燕平,张 铃,吴 涛.不同粒度世界的描述法――商空间法[J].计算机学报,2004,27(3):328-333. ZHANG Yan-ping, ZHANG Ling, WU Tao.The representation of different granular worlds: a quotient space[J]. Chinese Journal of Computers, 2004, 27(3): 328-333.(in Chinese)
[17]  覃文文,戢晓峰.基于K-means聚类的快递企业客户细分方法[J].世界科技研究与发展,2011,33(6):955-958. QIN Wen-wen, JI Xiao-feng. Researches on customer segmentation of express enterprise based on K-means clustering[J]. World Sci-tech R and D, 2011, 33(6): 955-958.(in Chinese)
[18]  寿涌毅,赖昌涛,吕如福.班轮船舶调度多目标优化模型与蚁群算法[J].交通运输工程学报,2011,11(4):84-88. SHOU Yong-yi, LAI Chang-tao, LU Ru-fu. Multi-objective optimization model and colony optimization of liner ship scheduling[J]. Journal of Traffic and Transportation Engin-eering, 2011, 11(4): 84-88.(in Chinese)
[19]  STUTZLE T, HOOS H. Max-min ant system[J]. Future Generation Computer System, 2000, 16(8): 889-914.
[20]  孙启鹏,吴群琪.运输需求生成机理及其规律[J].长安大学学报:社会科学版,2008,10(2):7-11,15. SUN Qi-peng, WU Qun-qi. Transport demand generating mechanism in corridor and its typical law[J]. Journal of Chang'an University: Social Science Edition, 2008, 10(2): 7-11, 15.(in Chinese)
[21]  RANDALL M. Solution approaches for the capacitated single allocation hub location problem using ant colony optimization[J]. Computational Optimization Applications, 2008, 39(2): 239-261.
[22]  CHEN J F. A heuristics for the capacitated single allocation hub location problem[J]. Lecture Notes in Electrical Engin-eering, 2008(5): 185-196.
[23]  胡郁葱,商慧丽,李 敏.容量限制条件下改进的地下快速路集散点选择模型[J].中国公路学报,2012,25(3):135-140. HU Yu-cong, SHANG Hui-li, LI Min. Improved depot choice model of underground expressway in the condition of capacity restraint[J]. China Journal of Highway and Transport, 2012, 25(3): 135-140.(in Chinese)
[24]  徐红梅,杨兆升,闫长文,等.基于蚁群算法求解物流订单派送问题[J].长安大学学报:自然科学版,2007,27(6):84-86. XU Hong-mei, YANG Zhao-sheng, YAN Chang-wen, et al. Solving appoint order form job problem based on ant colony system[J]. Journal of Chang'an University: Natural Science Edition, 2007, 27(6): 84-86.(in Chinese)

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133