Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 756-761 |
| Number of pages | 6 |
| Journal | Lecture Notes in Computer Science |
| Volume | 3496 |
| Issue number | I |
| DOIs | |
| State | Published - 2005 |
| Externally published | Yes |
| Event | Second International Symposium on Neural Networks: Advances in Neural Networks - ISNN 2005 - Chongqing, China Duration: 30 May 2005 → 1 Jun 2005 |