발간년도 : [2017]
| 논문정보 |
|
| 논문명(한글) |
[Vol.12, No.2] A Search of the Shortest Route with a Limit on a Number of Transfer using Genetic Algorithm |
|
| 논문투고자 |
Myun_Sub Lee |
|
| 논문내용 |
The major role of intelligent character in an artificial intelligence game is to be smarter and to add more interest on character behaviors. Moreover, to apply artificial intelligence on behaviors and movements of intelligent characters, the time to process artificial intelligence should be shortened because even without the process of artificial intelligence, it takes time to visualize and print out a character with intelligence. In this study, the method that searching a spanning tree with the lowest cost which is limited in a number of transfer by a using genetic algorithm is suggested. In genetic algorithm, a roulette selection was chosen to be the selection method, and hybridization method of uniform crossover was applied. The elite conservation strategy for throwing back the optimal parameter to the following generation was applied to shorten the searching time. The Dandelion Code, an effective method to encode a tree in the evolution algorithm, was used. As a result of experiment, when the definite number was 50, 60, 70, and 80, the number of transfer limitation was 3 and 5 to compare the cost and time of spanning tree. When the definite number was 80 and the number of transfer was 5, the route was searched 0.161 seconds earlier. |
|
| 첨부논문 |
|
|
|
|
|
자료실 > 논문지 
