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
β¦ LIBER β¦
An asynchronous recurrent linear threshold network approach to solving the traveling salesman problem
β Scribed by E.J. Teoh; K.C. Tan; H.J. Tang; C. Xiang; C.K. Goh
- Book ID
- 113815468
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 344 KB
- Volume
- 71
- Category
- Article
- ISSN
- 0925-2312
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A heuristic circulation-network approach
β
Alberto Garcia-Diaz
π
Article
π
1985
π
John Wiley and Sons
π
English
β 561 KB
A new approach to solve the traveling sa
β
Paulo Henrique Siqueira; Maria Teresinha Arns Steiner; SΓ©rgio Scheer
π
Article
π
2007
π
Elsevier Science
π
English
β 248 KB
An evolutionary approach to the travelin
β
D. B. Fogel
π
Article
π
1988
π
Springer-Verlag
π
English
β 463 KB
Evolutionary optimization has been proposed as a method to generate machine learning through automated discovery. A simulation of natural evolution is conducted using the traveling salesman problem as an artificial environment. For an exact solution of a traveling salesman problem, the only known al
On a Linear-Programming, Combinatorial A
β
Dantzig, G. B.; Fulkerson, D. R.; Johnson, S. M.
π
Article
π
1959
π
INFORMS
π
English
β 302 KB
Thermodynamical approach to the travelin
β
V. ΔernΓ½
π
Article
π
1985
π
Springer
π
English
β 624 KB
An analogue approach to the travelling s
β
Durbin, Richard; Willshaw, David
π
Article
π
1987
π
Nature Publishing Group
π
English
β 375 KB