✦ LIBER ✦

A sequence for using algorithms for the approximate solution in the hybrid algorithm for solving the travelling salesman problem

✍ Scribed by I.Kh. Sigal

Publisher: Elsevier Science
Year: 1989
Weight: 366 KB
Volume: 29
Category: Article
ISSN: 0041-5553
DOI: 10.1016/s0041-5553(89)80010-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A modification of the algorithm for solv

A modification of the algorithm for solving the travelling salesman problem

✍ L.N. Volovik; B.Ya. Skachek 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 730 KB

Study of an algorithm for solving the tr

Study of an algorithm for solving the travelling salesman problem

✍ V.K. Leont'ev 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 516 KB

An efficient hybrid genetic algorithm fo

An efficient hybrid genetic algorithm for the traveling salesman problem

✍ Kengo Katayama; Hiroyuki Narihisa 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB 👁 2 views

A search algorithm for the traveling sal

A search algorithm for the traveling salesman problem

✍ Jatinder N.D. Gupta 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 713 KB

The efficiency of hybrid mutation geneti

The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem

✍ K Katayama; H Sakamoto; H Narihisa 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 519 KB

In this paper, we present an efficient genetic algorithm (GA) for solving the travelling salesman problem (TSP) as a combinatorial optimization problem. In our computational model, we propose a complete subtour exchange crossover that does not break as some good subtours as possible, because the goo

An algorithm for the approximate solutio

An algorithm for the approximate solution of a large-scale travelling salesman problem in a plane

✍ I.Kh. Sigal 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 362 KB