Proceedings of the 2015 International Symposium on Computers & Informatics

An improved shuffled frog leaping algorithm and its application

Authors
Suonan Lengzhi, Yueguang Li
Corresponding Author
Suonan Lengzhi
Available Online January 2015.
DOI
10.2991/isci-15.2015.309How to use a DOI?
Keywords
Shuffled frog leaping algorithm; TSP; mutation operator; local search
Abstract

In order to enhance the performance of shuffled frog leaping algorithm in solving optimization problem, this paper added the mutation operator to original shuffled frog leaping algorithm, an improved shuffled frog-leaping algorithm of solving TSP was proposed. Simulation results show that the improved algorithm in the optimization accuracy, convergence speed and success rate had more than doubled to improve.

Copyright
© 2015, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

Volume Title
Proceedings of the 2015 International Symposium on Computers & Informatics
Series
Advances in Computer Science Research
Publication Date
January 2015
ISBN
10.2991/isci-15.2015.309
ISSN
2352-538X
DOI
10.2991/isci-15.2015.309How to use a DOI?
Copyright
© 2015, the Authors. Published by Atlantis Press.
Open Access
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Cite this article

TY  - CONF
AU  - Suonan Lengzhi
AU  - Yueguang Li
PY  - 2015/01
DA  - 2015/01
TI  - An improved shuffled frog leaping algorithm and its application
BT  - Proceedings of the 2015 International Symposium on Computers & Informatics
PB  - Atlantis Press
SP  - 2377
EP  - 2384
SN  - 2352-538X
UR  - https://doi.org/10.2991/isci-15.2015.309
DO  - 10.2991/isci-15.2015.309
ID  - Lengzhi2015/01
ER  -