带容量约束的多车调度暂态混沌神经网络算法  

The Transiently Chaotic Neural Network Optimization Algorithm for Capacity Vehicle Routing Problem

作　　者：孙华丽[1] 谢剑英[1] 薛耀锋[1] 

机构地区：[1]上海交通大学自动化系,上海200030

出　　处：《上海交通大学学报》2006年第7期1148-1151,共4页Journal of Shanghai Jiaotong University

摘　　要：带容量约束的多车调度问题是典型的NP-hard问题,利用模糊C均值聚类算法的相似性分类原理及混沌神经网络的全局搜索能力和高搜索效率,提出了一种快速且易于实现的新的混合启发式算法.该算法分为用模糊C均值聚类算法将所有客户按车容量要求装车和用暂态混沌神经网络方法对每条路线排序两个阶段.实例计算以及与其他算法比较表明,该算法是一种求解多车调度问题的可行且高效的方法.Capacity vehicle routing problem （CVRP） is an NP-hard problem. A novel approximation algorithm was presented for the problem of finding the minimum total cost of all routes in CVRP environment. The new algorithm is based on the principle of fuzzy C-means （FCM） clustering algorithm and the transiently chaotic neural network （TCNN） algorithm. FCM can group the customers with close Euclidean distance into the same vehicle according to the principle of similar feature partition, firstly. TCNN combines local search and global search, possessing high search efficiency. It will solve the routes to optimality. The computation results show that the proposed algorithm is a viable and effective approach for CVRP.

关 键 词：车辆调度 模糊C均值聚类 暂态混沌神经网络 混合优化算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]