An improved Shuffled frog leaping Algorithm and its application

DOI

10.2991/ameii-15.2015.127How to use a DOI?

Keywords

Permutation flow shop scheduling problem; Improved Shuffled frog leaping algorithm; Machine fault conditions; Intelligent algorithms

Abstract

This paper proposes a shuffled frog leaping algorithm based on population diversity feedback. The algorithm is used to solve the Permutation flow shop scheduling problem, the results show that the improved shuffled frog leaping algorithm has reliable convergence, high convergence rate and solution precision.

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)

TY  - CONF
AU  - Guiying Mai
AU  - Yueguang Li
PY  - 2015/04
DA  - 2015/04
TI  - An improved Shuffled frog leaping Algorithm and its application
BT  - Proceedings of the International Conference on Advances in Mechanical Engineering and Industrial Informatics
PB  - Atlantis Press
SP  - 685
EP  - 688
SN  - 2352-5401
UR  - https://doi.org/10.2991/ameii-15.2015.127
DO  - 10.2991/ameii-15.2015.127
ID  - Mai2015/04
ER  -