Skip to main content
SpringerLink
Log in

Memetic algorithm with Preferential Local Search using adaptive weights for multi-objective optimization problems

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Evolutionary multi-objective optimization algorithms are generally employed to generate Pareto optimal solutions by exploring the search space. To enhance the performance, exploration by global search can be complemented with exploitation by combining it with local search. In this paper, we address the issues in integrating local search with global search such as: how to select individuals for local search; how deep the local search is performed; how to combine multiple objectives into single objective for local search. We introduce a Preferential Local Search mechanism to fine tune the global optimal solutions further and an adaptive weight mechanism for combining multi-objectives together. These ideas have been integrated into NSGA-II to arrive at a new memetic algorithm for solving multi-objective optimization problems. The proposed algorithm has been applied on a set of constrained and unconstrained multi-objective benchmark test suite. The performance was analyzed by computing different metrics such as Generational distance, Spread, Max spread, and HyperVolume Ratio for the test suite functions. Statistical test applied on the results obtained suggests that the proposed algorithm outperforms the state-of-art multi-objective algorithms like NSGA-II and SPEA2. To study the performance of our algorithm on a real-world application, Economic Emission Load Dispatch was also taken up for validation. The performance was studied with the help of measures such as Hypervolume and Set Coverage Metrics. Experimental results substantiate that our algorithm has the capability to solve real-world problems like Economic Emission Load Dispatch and is able to produce better solutions, when compared with NSGA-II, SPEA2, and traditional memetic algorithms with fixed local search steps.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  • Abido MA (2003) A niched pareto genetic algorithm for multiobjective environmental/economic dispatch. Int J Elec Power Energy Syst 25(2):97–105

    Article  Google Scholar 

  • Abido MA (2006) Multiobjective evolutionary algorithms for electric power dispatch problem. Evol Comput IEEE Trans 10(3):315–329

    Article  Google Scholar 

  • Abraham A (2005) Evolutionary computation., Handbook for measurement systems designWiley, London

    Book  Google Scholar 

  • Aguilar J, Miranda P (1999) Approaches based on genetic algorithms for multiobjective optimization problems. In: GECCO, pp 3–10

  • Bagchi TP (1999) Multiobjective scheduling by Genetic Algorithms. Springer

  • Balakrishnan S, Kannan PS, Aravindan C, Subathra P (2003) On-line emission and economic load dispatch using adaptive hopfield neural network. Appl Soft Comput 2(4):297–305

    Article  Google Scholar 

  • Basu M (2011) Economic environmental dispatch using multi-objective differential evolution. Appl Soft Comput 11(2):2845–2853

    Article  Google Scholar 

  • Bhuvana J, Aravindan C (2011a) Design of hybrid genetic algorithm with preferential local search for multiobjective optimization problems. In: Information technology and mobile communication, communications in computer and information science, vol 147. Springer, Berlin, pp 312–316

  • Bhuvana J, Aravindan C (2011b) Preferential local search with adaptive weights in evolutionary algorithms for multiobjective optimization problems. In: Soft computing and pattern recognition (SoCPaR), 2011 international conference of IEEE, pp 358–363

  • Blickle T (1996) Theory of evolutionary algorithms and application to system-synthesis. PhD thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland

  • Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv CSUR 35(3):268–308

    Article  Google Scholar 

  • Chen X, Ong YS, Lim MH, Tan KC (2011) A multi-facet survey on memetic computation. Evol Comput IEEE Trans 15(5):591–607

    Article  Google Scholar 

  • Cheng FY, Li D (1997) Multiobjective optimization design with pareto genetic algorithm. J Struct Eng 123(9):1252–1261

    Article  Google Scholar 

  • Coello CA (2000) An updated survey of GA-based multiobjective optimization techniques. ACM Comput Surv CSUR 32(2):109–143

    Article  Google Scholar 

  • Coello CA (2002) Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput Methods Appl Mech Eng 191(11–12):1245–1287

    Article  MathSciNet  MATH  Google Scholar 

  • Coello CA, Zacatenco CSP (2006) 20 years of evolutionary multi-objective optimization: what has been done and what remains to be done. Comput Intell Princ Pract Chap 4:73–88

    Google Scholar 

  • Črepinšek M, Liu SH, Mernik L (2012) A note on teaching–learning-based optimization algorithm. Inf Sci 212:79–93

    Article  Google Scholar 

  • Črepinšek M, Liu SH, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput Surv CSUR 45(3):1–33

    MATH  Google Scholar 

  • Črepinšek M, Liu SH, Mernik M (2014) Replication and comparison of computational experiments in applied evolutionary computing: common pitfalls and guidelines to avoid them. Appl Soft Comput 19:161–170

    Article  Google Scholar 

  • De Jong KA, Spears WM (1992) A formal analysis of the role of multi-point crossover in genetic algorithms. Ann Math Artif Intell 5(1):1–26

    Article  MATH  Google Scholar 

  • Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley (Asia) Pte Ltd

  • Deb K, Agrawal RB (1995) Simulated binary crossover for continuous search space. Complex Syst 9:115–148

    MathSciNet  MATH  Google Scholar 

  • Deb K, Kumar A (1995) Real-coded genetic algorithms with simulated binary crossover: studies on multi-modal and multi-objective problems. Complex Syst 9(6):431–454

    Google Scholar 

  • Deb K, Goyal M (1996) A combined genetic adaptive search (GeneAS) for engineering design. Comput Sci Inf 26:30–45

    Google Scholar 

  • Deb K, Agrawal S, Pratap A, Meyarivan T (2000) A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. Lect Notes Comput Sci 1917:849–858

  • Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. Evol Comput IEEE Trans 6(2):182–197

    Article  Google Scholar 

  • El-Mihoub TA, Hopgood AA, Nolle L, Battersby A (2006) Hybrid genetic algorithms: a review. Eng Lett 13(2):124–137

    Google Scholar 

  • Fogel DB (1995) Evolutionary computation: toward a new philosophy of machine intelligence. IEEE Press, Piscataway

    MATH  Google Scholar 

  • Fonseca CM, Fleming PJ (1993) Genetic algorithms for multiobjective optimization: formulation, discussion and generalization. ICGA 93:416–423

    Google Scholar 

  • Fonseca CM, Fleming PJ (1995) An overview of evolutionary algorithms in multiobjective optimization. Evol Comput 3(1):1–16

  • Gaspero LD (2003) Local search techniques for scheduling problems: algorithms and software tools. PhD thesis, Dipartimento di Matematica e Informatica-Università degli Studi di Udine

  • Gen M, Lin L (2005) Multi-objective hybrid genetic algorithm for bicriteria network design problem. Complex Int 11(11):73–83

    Google Scholar 

  • Glover F, Laguna M (1997) Tabu Search. Kluwer

  • Goldberg DE (1989) genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading

  • Guliashki V, Toshev H, Korsemov C (2009) Survey of evolutionary algorithms used in multiobjective optimization. Prob Eng Cybern Robot 60:42–54

    MathSciNet  Google Scholar 

  • Hajela P, Lin CY (1992) Genetic search strategies in multicriterion optimal design. Struct Optim 4(2):99–107

    Article  Google Scholar 

  • Hamada N, Nagata Y, Kobayashi S, Ono I (2010) Adaptive weighted aggregation: a multiobjective function optimization framework taking account of spread and evenness of approximate solutions. In: Evolutionary computation (CEC), 2010 IEEE Congress on, pp 1–8

  • Hamada N, Nagata Y, Kobayashi S, Ono I (2011) Adaptive weighted aggregation 2: more scalable AWA for multiobjective function optimization. In: Evolutionary computation (CEC), 2011 IEEE congress on, pp 2375–2382

  • Herrera F, Lozano M, Verdegay JL (1998) Tackling real-coded genetic algorithms: operators and tools for behavioural analysis. Artif Intell Rev 12(4):265–319

    Article  MATH  Google Scholar 

  • Herrera F, Lozano M, Sánchez AM (2003) A taxonomy for the crossover operator for real-coded genetic algorithms: an experimental study. Int J Intell Syst 18(3):309–338

    Article  MATH  Google Scholar 

  • Holland JH (1975) Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. U Michigan Press

  • Horn J, Nafpliotis N, Goldberg DE (1994) A niched pareto genetic algorithm for multiobjective optimization. In: Evolutionary computation, 1994. IEEE world congress on computational intelligence., Proceedings of the first IEEE conference on, pp 82–87

  • Huband S, Hingston P, Barone L, While L (2006) A review of multiobjective test problems and a scalable test problem toolkit. Evol Comput IEEE Trans 10(5):477–506

    Article  MATH  Google Scholar 

  • Jang JSR, Sun CT, Mizutani E (2004) Neuro-fuzzy and soft computing. PHI, Pearson Education, New Delhi

    Google Scholar 

  • Jiang S, Cai Z, Zhang J, Ong YS (2011) Multiobjective optimization by decomposition with pareto-adaptive weight vectors. In: Natural computation (ICNC), 2011 seventh international conference on, IEEE, vol 3. pp 1260–1264

  • Joines JA, Gupta D, Gokce MA, King RE, Kay MG (2002) Manufacturing supply chain applications 1: supply chain multi-objective simulation optimization. In: Proceedings of the 34th conference on winter simulation: exploring new frontiers, winter simulation conference, WSC ’02, pp 1306–1314

  • Jubril AM (2012) A nonlinear weights selection in weighted sum for convex multiobjective optimization. Facta Univ Ser Math Inf 27(3):357–372

    MathSciNet  MATH  Google Scholar 

  • Kim IY, De Weck O (2005) Adaptive weighted-sum method for bi-objective optimization: pareto front generation. Struct Multidis Optim 29(2):149–158

    Article  Google Scholar 

  • Knowles JD, Corne DW (2000) Approximating the nondominated front using the pareto archived evolution strategy. Evol Comput 8(2):149–172

    Article  Google Scholar 

  • Konak A, Coit DW, Smith AE (2006) Multi-objective optimization using genetic algorithms: a tutorial. Reliab Eng Syst Saf 91(9):992–1007

    Article  Google Scholar 

  • Koski J (1988) Multicriteria truss optimization. Multicriteria optimization in engineering and in the sciences. Springer, US, pp 263–307

    Chapter  Google Scholar 

  • Krasnogor N, Smith J (2005) A tutorial for competent memetic algorithms: model, taxonomy, and design issues. Evol Comput IEEE Trans 9(5):474–488

    Article  Google Scholar 

  • Li H, Landa-Silva D (2008) Evolutionary multi-objective simulated annealing with adaptive and competitive search direction. In: Evolutionary computation, 2008. CEC 2008. (IEEE World congress on computational intelligence). IEEE congress on, pp 3311–3318

  • McGinley B, Maher J, O’Riordan C, Morgan F (2011) Maintaining healthy population diversity using adaptive crossover, mutation, and selection. Evol Comput IEEE Trans 15(5):692–714

    Article  Google Scholar 

  • Mongus D, Repnik B, Mernik M, Žalik B (2012) A hybrid evolutionary algorithm for tuning a cloth-simulation model. Appl Soft Comput 12(1):266–273

    Article  Google Scholar 

  • Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech concurrent computation program, C3P. Report 826:1989

    Google Scholar 

  • Mostaghim S (2004) Multi-objective evolutionary algorithms. Data structures, convergence, and diversity. PhD thesis, University of Paderborn, Germany

  • Nelder JA, Mead R (1965) A simplex method for function minimization. Comput J 7(4):308–313

  • Nguyen TT, Yang S, Branke J (2012) Evolutionary dynamic optimization: a survey of the state of the art. Swarm Evol Comput 6:1–24

    Article  Google Scholar 

  • Ong YS, Lim MH, Zhu N, Wong KW (2006) Classification of adaptive memetic algorithms: a comparative study. Syst Man Cybern Part B Cybern IEEE Trans 36(1):141–152

    Article  Google Scholar 

  • Ong YS, Lim M, Chen X (2010) Memetic computation: past, present and future [Research Frontier]. Comput Intell Mag IEEE 5(2):24–31

    Article  Google Scholar 

  • Runarsson T, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. Evol Comput IEEE Trans 4(3):284–294

    Article  Google Scholar 

  • Salomon R (1998) Evolutionary algorithms and gradient search: similarities and differences. Evol Comput IEEE Trans 2(2):45–55

    Article  Google Scholar 

  • Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of the 1st international conference on genetic algorithms, L. Erlbaum Associates Inc., pp 93–100

  • Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221–248

  • Steuer RE (1986) Multiple criteria optimization: theory., Computation and applicationWiley, New York

  • Talaq J, El-Hawary F, El-Hawary M (1994) A summary of environmental/economic dispatch algorithms. Power Syst IEEE Trans 9(3):1508–1516

    Article  Google Scholar 

  • Van Veldhuizen DA (1999) Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. PhD thesis, Air Force Institute of Technology, Wright Patterson AFB, OH, USA

  • Van Veldhuizen DA, Lamont GB (1999) Multiobjective evolutionary algorithm test suites. In: Proceedings of the 1999 ACM symposium on Applied computing, New York, USA, SAC ’99, pp 351–357

  • Veček N, Mernik M, Črepinšek M (2014) A chess rating system for evolutionary algorithms: a new method for the comparison and ranking of evolutionary algorithms. Inf Sci 277:656–679

    Article  MathSciNet  Google Scholar 

  • Weise T (2009) Global optimization algorithms: theory and application, 2nd edn. Self-Published

  • Wood AJ, Wollenberg BF (2011) Power generation, operation, and control. Wiley, New Delhi

    Google Scholar 

  • Zadeh L (1963) Optimality and non-scalar-valued performance criteria. Autom Control IEEE Trans 8(1):59–60

    Article  Google Scholar 

  • Zhou A, Qu BY, Li H, Zhao SZ, Suganthan PN, Zhang Q (2011) Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm Evol Comput 1(1):32–49

    Article  Google Scholar 

  • Zitzler E (1999) Evolutionary algorithms for multiobjective optimization: methods and applications. PhD thesis, ETH Zurich, Switzerland

  • Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. Evol Comput IEEE Trans 3(4):257–271

    Article  Google Scholar 

  • Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8(2):173–195

    Article  Google Scholar 

  • Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength pareto evolutionary algorithm for multiobjective optimization. In: Evolutionary methods for design optimization and control with applications to industrial problems, pp 95–100

Download references

Acknowledgments

We would like to thank the management of SSN College of Engineering for funding the High Performance Computing Lab (HPC Lab) where this research was carried out. We also express our sincere thanks to K.Kannan, Dean, SASTRA University, Thanjavur, India, for his valuable suggestions in statistical analysis. We thank the anonymous reviewers for their valuable comments in improving the quality of the paper.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, SSN College of Engineering, Kalavakkam, Chennai, 603110, India

    J. Bhuvana & Chandrabose Aravindan

Authors
  1. J. Bhuvana
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chandrabose Aravindan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. Bhuvana.

Additional information

Communicated by V. Loia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bhuvana, J., Aravindan, C. Memetic algorithm with Preferential Local Search using adaptive weights for multi-objective optimization problems. Soft Comput 20, 1365–1388 (2016). https://doi.org/10.1007/s00500-015-1593-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-015-1593-9

Keywords

Search

Navigation