𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A neural network algorithm for the multiple traveling salesmen problem

✍ Scribed by E. Wacholder; J. Han; R. C. Mann

Book ID
104663073
Publisher
Springer-Verlag
Year
1989
Tongue
English
Weight
733 KB
Volume
61
Category
Article
ISSN
0340-1200

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Lagrangian-based algorithm for a Multi
A Lagrangian-based algorithm for a Multiple Depot, Multiple Traveling Salesmen Problem
✍ S. Yadlapalli; W.A. Malik; S. Darbha; M. Pachter πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 713 KB

In this manuscript, we consider the problem of motion planning of m Dubins' vehicles through n points in a plane. The initial location and heading of the vehicles is specified and is assumed to be distinct for each vehicle. A motion plan for a vehicle is given by the sequence of points and the corre

A self-organizing neural network approac
A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems
✍ Abdolhamid Modares; Samerkae Somhom; Takao Enkawa πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 201 KB

This paper addresses several algorithms based on self-organizing neural network approach for routing problems. The algorithm for Traveling Salesman Problem is elaborated and the extension of the proposed algorithm to more complex problems namely, Multiple Traveling Salesmen and Vehicle Routing is di