In this paper a new multi-objective clonal selection algorithm (θ-MCSA) is presented to solve multi-objective problems with multimodal and non-continuous functions. The concept of clonal selection algorithm (CSA) is based on the immune system and white blood cells behavior that select the antibodies similar to antigen for cloning. Although the clonal selection is a robust optimization method, however, as a shortcoming, it takes long time to find optimal Pareto front especially in problems with large search space. To overcome this problem, the proposed method replaces the large search space with the θ-search based on the phase angles. To avoid trapping into local optima in mutation step, two strong mutation methods are implemented according to the iteration number and algorithm efficiency. For converging to uniformly Pareto front in less iterations, the proposed multi-objective algorithm handles the size of the repository and a new population updating mechanism is iteratively applied to select the non-dominate, one-dominate and two-dominate solutions of prior iteration. The experimental results show the efficiency of the proposed θ-MCSA algorithm compared to other methods.
IshidaY., The Immune System as a Self-Identification Process: A Survey and a Proposal, In Proc of the IMBS’96, 1996.
2.
HuntJ.E. and CookeD.E., Learning using an artificial immune system, Journal of Network and Computer Applications19 (1996), 189–212.
3.
DasguptaD., Artificial Immune Systems and Their Applications, Ed., Springer-Verlag, 1999.
4.
HofmeyrS.A. and ForrestS., Immunity by Design: An Artificial Immune System, Proc Of GECCO’99, (1999), pp. 1289–1296.
5.
De CastroL.N. and Von ZubenF.J., The Clonal Selection Algorithm with Engineering Applications, In: Proceedings of GECCO 2000, (2000), pp. 36–37.
6.
SilversteinA.M., A History of Immunology. Academic Press, San Diego, 1989.
7.
de CastroL.N. and Von ZubenF.J., Learning and optimization using the clonal selection principle, IEEE Transactions on Evolutionary Computation, Special Issue on Artificial Immune Systems6(3) (2002), 239–251.
8.
de CastroL.N. and Von ZubenF.J., Learning and optimization using the clonal selection principle, IEEE Transactions on Evolutionary Computation, Special Issue on Artificial Immune Systems6(3) (2002), 239–251.
9.
Kavousi-FardA. and NiknamT., Optimal distribution feeder reconfiguration for reliability improvement Considering Uncertainty, IEEE Transactions on Power Delivery29(3) (2014), 1344–1353.
10.
CaramiaM. and Dell’OlmoP., Multi-objective Management in Freight Logistics: Increasing Capacity, Service Level and Safety with Optimization Algorithms, Springer, 2008.
11.
KoskiJ., Defectiveness of weighting method in multicriterion optimization of structures, Commun Appl Numer Methods1 (1985), 333–337.
12.
KoskiJ., Multicriteria truss optimization. In: StadlerW., (ed.) Multicriteria Otimization in Engineering and in the Sciences, New York: Plenum, 1988.
13.
DasI. and DennisJ.E., A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems, Struct Optim14 (1997), 63–69.
14.
MarglinS., Public Investment Criteria. Cambridge, MA: MIT Press, 1967.
15.
SteuerR.E., Multiple Criteria Optimization: Theory, Computation and Application. New York: Wiley, 1986.
16.
LinJ., Multiple objective problems: Pareto-optimal solutions by method of proper equality constraints, IEEE Trans Autom Control21 (1976), 641–650.
17.
MessacA. and MattsonC.A., Generating well-distributed sets of pareto points for engineering design using physical programming, Optim Eng3 (2002), 431–450.
18.
MessacA., Ismail-YahayaA. and MattsonC.A., The normalized normal constraint method for generating the pareto frontier, Struct Multidisc Optim25 (2003), 86–98.
19.
MattsonC.A. and MessacA., Concept selection using s-Pareto frontiers, AIAA J41 (2003), 1190–1204.
20.
MessacA. and MattsonC.A., Normal constraint method with guarantee of even representation of complete pareto frontier, AIAA J42 (2004).
21.
WangX.L. and MahfoufM., ACSAMO an adaptive multi objective optimization algorithm using the clonal selection principle, 2th European Symposium on Nature Inspired Smart Information System, Puerto de la Cruz, Tenerife, Spain,
2006.
22.
BatistaL.S., OliveiraD.B., GuimarãesF.G. and SilvaE.J., Dynamic multiobjective clonal selection algorithm for engineering design, IEEE Transactions on Magnetics46(8) (2010), 3033–3036.
23.
HongL. and JiZ., An adaptive multi-objective clonal selection algorithm, International Symposium on Computer Communication Control and Automation (3CA)1 (2010), 233–236.
24.
Srinivasa RaoB., and VaisakhK., Multi-objective adaptive Clonal selection algorithm for solving environmental/economic dispatch and OPF problems with load uncertainty, International Journal of Electrical Power & Energy Systems53 (2013), 390–408.
25.
GoldbergD.E., Genetic Algorithms for Search, Optimization, and Machine Learning, Reading, MA: Addison-Wesley, 1989.
26.
HornJ., NafpliotisN. and GoldbergD.E., A niched Pareto genetic algorithm for multiobjective optimization, in Proc 1st IEEE Conf Evol Comput, IEEE World Congr Comput Intell, 1, (1994), pp. 67–72.
27.
FogelD.B., An introduction to simulated evolutionary optimization, IEEE Trans on Neural Networks: Special Issue on Evolutionary Computation5(1) (1994), 3–14.
28.
Van VeldhuizenD.A. and LamontG.B., Multiobjective evolutionary algorithm research: A history and analysis, Dept Elec Comput Eng, Graduate School of Eng, Air Force Inst Technol, Wright-Patterson AFB, OH, Tech Rep TR, 1998.
29.
SchottJ.R., Fault tolerant design using single and multicriteria genetic algorithm optimization, M.S. Thesis, Dept Aeronautics and Astronautics, Massachusetts Inst Technol, Cambridge, MA, 1995.
30.
Van VeldhuizenD.A., Multiobjective evolutionary algorithms: Classifications, analyzes, and new innovations, Ph.D. Dissertation, Dept Elec Comput Eng, Graduate School of Eng, Air Force Inst Technol, Wright-Patterson AFB, OH, 1999.
31.
ZitzlerE., DebK. and ThieleL., Comparison of multiobjective evolutionary algorithms: Empirical results, Evolutionary Computation8(2) (2000), 173–195.
32.
PratapA., DebK., AgarwalS. and MeyarivanT., A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II, in KanGAL Report 200001, Indian Institute of Technology, Kanpur, India,
2000.
33.
RonghuaS., WenpingM. and WeiZ., Immune Clonal MO Algorithm for ZDT Problems, Advances in Natural Computation Lecture Notes in Computer Science, 4222, (2006), pp. 100–109.
