๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Boolean neural network approach for the traveling salesman problem

โœ Scribed by Bhide, S.; John, N.; Kabuka, M.R.

Book ID
119772139
Publisher
IEEE
Year
1993
Tongue
English
Weight
817 KB
Volume
42
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

A heuristic circulation-network approach
A heuristic circulation-network approach to solve the multi-traveling salesman problem
โœ Alberto Garcia-Diaz ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 561 KB

The overall methodology developed in this paper can be organized into two major parts. The first part consists of a representation of the Multi-Traveling Salesman Problem as a network circulation model. The second part is a subtour elimination procedure. The circulation-network representation of the