Modified shuffled frog-leaping algorithm to solve traveling salesman problem
Modified shuffled frog-leaping algorithm to solve TSP was proposed,which presented the concept of adjustment sequence to design the strategy of local searching,and added the mutation operation in the global exchange of information.Experimental results indicate that,compared with genetic algorithm an...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2009-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74649553/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841537605760450560 |
|---|---|
| author | LUO Xue-hui YANG Ye LI Xia |
| author_facet | LUO Xue-hui YANG Ye LI Xia |
| author_sort | LUO Xue-hui |
| collection | DOAJ |
| description | Modified shuffled frog-leaping algorithm to solve TSP was proposed,which presented the concept of adjustment sequence to design the strategy of local searching,and added the mutation operation in the global exchange of information.Experimental results indicate that,compared with genetic algorithm and particle swarm optimization algorithm,the proposed algorithm has more powerful search capability and more strong robustness in solving TSP. |
| format | Article |
| id | doaj-art-45aedeba807b493a9820c1508846a5ca |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2009-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-45aedeba807b493a9820c1508846a5ca2025-01-14T08:28:39ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2009-01-013013013574649553Modified shuffled frog-leaping algorithm to solve traveling salesman problemLUO Xue-huiYANG YeLI XiaModified shuffled frog-leaping algorithm to solve TSP was proposed,which presented the concept of adjustment sequence to design the strategy of local searching,and added the mutation operation in the global exchange of information.Experimental results indicate that,compared with genetic algorithm and particle swarm optimization algorithm,the proposed algorithm has more powerful search capability and more strong robustness in solving TSP.http://www.joconline.com.cn/zh/article/74649553/shuffled frog-leaping algorithmtraveling salesman problemlocal searchglobal information exchange |
| spellingShingle | LUO Xue-hui YANG Ye LI Xia Modified shuffled frog-leaping algorithm to solve traveling salesman problem Tongxin xuebao shuffled frog-leaping algorithm traveling salesman problem local search global information exchange |
| title | Modified shuffled frog-leaping algorithm to solve traveling salesman problem |
| title_full | Modified shuffled frog-leaping algorithm to solve traveling salesman problem |
| title_fullStr | Modified shuffled frog-leaping algorithm to solve traveling salesman problem |
| title_full_unstemmed | Modified shuffled frog-leaping algorithm to solve traveling salesman problem |
| title_short | Modified shuffled frog-leaping algorithm to solve traveling salesman problem |
| title_sort | modified shuffled frog leaping algorithm to solve traveling salesman problem |
| topic | shuffled frog-leaping algorithm traveling salesman problem local search global information exchange |
| url | http://www.joconline.com.cn/zh/article/74649553/ |
| work_keys_str_mv | AT luoxuehui modifiedshuffledfrogleapingalgorithmtosolvetravelingsalesmanproblem AT yangye modifiedshuffledfrogleapingalgorithmtosolvetravelingsalesmanproblem AT lixia modifiedshuffledfrogleapingalgorithmtosolvetravelingsalesmanproblem |