Cockroach Swarm Optimization for Vehicle Routing Problem

摘要：

Cockroach swarm optimization (CSO) is modified and applied to solve the vehicle routing problem (VRP). The mapping from -1, 1 to the routing set is constructed as the encode method, and VRP is solved by taking advantage of CSO for continuous function. Compare with particle swarm optimization (PSO) the experimental results on vehicle routing problem without time window and with time windows show that CSO can improve success rate of searching best route and is a feasible and effective method for vehicle routing problem.

关键词： Vehicle Routing Problem: Vehicle Routing Problem with Time Windows Cockroach Swarm Optimization Particle Swarm Optimization Combinatorial optimization

作者: Zhaohui Chen Haiyan Tang

作者单位: Department of Mathematics and Physics Chongqing University of Science and Technology Chongqing, China

会议类型: 国际会议

会议名称: 2010 International Conference on Information Security and Artificial Intelligence(2010年信息安全与人工智能国际会议 ISAI 2010)

会议地点: 成都

会议语种:英文

页码: 31-34

在线出版日期: 2010-12-17（万方平台首次上网日期，不代表论文的发表时间）