請使用永久網址來引用或連結此文件:
https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/121393
|
| 題名: | Minimization of the Total Traveling Distance and Maximum Distance by Using a Transformed-Based Encoding EDA to Solve the Multiple Traveling Salesmen Problem |
| 作者: | Chen, S. H. |
| 日期: | 2015-09-17 |
| 上傳時間: | 2021-09-28 12:10:18 (UTC+8) |
| 摘要: | Estimation of distribution algorithms (EDAs) have been used to solve numerous hard problems. However, their use with in-group optimization problems has not been discussed extensively in the literature. A well-known in-group optimization problem is the multiple traveling salesmen problem (mTSP), which involves simultaneous assignment and sequencing procedures and are shown in different forms. This paper presents a new algorithm, named EDAMLA, which is based on self-guided genetic algorithm with a minimum loading assignment (MLA) rule.This strategy uses the transformed-based encoding approach instead of direct encoding. The solution space of the proposed method is only ??!. We compare the proposed algorithm against the optimal direct encoding technique, the two-part encoding genetic algorithm, and, in experiments on 34 TSP instances drawn from the TSPLIB, find that its solution space is ??! ( ??−1 ??−1 ). The scale of the experiments exceeded that presented in prior studies. The results show that the proposed algorithm was superior to the two-part encoding genetic algorithm in terms of minimizing the total traveling distance. Notably, the proposed algorithm did not cause a longer traveling distance when the number of salesmen was increased from 3 to 10. The results suggest that EDA researchers should employ the MLA rule instead of direct encoding in their proposed algorithms. |
| 關聯: | Mathematical Problems in Engineering 2015, 640231 (13 pages) |
| DOI: | 10.1155/2015/640231 |
| 顯示於類別: | [資訊工程學系暨研究所] 期刊論文
|
文件中的檔案:
| 檔案 |
描述 |
大小 | 格式 | 瀏覽次數 |
|---|
| index.html | | 0Kb | HTML | 121 | 檢視/開啟 | | Minimization of the Total Traveling Distance and Maximum Distance by Using a Transformed-Based Encoding EDA to Solve the Multiple Traveling Salesmen Problem.pdf | | 2236Kb | Adobe PDF | 54 | 檢視/開啟 |
|
在機構典藏中所有的資料項目都受到原著作權保護.
|