Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11427391_121 | ISNN (1) |
Keywords | Field | DocType |
excellent solution,available vehicle,transiently chaotic neural network,sweep-based tcnn algorithm,capacity vehicle,capacity vehicle routing problem,proposed algorithm,selected fleet,short computing time,vehicle routing problem | Vehicle routing problem,Computer science,Algorithm,Travelling salesman problem,Artificial intelligence,Artificial neural network,Chaotic neural network | Conference |
Volume | ISSN | ISBN |
3496 | 0302-9743 | 3-540-25912-0 |
Citations | PageRank | References |
1 | 0.38 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Huali Sun | 1 | 8 | 1.54 |
| Jianying Xie | 2 | 10 | 2.75 |
| Yao-feng Xue | 3 | 1 | 1.73 |