Skip to main content
SpringerLink
Log in

Simulated annealing-based immunodominance algorithm for multi-objective optimization problems

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

Based on the simulated annealing strategy and immunodominance in the artificial immune system, a simulated annealing-based immunodominance algorithm (SAIA) for multi-objective optimization (MOO) is proposed in this paper. In SAIA, all immunodominant antibodies are divided into two classes: the active antibodies and the hibernate antibodies at each temperature. Clonal proliferation and recombination are employed to enhance local search on those active antibodies while the hibernate antibodies have no function, but they could become active during the following temperature. Thus, all antibodies in the search space can be exploited effectively and sufficiently. Simulated annealing-based adaptive hypermutation, population pruning, and simulated annealing selection are proposed in SAIA to evolve and obtain a set of antibodies as the trade-off solutions. Complexity analysis of SAIA is also provided. The performance comparison of SAIA with some state-of-the-art MOO algorithms in solving 14 well-known multi-objective optimization problems (MOPs) including four many objectives test problems and twelve multi-objective 0/1 knapsack problems shows that SAIA is superior in converging to approximate Pareto front with a standout distribution.

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
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23

Similar content being viewed by others

References

  1. Bandyopadhyay S, Saha S, Maulik U, Deb K (2008) A simulated annealing based multi-objective optimization algorithm: AMOSA. IEEE Trans Evol Comput 12(3):269–283

    Article  Google Scholar 

  2. Burke EK, Landa Silva JD (2006) The influence of the fitness evaluation method on the performance of multiobjective search algorithms. Eur J Oper Res 169(3):875–897

    Article  MathSciNet  MATH  Google Scholar 

  3. Burnet FM (1959) The clonal selection theory of acquired immunity. Cambridge University Press, Cambridge

    Book  Google Scholar 

  4. Coello Coello CA (2003) Evolutionary multi-objective optimization: current and future challenges. Advances in soft computing. Springer, London, pp 243–256

    Chapter  Google Scholar 

  5. Coello Coello CA, Cortss NC (2005) Solving multi-objective optimization problems using an artificial immune system. Genet Program Evol Mach 6:163–190

    Article  Google Scholar 

  6. Coello Coello CA, Van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving multi-objective problems. Kluwer, Norwell

    Book  MATH  Google Scholar 

  7. Corne DW, Jerram NR, Knowles JD, Oates, MJ (2001) PESA-II: region-based selection. In: Proceedings of the third annual congress on genetic and evolutionary computation conference (GECCO2001), pp 283–290

  8. Cutello V, Nicosia G, Pavone M (2004) Exploring the capability of immune algorithms: A characterization of hypermutation operators. In: Nicosia G, Cutello V, Bentley PJ, Timmis J (eds) International conference on artificial immune systems (ICARIS2004). ICARIS 2004. Artificial immune systems, Springer, Berlin, pp 263–276

  9. Czyzak P, Jaszkiewicz A (1998) Pareto simulated annealing—a metaheuristic technique for multiple-objective combinatorial optimization. Multi Criteria Decision Anal 7:34–47

    Article  MATH  Google Scholar 

  10. De Castro LN, Von Zuben FJ (2002) Learning and optimization using the clonal selection principle. IEEE Trans Evol Comput 6(3):239–251

    Article  Google Scholar 

  11. Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, New York

    MATH  Google Scholar 

  12. Deb K, Jain H (2013) An evolutionary many-objective optimization algorithm using reference-point based non-dominated sorting approach, Part I: solving problems with box constraints. IEEE Trans Evol Comput 18(4):577–601

    Article  Google Scholar 

  13. Deb K, Jain S (2002) Running performance metrics for evolutionary multi-objective optimization Technical Report. Indian Institute of Technology Kanpur, Kanpur

    Google Scholar 

  14. Deb K, Pratap A, Agarwal S et al (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  15. Deb K, Thiele L, Laumanns M, Zitzler E (2002) Scalable multi-objective optimization test problems. In: Proceedings of the Congress on Evolutionary Computation (CEC2002), pp 825–830

  16. Fonseca CM, Fleming PJ (1993) Genetic algorithms for multiobjective optimization: formulation, discussion and generalization. In: Forrest S (ed) Proceedings of the 5th international conference on genetic algorithms. Morgan Kaufmann, San Mateo, CA, pp 416–423

  17. French DL, Laskov R, Scharff MD (1989) The role of somatic hypermutation in the generation of antibody diversity. Science 244(4909):1152–1157

    Article  Google Scholar 

  18. Freschi F, Repetto M (2005) Multi-objective optimization by a modified artificial immune system algorithm. Lect Notes Comput Sci 3627:248–261

    Article  Google Scholar 

  19. Garrett SM (2005) How do we evaluate artificial immune systems? Evol Comput 13(2):145–178

    Article  Google Scholar 

  20. Geman S, Gelatt C (1984) Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images. IEEE Trans Pattern Anal Mach Intell 6(6):721–741

    Article  MATH  Google Scholar 

  21. Goh CK, Ong YS, Tan KC (2008) An investigation on evolutionary gradient search for multi-objective optimization. In: IEEE world congress on computational intelligence, pp 3741–3746

  22. Gong MG, Jiao LC, Du HF, Bo LF (2008) multi-objective immune algorithm with nondominated neighbor-based selection. Evol Comput 16(2):225–255

    Article  Google Scholar 

  23. Gong MG, Jiao LC, Ma WP, Du HF (2008) Multi-objective optimization using an immunodominance and clonal selection inspired algorithm. Sci China Ser F Inf Sci 51(8):1064–1082

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  25. Han JW, Kamber M (2000) Data mining: concept and techniques. Morgan Kaufman Publishers, Vermont

    Google Scholar 

  26. Hapke M, Jaszkiewicz A, Slowinski R (2000) Pareto simulated annealing for fuzzy multi-objective combinatorial optimization. Heuristics 6(3):329–345

    Article  MATH  Google Scholar 

  27. Horn J, Nafpliotis PJ (1993) Genetic algorithms using the niched pareto genetic algorithm. IlliGAL Report 93005, Illinois Genetic Algorithms Laboratory, University of Illinois, Urbana, Champaign

  28. Huang HC, Pan JS, Luc ZM, Sunc SH, Hanga HM (2001) Vector quantization based on genetic simulated annealing. Sig Process 81(7):1513–1523

    Article  Google Scholar 

  29. Jerne NK (1974) Towards a network theory of the immune system. Ann Immunol 125C(1–2):373–389

    Google Scholar 

  30. Jiang H, Zhang XC, Chen GL (2007) Directed black and white traveling salesman problem. Chin J Comput 30(3):431–439

  31. Jiao LC, Gong MG, Shang RH, Du HF, Lu B (2005) Clonal selection with immune dominance and energy based multi-objective optimization. In: Proceedings of the third international conference on evolutionary multi-criterion optimization volume 3410 of Lecture Notes in Computer Science, pp 474–489

  32. Khare V, Yao X, Deb K (2003) Performance scaling of multi-objective evolutionary algorithms. In: Proceeding of the second international conference on evolutionary multi-criterion optimization (EMO2003), Faro, Portugal, pp 376–390, 8–11 Apr 2003

  33. Kirkpatrick S, Gelatt C, Vecchi M (1983) Optimization by simulated annealing. Science 22:671–680

    Article  MathSciNet  MATH  Google Scholar 

  34. Knowles J, Corne D, Deb K (2008) Multi-objective problem solving from nature. Springer, New York

    Book  MATH  Google Scholar 

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

    Article  Google Scholar 

  36. Li H, Landa Silva D (2008) Evolutionary multi-objective simulated annealing with adaptive and competitive search direction. In: IEEE congress on evolutionary computation (CEC2008), pp 3310–3317, 1–6 June 2008

  37. Li H, Zhang QF (2009) Multi-objective optimization problems with complicated Pareto Sets, MOEA/D and NSGAII. IEEE Trans Evol Comput 13(2):284–302

    Article  Google Scholar 

  38. McGill R, Tukey JW, Larsen WA (1978) Variations of boxplots. Am Stat 32(1):12–16

    Google Scholar 

  39. Moura A, Rui R, Silva P, Crespo S (2010) A multi-objective genetic algorithm applied to autonomous underwater vehicles for sewage outfall plume dispersion observations. Appl Soft Comput 10:1119–1126

    Article  Google Scholar 

  40. Schaffer JD (1984) Multiple objective optimization with vector evaluated genetic algorithms. Ph.D. thesis, Nashville, TN: Vanderbilt University

  41. Schott JR (1995) Fault tolerant design using single and multicriteria genetic algorithm optimization [MS. Thesis]. Cambridge: Massachusetts Institute of Technology

  42. Serafini P (1994) Simulated annealing for multiple objective optimization problems. In: Proceedings of the 10th international conference on multiple criteria decision making. Berlin: Springer, pp 283–294

  43. Smith K, Everson R, Fieldsend J (2004) Dominance measures for multi-objective simulated annealing. In: IEEE congress on evolutionary computation (CEC2004), pp 23–30

  44. Smith K, Everson R, Fieldsend J, Murphy C, Misra R (2008) Dominance-based multiobjective simulated annealing. IEEE Trans Evol Comput 12(3):323–342

    Article  Google Scholar 

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

    Article  Google Scholar 

  46. Suman B (2005) Study of self-stopping PDMOSA and performance measure in multi-objective optimization. Comput Chem Eng 29(5):1131–1147

    Article  Google Scholar 

  47. Suman B, Kumar P (2006) A survey of simulated annealing as a tool for single and multiobjective optimization. J Oper Res Soc 57(10):1143–1160

    Article  MATH  Google Scholar 

  48. Suppapitnarm A, Seffen KA, Parks GT, Clarkson P (2000) A simulated annealing algorithm for multi-objective optimization. Eng Optim 33:59–85

    Article  Google Scholar 

  49. Tarakanov A, Dasgupta D (2000) A formal model of an artificial immune system. BioSystems 55(1/3):151–158

    Article  Google Scholar 

  50. Ulungu E, Teghem J, Fortemps P, Tuyttens D (1999) MOSA method: a tool for solving multiobjective combinatorial optimization problems. J Multi Crit Dec Anal 8(4):221–236

    Article  MATH  Google Scholar 

  51. Yewdell JW, Bennink JR (1999) Immunodominance in major histocompatibility complex class I-restricted T lymphocyte responses. Annu Rev Immunol 17:51–88

    Article  Google Scholar 

  52. Yoo J, Hajela P (1999) Immune network simulations in multicriterion design. Struct Optim 18:85–94

    Article  Google Scholar 

  53. Zhang QF, Li H (2007) MOEA/D: a multi-objective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731

    Article  Google Scholar 

  54. Zhao SZ, Suganthan PN, Zhang QF (2012) MOEA/D with an ensemble of neighborhood sizes. IEEE Trans Evol Comput 16(3):442–446

    Article  Google Scholar 

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

    Article  Google Scholar 

  56. Zitzler E, Laumanns M, Thiele L (2002) SPEA2: improving the strength Pareto evolutionary algorithm. In: Evolutionary methods for design, optimization and control with applications to industrial problems, Athens, Greece, pp 95–100

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

    Article  Google Scholar 

  58. Zitzler E, Thiele L, Laumanns M, Fonseca CM, Fonseca VGD (2003) Performance assessment of multi-objective optimizers: an analysis and review. IEEE Trans Evol Comput 7(2):117–132

    Article  Google Scholar 

Download references

Acknowledgements

The authors would like to thank the editor and the reviewers for helpful comments that greatly improved the paper. We gratefully acknowledge our colleague, Prof. J Liu, who helps us to modify and polish English writing. This work was supported by the National Natural Science Foundation of China (No. 61373111); the Fundamental Research Funds for the Central University (Nos. K50511020014, K5051302084, JB150227); the Provincial Natural Science Foundation of Shaanxi of China (No. 2014JM8321).

Author information

Authors and Affiliations

  1. Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China, Xidian University, Xi’an, 710071, China

    Ruochen Liu, Jianxia Li, Xiaolin Song, Xin Yu & Licheng Jiao

Authors
  1. Ruochen Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianxia Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaolin Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xin Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Licheng Jiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ruochen Liu.

Appendix

Appendix

SCH:

$$\begin{aligned} f_1 (x)=\left\{ {{\begin{array}{l} {-x, if x \le 1} \\ {-2+x, if 1< x<3} \\ {4-x, if 3< x < 4} \\ {-4+x, if x > 4} \\ \end{array} },f_2 (x)=(x-5)^{2}} \right. \end{aligned}$$

where \(x\in [-5,10]\).

DEB:

$$\begin{aligned} f_1 (x)=x_1 ,f_2 (x)=(1+10x_2 )\times \left[ 1-\left( \frac{x_1 }{1+10x_2 }\right) ^{2}-\frac{x_1 }{1+10x_2 }\sin (8\pi x_1 )\right] \end{aligned}$$

where \(x=(x_{1},x_{2})\in [0,1]\).

ZDT1:

$$\begin{aligned} f_1 (x)=x_1 ,f_2 (x)=g(x)\left[ {1-\sqrt{\frac{f_1 (x)}{g(x)}}} \right] \end{aligned}$$

where \(g(x)=1+{9\sum _{i=2}^l {x_i } }/{\left( {l-1} \right) }\), and \(x=(x_{1},{\ldots },x_{l})^{T}\in [0,1]^{l}\).

ZDT2:

$$\begin{aligned} f_1 (x)=x_1 ,\;f_2 (x)=g(x)\left[ {1-\left( {\frac{f_1 (x)}{g(x)}} \right) ^{2}} \right] \end{aligned}$$

where g(x) and the range of x are the same as that of ZDT1.

ZDT3:

$$\begin{aligned} f_1 (x)=x_1 ,\quad f_2 (x)=g(x)\left[ {1-\sqrt{\frac{f_1 (x)}{g(x)}}} \right] -\frac{f_1 (x)}{g(x)}\sin (10\pi x_1 ) \end{aligned}$$

where g(x) and the range of x are also the same as that of ZDT1.

DTLZ1:

$$\begin{aligned} \begin{array}{c} f_1 (x)=0.5x_1 x_2 \ldots x_{k-1} \left( {1+g(x_k )} \right) \\ f_2 (x)=0.5x_1 x_2 \ldots \left( {1-x_{k-1} } \right) \left( {1+g(x_k )} \right) \\ \ldots \\ f_{k-1} (x)=0.5x_1 \left( {1-x_2 } \right) \left( {1+g(x_k )} \right) \\ f_k (x)=0.5\left( {1-x_1 } \right) \left( {1+g(x_k )} \right) \\ \end{array} \end{aligned}$$

where \(g(x)=100\left[ {\left| {x_k } \right| +\sum _{x_i \in x_k } {\left( {\left( {x-0.5} \right) ^{2}-\cos \left( {20\pi \left( {x-0.5} \right) } \right) } \right) } } \right] \), and \(x=(x_{1},{\ldots },x_{l})^{T}\in [0,1]^{l}\).

DTLZ2:

$$\begin{aligned} \begin{array}{c} f_1 (x)=\left( {1+g(x_k )} \right) \cos \left( {0.5x_1 \pi } \right) \ldots \cos \left( {0.5x_{k-1} \pi } \right) \\ f_2 (x)=\left( {1+g(x_k )} \right) \cos \left( {0.5x_1 \pi } \right) \ldots \sin \left( {0.5x_{k-1} \pi } \right) \\ \ldots \\ f_{k-1} (x)=\left( {1+g(x_k )} \right) \cos \left( {0.5x_1 \pi } \right) \sin \left( {0.5x_2 \pi } \right) \\ f_k (x)=\left( {1+g(x_k )} \right) \sin \left( {0.5x_1 \pi } \right) \\ \end{array} \end{aligned}$$

where \(g(x)=\sum _{x_i \in x_k } {\left( {x-0.5} \right) ^{2}} \), and \(x=(x_{1},{\ldots },x_{l})^{T}\in [0,1]^{l}\).

DTLZ3:

$$\begin{aligned} \begin{array}{c} f_1 (x)=\left( {1+g(x_k )} \right) \cos \left( {0.5x_1 \pi } \right) \ldots \cos \left( {0.5x_{k-1} \pi } \right) \\ f_2 (x)=\left( {1+g(x_k )} \right) \cos \left( {0.5x_1 \pi } \right) \ldots \sin \left( {0.5x_{k-1} \pi } \right) \\ \ldots \\ f_{k-1} (x)=\left( {1+g(x_k )} \right) \cos \left( {0.5x_1 \pi } \right) \sin \left( {0.5x_2 \pi } \right) \\ f_k (x)=\left( {1+g(x_k )} \right) \sin \left( {0.5x_1 \pi } \right) \\ \end{array} \end{aligned}$$

where \(g(x)=100\left[ {\left| {x_k } \right| +\sum _{x_i \in x_k } {\left( {\left( {x-0.5} \right) ^{2}-\cos \left( {20\pi \left( {x-0.5} \right) } \right) } \right) } } \right] \), and \(x= (x_{1},{\ldots },x_{l})^{T}\in [0,1]^{l}\).

DTLZ4:

$$\begin{aligned} \begin{array}{c} f_1 (x)=\left( {1+g(x_k )} \right) \cos \left( {0.5x_1 ^{\alpha }\pi } \right) \ldots \cos \left( {0.5x_{k-1} ^{\alpha }\pi } \right) \\ f_2 (x)=\left( {1+g(x_k )} \right) \cos \left( {0.5x_1 ^{\alpha }\pi } \right) \ldots \sin \left( {0.5x_{k-1} ^{\alpha }\pi } \right) \\ \ldots \\ f_{k-1} (x)=\left( {1+g(x_k )} \right) \cos \left( {0.5x_1 ^{\alpha }\pi } \right) \sin \left( {0.5x_2 ^{\alpha }\pi } \right) \\ f_k (x)=\left( {1+g(x_k )} \right) \sin \left( {0.5x_1 ^{\alpha }\pi } \right) \\ \end{array} \end{aligned}$$

where \(g(x)=\sum _{x_i \in x_k } {\left( {x-0.5} \right) ^{2}} ,\alpha =100\), and \(x=(x_{1},{\ldots },x_{l})^{T}\in [0,1]^{l}\).

DTLZ6:

$$\begin{aligned} \begin{array}{c} f_1 (x)=x_1 \\ f_2 (x)=x_2 \\ \cdots \\ f_{k-1} (x)=x_{k-1} \\ f_k (x)=\left( {1+g(x_k )} \right) h\left( {f_1 ,f_2 ,\ldots ,f_{k-1} ,g} \right) \\ \end{array} \end{aligned}$$

where \(h=k-\sum _{i=1}^k {\left[ {\frac{f_i }{1+g}\left( {1+\sin \left( {3\pi f_i } \right) } \right) } \right] } ,g(x)=1+\frac{9}{\left| {x_k } \right| }\sum _{x_i \in x_k } {x_i } \), and \(x=(x_{1},{\ldots },x_{l})^{T}\in [0,1]^{l}\).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, R., Li, J., Song, X. et al. Simulated annealing-based immunodominance algorithm for multi-objective optimization problems. Knowl Inf Syst 55, 215–251 (2018). https://doi.org/10.1007/s10115-017-1065-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-017-1065-x

Keywords

Search

Navigation