東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Insertion ant colony optimization fo...

State University of New York at Buffalo., Geography.

FindBook

Google Book

Amazon

博客來

Insertion ant colony optimization for solving the traveling salesman problem.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Insertion ant colony optimization for solving the traveling salesman problem./
作者:	Kuo, Yu-Cheng.
面頁冊數:	145 p.
附註:	Adviser: Jean-Claude Thill.
Contained By:	Dissertation Abstracts International69-08B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3320491
ISBN:	9780549735625

Insertion ant colony optimization for solving the traveling salesman problem.
Kuo, Yu-Cheng.

Insertion ant colony optimization for solving the traveling salesman problem. - 145 p.

Adviser: Jean-Claude Thill.

Thesis (Ph.D.)--State University of New York at Buffalo, 2008.

Inspired from the ant foraging behavior, the ant colony algorithm has provided a new approach for solving discrete optimization problems---the traveling salesman problem (TSP), for instance, is usually tested as the benchmark. Since the ant colony algorithm was introduced in the 1990's, many refinements have been developed to improve the performance by refining the pheromone updating strategies, which have achieved great success on small- and medium-size of TSP instances. However, refining the pheromone updating strategies only can not further improve the performance of the traditional ant colony algorithms on large scale TSP instances. In this study, a new algorithm, insertion ant colony system (IACS) is proposed in order to overcome drawbacks that traditional ant colony algorithms may encounter while solving large scale TSP instances. By incrementally re-optimizing the initial solution, the IACS performs as well as the LK algorithm on large TSP instances.

ISBN: 9780549735625Subjects--Topical Terms:

626642
Computer Science.

Insertion ant colony optimization for solving the traveling salesman problem.
LDR:01873nmm 2200277 a 45 001 890881
005 20101105
008 101105s2008 ||||||||||||||||| ||eng d
020 $a 9780549735625
035 $a (UMI)AAI3320491
035 $a AAI3320491
040 $a UMI $c UMI
100 1 $a Kuo, Yu-Cheng. $3 1064852
245 1 0 $a Insertion ant colony optimization for solving the traveling salesman problem.
300 $a 145 p.
500 $a Adviser: Jean-Claude Thill.
500 $a Source: Dissertation Abstracts International, Volume: 69-08, Section: B, page: 4628.
502 $a Thesis (Ph.D.)--State University of New York at Buffalo, 2008.
520 $a Inspired from the ant foraging behavior, the ant colony algorithm has provided a new approach for solving discrete optimization problems---the traveling salesman problem (TSP), for instance, is usually tested as the benchmark. Since the ant colony algorithm was introduced in the 1990's, many refinements have been developed to improve the performance by refining the pheromone updating strategies, which have achieved great success on small- and medium-size of TSP instances. However, refining the pheromone updating strategies only can not further improve the performance of the traditional ant colony algorithms on large scale TSP instances. In this study, a new algorithm, insertion ant colony system (IACS) is proposed in order to overcome drawbacks that traditional ant colony algorithms may encounter while solving large scale TSP instances. By incrementally re-optimizing the initial solution, the IACS performs as well as the LK algorithm on large TSP instances.
590 $a School code: 0656.
650 4 $a Computer Science. $3 626642
650 4 $a Physical Geography. $3 893400
690 $a 0368
690 $a 0984
710 2 $a State University of New York at Buffalo. $b Geography. $3 1028193
773 0 $t Dissertation Abstracts International $g 69-08B.
790 $a 0656
790 1 0 $a Thill, Jean-Claude, $e advisor
791 $a Ph.D.
792 $a 2008
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3320491