Parallel line-up competition algorithm for continuous optimization

Applied Mechanics and Materials

Volumn 20-23, Issue , 2010, Pages 161-166

  Shi, Bin ^a   Yan, Liexiang ^a   Xie, Hui ^a  

^a WUHAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Coarse grained model; Continuous optimization; Evolutionary algorithm; Parallel line up competition algorithm

Indexed keywords

EVOLUTIONARY ALGORITHMS; MANUFACTURE;

COARSE GRAINED MODELS; COARSE-GRAINED PARALLELS; CONTINUOUS OPTIMIZATION; CONTINUOUS OPTIMIZATION PROBLEMS; MIGRATION TOPOLOGY; PARALLEL EFFICIENCY; PARALLEL LINE; SINGLE PROCESSORS;

OPTIMIZATION;

EID: 76449083773     PISSN: 16609336     EISSN: 16627482     Source Type: Book Series    
DOI: 10.4028/www.scientific.net/AMM.20-23.161     Document Type: Conference Paper

References (14)

1. L.X. Yan, D.X. Ma: Global optimization of nonconvex nonlinear programs using line-up competition algorithm, Comput. Chem. Eng, Vol.25 (2001), p.1601. doi:10.1016/S0098-1354(01)00725-6
2. L.X. Yan: Solving Combinatorial Optimization Problems with Line-up Competition Algorithm, Comput. Chem. Eng, Vol. 27 (2003), p.251. doi:10.1016/S0098-1354(02)00194-1
3. L.X. Yan, K. Shen and S.H. Hu: Solving mixed integer nonlinear programming problems with line-up competition algorithm, Comput. Chem. Eng, Vol.28 (2004), p.2647. doi:10.1016/j.compchemeng.2004.07.027
4. E. Cantú-Paz: A survey of parallel genetic algorithm, Caclulateurs Paralleles, Vol.10 (1998), p. 141.
5. E. Alba, F. Luna, A.J. Nebro, et al.: Parallel heterogeneous genetic algorithms for continuous optimization, Parallel. Comput, Vol.30 (2004), p.699. doi:10.1016/j.parco.2003.12.011
6. D.J. Ram, T.H. Sreenivas and K.G. Subramaniam: Parallel Simulated Annealing Algorithms, J. Parallel Distrib. Comput, Vol.37 (1996), p.207. doi:10.1006/jpdc.1996.0121
7. E. Onbasoglu, L. Ozdamar: Parallel Simulated Annealing Algorithms in Global Optimization, J.Global.Optim, Vol.19 (2001), p. 27. doi:10.1023/A: 1008350810199
8. J.F. Schutte, J.A. Reinbolt, B.J. Fregly, et al.: Parallel global optimization with particle swarm algorithm, Int. J. Numer. Methods Eng, Vol.61 (2004), p. 2296. doi:10.1002/nme.1149 PMid:17891226 PMCid:1989676
9. B.I. Koh, A.D. George, R.T. Haftka, et al.: Parallel asynchronous particle swarm optimization, Int. J. Numer. Methods Eng, Vol.67 (2006), p.578. doi:10.1002/nme.1646 PMid:17224972 PMCid:1769316
10. Z.G. Wang, Y.S. Wong and M Rahman: Development of a parallel optimization method based on genetic simulated annealing algorithm, Parallel. Comput, Vol.31 (2005), p. 839.
11. P. Adamidis: Parallel evolutionary algorithms: a review, in: 4th Hellenic-European Conference on Computer Mathematics and Its Applications, Athens, Greece, 1998.
12. B. Liu, L. Wang and Y.H. Jin, et al.: Improved particle swarm optimization combined with chaos, Chaos, Solitons & Fractals, Vol. 25 (2005), p. 1261. doi:10.1016/j.chaos.2004.11.095
13. K. E. Parsopoulos, M. N. Vrahatis: Recent Approaches to Global Optimization Problems through Particle Swarm Optimization, Nat. Comput, Vol.1 (2002), p.235. doi:10.1023/A:1016568309421
14. E. Alba: Parallel evolutionary algorithms can achieve super-linear performance, Inf. Process. Lett, Vol.82 (2002), p. 7. doi:10.1016/S0020-0190(01) 00281-2