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...
| 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/ |