城市配送车辆路径优化集束式算法的客户点归并策略  

Customer Point Merging Strategy of Cluster Algorithm to Urban Distribution Routing Optimization

作　　者：朱孟高[1] 米娜 

机构地区：[1]山东电子职业技术学院管理与应用外语系,山东济南250200 [2]山东兰剑物流科技股份公司咨询规划部,山东济南250101

出　　处：《数学的实践与认识》2013年第11期47-51,共5页Mathematics in Practice and Theory

摘　　要：VRP问题的研究起步较早,求解方法也非常丰富,然而,面对客户规模庞大,交通网络复杂的多约束车辆优化调度问题,现有算法显得无能为力.为有效解决需求点规模庞大的城市配送车辆优化调度问题,提出一种新的两阶段启发式算法——集束式算法,采用"集中后分派,分派后扩展"的思想,对末梢客户和同路段客户进行客户点合并,从全局上降低搜索范围,并提出相关客户点归并算法.The early start of the VRP problem solving method is also very rich, however, faced with clients large and complex transportation network multi-constrained vehicle scheduliag problem, existing algorithms appear powerless. To finding an effective solution to the demand point scale urban distribution vehicle scheduling problem, a new two-stage heuristic algorithm - cluster algorithm is proposed, with the idea of focusing first, then distributing and expansion. For peripheral customers and the same section clients, the merger of customers point is to reduce the search range from the global, related to customer sites and proposed merging algorithm.

关 键 词：集束式 合并 客户点 路径优化 

分 类 号：U116.2[交通运输工程]