摘要
以杭烟物流 640 0多户卷烟零售网点配送网络为研究对象 ,提出 1 1 0多条送货线路的网格划分和求解算法 .内容包括不同送货线路之间的广义工作量均衡、网点密集簇和关键边的定义与遴选、密集簇的向外搜索扩展等 .采用网格划分算法进行卷烟配送线路分区研究属于探索领域 ,其成果在城市配送系统具有普遍适用性和应用推广前景 .
A reseau-dividing algorithm was presented in this paper for determining more than 110 distribution lines in routing the products of Hangzhou Tobacco Company. There are more than 6400 cigarette shopkeepers selling products for this company. The method aims to reach the equilibrium of generalized workload between different distribution lines. Simulation results show that the algorithm is both effective and applicable,and it may extend to other cases.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2004年第3期46-51,共6页
Systems Engineering-Theory & Practice
基金
浙江省哲学社会科学规划课题研究成果 (NX0 3 GL2 9)
杭州市科技发展计划项目 (2 0 0 2 1 2 1 A0 1 )
