LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:

OpenAIRE is about to release its new face with lots of new content and services.
During September, you may notice downtime in services, while some functionalities (e.g. user registration, login, validation, claiming) will be temporarily disabled.
We apologize for the inconvenience, please stay tuned!
For further information please contact helpdesk[at]openaire.eu

fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Sun, Jianyong; Garibaldi, Jonathan M.; Zhang, Yongquan; Al-Shawabkeh, Abdallah (2016)
Publisher: Elsevier
Languages: English
Types: Article
Subjects:
In this paper, we propose a multi-cycled sequential memetic computing structure for constrained optimisation. The structure is composed of multiple evolutionary cycles. At each cycle, an evolutionary algorithm is considered as an operator, and connects with a local optimiser. This structure enables the learning of useful knowledge from previous cycles and the transfer of the knowledge to facilitate search in latter cycles. Specifically, we propose to apply an estimation of distribution algorithm (EDA) to explore the search space until convergence at each cycle. A local optimiser, called DONLP2, is then applied to improve the best solution found by the EDA. New cycle starts after the local improvement if the computation budget has not been exceeded. In the developed EDA, an adaptive fully-factorized multivariate probability model is proposed. A learning mechanism, implemented as the guided mutation operator, is adopted to learn useful knowledge from previous cycles.\ud \ud The developed algorithm was experimentally studied on the benchmark problems in the CEC 2006 and 2010 competition. Experimental studies have shown that the developed probability model exhibits excellent exploration capability and the learning mechanism can significantly improve the search efficiency under certain conditions. The comparison against some well-known algorithms showed the superiority of the developed algorithm in terms of the consumed fitness evaluations and the solution quality.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • 530 [1] Aguirre, A., Rionda, S., Coello, C., and Liza´rraga, G. (2003). Use of Multiobjective Optimization Concepts to Handle Constraints in Genetic Algorithms, volume 2723 of Lecture Notes in Computer Science, pages 573-584. Springer.
    • [4] Bonyadi, M., Li, X., and Michalewicz, Z. (2014). A hybrid particle swarm with a time-adaptive topology for constrained optimization. Swarm and Evolutionary Computation, 18:22-37.
    • [5] Bosman, P. A. N. and Thierens, D. (2000). Expanding from discrete to continuous estimation of distribution algorithms: The IDEA. In Schoenauer, M., Deb, K., Rudolph, G., Yao, X., Lutton, E., Merelo, J. J., and Schwefel, H.-P., editors, Parallel Problem Solving from Nature - PPSN VI. Lecture Notes in Computer Science 1917, pages 767-776.
    • [6] Brest, J., Zumer, V., and Mauc´ec, M. (2006). Self-adaptive differential evolution algorithm in constrained real-parameter optimization. In Proceedings of the 2006 IEEE Congress on Evolutionary Computation, pages 215 - 222, Vancouver, BC, Canada.
    • 550 [7] Caraffini, F., Neri, F., and Picinali, L. (2014). An analysis on separability for memetic computing automatic design. Information Sciences, 265:1-22.
    • [8] Chen, X., Ong, Y.-S., Lim, M., and Tan, K. (2011). A multi-facet survey on memetic computation. IEEE Transactions on Evolutionary Computation, 15(5):591-607.
    • 555 [9] Chung, C.-J. and Reynolds, R. (1996). A testbed for solving optimization problems using culture algorithms. In Evolutionary Programming V: Proceedings of the Fifth Annual Conference on Evolutionary Programming, pages 225-236, Cambridge, Massachusetts. MIT Press.
    • [10] Datta, R. and Deb, K. (2015). Evolutionary Constrained Optimization. Springer.
    • 560 [11] Deb, K. and Datta, R. (2010). A fast and accurate solution of constrained optimization problems using a hybrid bi-objective and penalty funcation approach. In Proceedings of the 2010 IEEE Congress on Evolutionary Computation, pages 1-8, Barcelona. IEEE.
    • [12] Deb, K., Sinha, A., and Aravind, S. (2006). A population-based, parent centric procedure for constrained real-parameter optimization. In Proceedings of the
    • [13] Dhadwal, M., Jung, S., and Kim, C. (2014). Advanced particle swarm assisted genetic algorithm for constrained optimization problems. Comput Optim Appl, 58:781-806.
    • [14] Dong, N. and Wang, Y. (2014). A memetic differential evolution algorithm based on dynamic preference for constrained optimization problems. Journal of Applied Mathematics. http://www.hindawi.com/journals/jam/2014/606019/.
    • [15] Glover, F. and Laguna, M. (1997). Tabu Search. Kluwer Academic Publisher, Norwell, MA.
    • [16] Grahl, J. and Rothlauf, F. (2004). PolyEDA: Combining estimation of distribution algorithms and linear inequality constraints. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 1174-1185.
    • [17] Gu, B., Sheng, V., Tay, K., Romano, W., and Li, S. (2015a). Incremental support vector learning for ordinal regression. IEEE Transactions on Neural Networks and Learning Systems, 26(7):1403-1416.
    • [18] Gu, B., Sheng, V., Wang, Z., Ho, D., Osman, S., and Li, S. (2015b). Incremental learning for -support vector regression. Neural Networks, 67:140-150.
    • [19] Hamza, N., Sarker, R., Essam, D., Deb, K., and Elsayed, S. (2014). A constraint consensus memetic algorithm for solving constrained optimization problems. Engineering Optimization, 46(11):1447-1464.
    • [20] He, X., Liu, C., Dong, H., Pan, J., and Yan, Q. (2014). Particle swarm optimization-based augmented Lagrangian algorithm for constrained optimization problems. Journal of Software Engineering, 8(3):169-183.
    • 590 [21] Ho, P. and Shimizu, K. (2007). Evolutionary constrained optimization using an addition of ranking method and a percentage-based tolerance value adjustment scheme. Information Sciences, 177:2985-3004.
    • [22] Homaifar, A., Qi, C., and Lai, S. (1994). Constrained optimization via genetic algorithms. Simulation, 62(4):242-253.
    • 595 [23] Hu, Z., Cai, X., and Fan, Z. (2014). An improved memetic algorithm using ring neighbourhodd topology for constrained optimization. Soft Computing, 18:2023- 2041.
    • [24] Huang, V., Qin, A., and Suganthan, P. (2006). Self-adaptive differential evolution algorithm for constrained real-parameter optimization. In Proceedings of the 2006 IEEE Congress on Evolutionary Computation, pages 17-24, Vancouver, BC, Canada.
    • [25] Iacca, G., Neri, F., Mininno, E., Ong, Y.-S., and Lim, M. H. (2012). Ockham's razor in memetic computing: Three stage optimal memetic exploration. Information Sciences, 188:17-43.
    • 605 [26] Jiao, L., Li, L., Shang, R., Liu, F., and Stolkin, R. (2013a). A novel selection evolutionary strategy for constrained optimization. Information Sciences, 239:122- 141.
    • [31] Liang, J., Runarsson, T., Mezura-Montes, E., Clerc, M., Suganthan, P., Coello, C., and Deb, K. (2006). Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization. Technical report, Nanyang Technological University, Sigapore.
    • [32] Liang, J. and Suganthan, P. (2006). Dynamic multi-swarm particle swarm optimizer with a novel constraint-handling mechanism. In Proceedings of the 2006 IEEE Congress on Evolutionary Computation, pages 124-129, Vancouver, BC, Canada.
    • [33] Lin, C.-H. (2013). A rough penalty genetic algorithm for constrained optimization. Information Sciences, 241:119-137.
    • [34] Lin, J.-Y. and Chen, Y.-P. (2011). Analysis on the collaboration between global search and local search in memetic computation. IEEE Transactions on Evolutionary Computation, 15(5):608-623.
    • [35] Lin, J.-Y. and Chen, Y.-P. (2012). When and what kind of memetic algorithms perform well. In Proceedings of the 2012 IEEE World Congress on Computational Intelligence, pages 1-8. IEEE.
    • 635 [36] Maesani, A., Fernando, P., and Floreano, D. (2014). Artificial evolution by viability rather than competition. PLoS ONE, 9(1):e86831.
    • [37] Maesani, A. and Floreano, D. (2014). Viability principles for constrained optimization using a (1+1)-CMA-ES. In Parallel Problem Solving from Nature, volume 8672, pages 272-281.
    • 640 [38] Maesani, A., Iacca, G., and Floreano, D. (2015). Memetic viability evolution for constrained optimization. IEEE Transactions on Evolutionary Computation, PP(99). DOI 10.1109/TEVC.2015.2428292.
    • [39] Mallipeddi, R. and Suganthan, P. (2010a). Ensemble of constraint handling techniques. IEEE Transactions on Evolutionary Computation, 14(4):561-579.
    • [41] Mezura-Montes, E., editor (2009). Constraint-Handling in Evolutionary Optimization, volume 198 of Studies in Computational Intelligence Series. Springer.
    • 650 [42] Mezura-Montes, E., Vela´zquez-Reyes, J., and Coello, C. C. (2006). Modified differential evolution for constrained optimization. In Proceedings of the 2006 IEEE Congress on Evolutionary Computation, pages 25-32, Vancouver, BC, Canada.
    • [60] Takahama, T. and Sakai, S. (2006). Constrained optimization by the " constrained differential evolution with gradient-based mutation and feasible elites. In Proceedings of the 2006 IEEE Congress on Evolutionary Computation, pages 308-315, Vancouver, BC, Canada.
    • [61] Tasgetiren, M. F. and Suganthan, P. (2006). A multi-populated differential evolution algorithm for solving constrained optimization problems. In Proceedings of the 2006 IEEE Congress on Evolutionary Computation, pages 33 - 40, Vancouver, BC, Canada.
  • Inferred research data

    The results below are discovered through our pilot algorithms. Let us know how we are doing!

    Title Trust
    55
    55%
    61
    61%
  • No similar publications.

Share - Bookmark

Funded by projects

Cite this article

Cookies make it easier for us to provide you with our services. With the usage of our services you permit us to use cookies.
More information Ok