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

Location algorithm of mobile warehouse in express demand region with high strength

作　　者：戢晓峰[1] 覃文文[1] 焦新龙[2] 梁斐雯[1] 

机构地区：[1]昆明理工大学交通工程学院,云南昆明650500 [2]宁波工程学院交通与物流学院,浙江宁波315211

出　　处：《交通运输工程学报》2012年第6期69-75,共7页Journal of Traffic and Transportation Engineering

基　　金：国家自然科学基金项目(61263025);云南省教育厅科学研究基金项目(2011Y370);宁波市自然科学基金项目(2012A610153)

摘　　要：研究了高强度快递需求区域移动仓库选址问题的特点,以移动仓库总建设规模最小为目标函数,以区域需求量和仓库服务能力为约束条件,提出了基于多粒度集合覆盖问题的相遇蚁群算法。将需求点虚拟成粒子,利用K-means算法对粒子聚类,在划分好的粒子群里得到移动仓库备选点,分别应用传统的蚁群算法和相遇蚁群算法进行实例验证。计算结果表明:运用传统的蚁群算法,运算时间为12.714 4s,最优解个数为13,最差解个数为15,平均解个数为13,解的正确率为79%;运用相遇蚁群算法,运算时间为3.806 4s,最优解个数为12,最差解个数为13,平均解个数为12,解的正确率为98%,移动仓库选址方案的建设数量为12,有10个备选移动仓库是多余的。The characteristic of location problem for mobile warehouse in express demand region with high strength was studied. The minimum total construction scale of mobile warehouse was taken as objective function, the region demand and service ability of mobile warehouse were taken as constraint conditions, and the meeting ant colony optimization（MACO） based on the set- covering problem of multiple granularities was put out. The demand points were regard as virtual particles, and K-means algorithm was used to cluster the particles. The preparation points of mobile warehouse were got from the divided particles, and the example verification was carried out by using traditional ACO and MACO respectively. Calculation result indicates that while traditional ACO is used, the computing time is 12. 714 4： s, the optimal solution number is 13, the most poor solution number is 15, the average solution number is 13, and the correct rate of solution is 79%. While the proposed MACO is used, the computing time is 3. 806 4 s, the optimal solution number is 12, the most poor solution number is 13, the average solution number is 12, the correct rate of solution is 98%, the construction number of location scheme for mobile warehouse is 12, and 10 preparation mobile warehouses are unnecessary. 4 tabs, 9 figs, 24 refs

关 键 词：物流工程 快递需求区域 移动仓库 集合覆盖问题 相遇蚁群算法 

分 类 号：U491.12[交通运输工程—交通运输规划与管理]