Abstract
Competitive learning in neural networks involving cooperation and categorization is discussed. Extended vehicle routing problems in the Euclidean space are discussed. A fixed number of vehicles with a shared depot make subtours around precategorized cities and collect demands. The minimal tour length and even loaded demands are conflicting requirements for the optimization. This situation does not appear in a simple traveling salesman problem. The self-organization method gives qualified approximate solutions without computational backtracks. Experiments were made on the USA532 set. All computations can be carried out by a conventional workstation.
| Original language | English |
|---|---|
| Title of host publication | Proceedings. IJCNN-91-Seattle: International Joint Conference on Neural Networks |
| Editors | Anon |
| Place of Publication | Piscataway, NJ, United States |
| Publisher | Publ by IEEE |
| Pages | 385-390 |
| Number of pages | 6 |
| ISBN (Print) | 0780301641 |
| Publication status | Published - 1991 |
| Externally published | Yes |
| Event | International Joint Conference on Neural Networks - IJCNN-91-Seattle - Seattle, WA, USA Duration: 1991 Jul 8 → 1991 Jul 12 |
Other
| Other | International Joint Conference on Neural Networks - IJCNN-91-Seattle |
|---|---|
| City | Seattle, WA, USA |
| Period | 91/7/8 → 91/7/12 |
ASJC Scopus subject areas
- Engineering(all)