淡江大學機構典藏:Item 987654321/121481
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 64187/96966 (66%)
造訪人次 : 11335707      線上人數 : 158
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋


    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/121481


    題名: Operators of the Two-Part Encoding Genetic Algorithm in Solving the Multiple Traveling Salesmen Problem
    作者: Chen, S. H.;Chen, M. C.
    關鍵詞: mTSP;two-part chromosome;crossover operators;nutation operators
    日期: 2011-11-11
    上傳時間: 2021-10-14 12:13:16 (UTC+8)
    出版者: IEEE
    摘要: The multiple traveling salesmen problem (mTSP) considers the m salesmen to visit n cities. This problem involves the assignment of the salesmen to some locations and we have to optimize the sequence within the route, so it is even harder than the traveling salesman problem (TSP) in nature. As a result, there are some algorithms used to solve the mTSP when the problem size is large. Particularly, genetic algorithm (GA) is quite famous in solving this problem while the problem size is large. When we compare the major existing encoding methods for mTSP, the best approach could be the two-part chromosome encoding due to its solution space is the smallest. The two parts are responsible for the sequence and the number of cities should be visited by each salesman. However, because the two-part chromosome technique is the recently proposed encoding method, the better combination of the crossover operators and mutation operators have not studied for this encoding method. As a result, this paper investigates the genetic operators could be used for this purpose by design-of-experiments (DOE). The appropriate genetic operators are suggested in this paper and it could be used to applied in the GA which employs the two-part chromosome encoding technique.
    關聯: 2011 International Conference on Technologies and Applications of Artificial Intelligence, p.331-336
    DOI: 10.1109/TAAI.2011.64
    顯示於類別:[資訊工程學系暨研究所] 會議論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML63檢視/開啟
    Operators of the Two-Part Encoding Genetic Algorithm in Solving the Multiple Traveling Salesmen Problem.pdf337KbAdobe PDF2檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋