題名: A GA-based Systematic Reasoning Approach for Solving Traveling Salesman Problems Using an Orthogonal Array-based Crossover
作者: Ho, Shinn-Ying
Chen, Jian-Hung
關鍵字: Algorithms
traveling salesman problem
genetic algorithms
systematic reasoning
orthogonal array-based crossove
期刊名/會議名稱: 1999 NCS會議
摘要: This paper proposes a novel genetic algorithm-based systematic reasoning approach using an orthogonal array-based crossover (OABX) for solving the traveling salesman problem (TSP). OABX makes use of the systematic reasoning ability of orthogonal arrays that can effectively preserve superior sub-paths from parents and guide the solution towards better quality. It is shown empirically that OAB outperforms various superior crossovers of canonical approach in both accuracy and speed.
日期: 2006-11-08T03:04:08Z
分類:1999年 NCS 全國計算機會議

文件中的檔案:
檔案 描述 大小格式 
ce07ncs001999000108.pdf495.02 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。