Abstract
In order to approximate the set of Pareto optimal solutions, several evolutionary multi-objective optimization (EMO) algorithms transfer the multi-objective problem into several independent single-objective ones by means of scalarizing functions. The choice of the scalarizing functions’ underlying search directions, however, is typically problem-dependent and therefore difficult if no information about the problem characteristics are known before the search process. The goal of this paper is to present new ideas of how these search directions can be computed adaptively during the search process in a cooperative manner. Based on the idea of Newton’s law of universal gravitation, solutions attract and repel each other in the objective space. Several force-based EMO algorithms are proposed and compared experimentally on general bi-objective ρMNK landscapes with different objective correlations. It turns out that the new approach is easy to implement, fast, and competitive with respect to a (μ + λ)-SMS-EMOA variant, in particular if the objectives show strong positive or negative correlations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aguirre, H.E., Tanaka, K.: Working principles, behavior, and performance of MOEAs on MNK-landscapes. Eur. J. Oper. Res. 181(3), 1670–1690 (2007)
Beume, N., Naujoks, B., Emmerich, M.: SMS-EMOA: Multiobjective selection based on dominated hypervolume. Eur. J. Oper. Res. 181(3), 1653–1669 (2007)
Chen, J.H., Kang, C.W.: A force-driven evolutionary approach for multi-objective 3D differentiated sensor network deployment. Int. J.of Ad Hoc and Ubi. Comp. 8(1/2), 85–95 (2011)
Hassanzadeh, H.R., Rouhani, M.: A multi-objective gravitational search algorithm. In: 2nd Int. Conf. on Computational Intell. Comm. Sys. and Networks, pp. 7–12 (2010)
Hughes, E.J.: Multiple Single Objective Pareto Sampling. In: Congress on Evolutionary Computation (CEC 2003), pp. 2678–2684. IEEE Press (2003)
Hughes, E.J.: Many Objective Optimisation: Direct Objective Boundary Identification. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN X. LNCS, vol. 5199, pp. 733–742. Springer, Heidelberg (2008)
Kauffman, S.A.: The Origins of Order. Oxford University Press (1993)
Khan, J.A., Sait, S.M.: Fast fuzzy force-directed simulated evolution metaheuristic for multiobjective VLSI cell placement. The Arabian J. for Sc. and Eng. 32(2B), 264–281 (2007)
López-Ibáñez, M., Paquete, L., Stützle, T.: Exploratory analysis of stochastic local search algorithms in biobjective optimization. In: Experimental Methods for the Analysis of Optimization Algorithms, ch. 9, pp. 209–222. Springer (2010)
Miettinen, K.: Nonlinear Multiobjective Optimization. Kluwer Academic Publishers (1999)
Nobahari, H., Nikusokhan, M., Siarry, P.: Non-dominated sorting gravitational search algorithm. In: Int. Conf. on Swarm Intelligence (2011)
Rashedi, E., Nezamabadi-pour, H., Saryazdi, S.: GSA: A gravitational search algorithm. Information Sciences 179(13), 2232–2248 (2009)
Verel, S., Liefooghe, A., Jourdan, L., Dhaenens, C.: Analyzing the Effect of Objective Correlation on the Efficient Set of MNK-Landscapes. In: Coello, C.A.C. (ed.) LION 5. LNCS, vol. 6683, pp. 116–130. Springer, Heidelberg (2011)
Wagner, T., Beume, N., Naujoks, B.: Pareto-, Aggregation-, and Indicator-Based Methods in Many-Objective Optimization. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 742–756. Springer, Heidelberg (2007)
Wang, Y., Zeng, J.C.: A constraint multi-objective artificial physics optimization algorithm. In: 2nd Int. Conf. on Computational Intell. and Natural Computing, pp. 107–112 (2010)
Wang, Y., Zeng, J.C., Cui, Z.H., He, X.J.: A novel constraint multi-objective artificial physics optimisation algorithm and its convergence. Int. J. Innov. Comput. Appl. 3(2), 61–70 (2011)
Zhang, Q., Li, H.: MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition. IEEE Transactions on Evolutionary Computation 11(6), 712–731 (2007)
Zitzler, E., Thiele, L., Laumanns, M., Foneseca, C.M., Grunert da Fonseca, V.: Performance assessment of multiobjective optimizers: An analysis and review. IEEE Transactions on Evolutionary Computation 7(2), 117–132 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Derbel, B., Brockhoff, D., Liefooghe, A. (2013). Force-Based Cooperative Search Directions in Evolutionary Multi-objective Optimization. In: Purshouse, R.C., Fleming, P.J., Fonseca, C.M., Greco, S., Shaw, J. (eds) Evolutionary Multi-Criterion Optimization. EMO 2013. Lecture Notes in Computer Science, vol 7811. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37140-0_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-37140-0_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37139-4
Online ISBN: 978-3-642-37140-0
eBook Packages: Computer ScienceComputer Science (R0)