完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHo, Shinn-Ying
dc.contributor.authorChen, Jian-Hung
dc.date.accessioned2009-06-02T07:22:52Z
dc.date.accessioned2020-05-29T06:17:27Z-
dc.date.available2009-06-02T07:22:52Z
dc.date.available2020-05-29T06:17:27Z-
dc.date.issued2006-11-08T03:04:08Z
dc.date.submitted1999-12-20
dc.identifier.urihttp://dspace.fcu.edu.tw/handle/2377/2990-
dc.description.abstractThis 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.
dc.description.sponsorship淡江大學, 台北縣
dc.format.extent8p.
dc.format.extent506900 bytes
dc.format.mimetypeapplication/pdf
dc.language.isozh_TW
dc.relation.ispartofseries1999 NCS會議
dc.subjectAlgorithms
dc.subjecttraveling salesman problem
dc.subjectgenetic algorithms
dc.subjectsystematic reasoning
dc.subjectorthogonal array-based crossove
dc.subject.other遺傳演算法
dc.titleA GA-based Systematic Reasoning Approach for Solving Traveling Salesman Problems Using an Orthogonal Array-based Crossover
分類:1999年 NCS 全國計算機會議

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


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