[1]
Reingold. E. M. J. Neivergelt and N. Deo. Combinatorial Algorithms: Theory and practice Prentice-Hall , Englewood cliffs, NJ(1977).
Google Scholar
[2]
Garey M R, Johnson D S, Sethi R. The complexity of floe shop and job shop scheduling[J]. Mathematics of operations research, 1976, 1(2): 117-129.
Google Scholar
[3]
Krishnanand K N，Ghose D． Detection of multiple source locations using a glowworm metaphor with applications to collective robotics［C］/ /Proc of IEEE Swarm Intelligence Symposium． Piscataway: IEEE Press， 2005: 84-91.
DOI: 10.1109/sis.2005.1501606
Google Scholar
[4]
Yang Xinshe． Nature inspired meta heuristic algorithms［M］．［S．l． ］: Luniver Press， 2008: 83-96.
Google Scholar
[5]
Yang Xinshe． Firefly algorithms for multimodal optimization［C］/ /Proc of the 5th International Symposium on Stochastic Algorithms: Foundations and Applications．2009: 169-178.
DOI: 10.1007/978-3-642-04944-6_14
Google Scholar
[6]
Yang Xinshe， DEB S． Eagle strategy using lévy walk and firefly algorithms for stochasticoptimization［J］． Studies in Computational Intelligence， 2010， 284: 101-111.
DOI: 10.1007/978-3-642-12538-6_9
Google Scholar
[7]
Yang Xinshe. Firefly algorithms for multimodal optimization[C]/Proceedings of the 5th International Conference on Stochastic Algorithms: Foundations and Applications. Berlin/Heidelberg, Germany: Springer-Verlag, 2009: 169-178.
DOI: 10.1007/978-3-642-04944-6_14
Google Scholar
[8]
Brown C T, Liebovitch L S, Glendon R. Lévy flights in Dobe Ju' hoansi foraging patterns[J]. Human Ecology, 2007, 35(1): 129-138.
DOI: 10.1007/s10745-006-9083-4
Google Scholar
[9]
Watson J P. Contrasting structured and random permutation flow shop scheduling problems: search space topology and algorithm performance[J]. ORSA journal of computing, 2002, 14(2): 98-123.
DOI: 10.1287/ijoc.14.2.98.120
Google Scholar
