Investigations of Factors Affecting the Genetic Algorithm for Shortest Driving Time

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2009

期刊名稱

2009 INTERNATIONAL CONFERENCE OF SOFT COMPUTING AND PATTERN RECOGNITION

卷期與頁次

頁 106–+

ISBN

978-1-4244-5330-6

語言

英文

摘要

In this paper we investigate the influences on the genetic algorithm for the shortest driving time problem due to factors such as nodes on a map, the population size, the mutation rate, the crossover rate, and the converging rate. When the nodes on the map increase, more execution time is needed and much difference between the approximate solution and the exact solution appear on running genetic algorithms. Also, from the view point of the population initialization, restart type and reback type affect the precision of approximate solutions and the execution time. The characteristics of the factors we find in the paper provide us insight how to improve the genetic algorithm for the shortest driving time problem.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Lin, C.-H., Lee, C.-Y., Liu, J.-C., & Zuo, H.-T. (2009). Investigations of Factors Affecting the Genetic Algorithm for Shortest Driving Time. 2009 INTERNATIONAL CONFERENCE OF SOFT COMPUTING AND PATTERN RECOGNITION, 106–+. https://doi.org/10.1109/SoCPaR.2009.32

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/134958