摘要
A novel sweep-based transiently chaotic neural network (STCNN) algorithm for Capacity Vehicle Routing Problem (CVRP) is proposed. CVRP can be partitioned into two kinds of decisions: the selection of vehicles among the available vehicles and the routing of the selected fleet. The proposed algorithm first generates a number of routes that are served by vehicles and then solves the routes to optimality. Simulations show that the proposed algorithm produces excellent solutions in short computing times.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 756-761 |
| 页数 | 6 |
| 期刊 | Lecture Notes in Computer Science |
| 卷 | 3496 |
| 期 | I |
| DOI | |
| 出版状态 | 已出版 - 2005 |
| 已对外发布 | 是 |
| 活动 | Second International Symposium on Neural Networks: Advances in Neural Networks - ISNN 2005 - Chongqing, 中国 期限: 30 5月 2005 → 1 6月 2005 |
指纹
探究 'A sweep-based TCNN algorithm for Capacity Vehicle Routing Problem' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver