Abstract
Multiobjectivisation transforms a mono-objective problem into a multiobjective one. The main aim of multiobjectivisation is to avoid stagnation in local optima, by changing the landscape of the original fitness function. In this contribution, an analysis of different multiobjectivisation approaches has been performed. It has been carried out with a set of scalable mono-objective benchmark problems. The experimental evaluation has demonstrated the advantages of multiobjectivisation, both in terms of quality and saved resources. However, it has been revealed that it produces a negative effect in some cases. Some multiobjectivisation schemes require the specification of additional parameters which must be adapted for dealing with different problems. Multiobjectivisation with parameters has been proposed as a method to improve the performance of the whole optimisation scheme. Nevertheless, the parameter setting of an optimisation scheme which considers multiobjectivisation with parameters is usually more complex. In this work, a new model based on the usage of hyperheuristics to facilitate the application of multiobjectivisation with parameters has been proposed. Experimental evaluation has shown that this model has increased the robustness of the whole optimisation scheme.
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
Abbass, H.A., Deb, K.: Searching under Multi-evolutionary Pressures. In: Fonseca, C.M., Fleming, P.J., Zitzler, E., Deb, K., Thiele, L. (eds.) EMO 2003. LNCS, vol. 2632, pp. 391–404. Springer, Heidelberg (2003)
Alba, E., Cervantes, A., Gómez, J.A., Isasi, P., Jaraíz, M.D., León, C., Luque, C., Luna, F., Miranda, G., Nebro, A.J., Pérez, R., Segura, C.: Metaheuristic Approaches for Optimal Broadcasting Design in Metropolitan MANETs. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds.) EUROCAST 2007. LNCS, vol. 4739, pp. 755–763. Springer, Heidelberg (2007)
Alba, E., Dorronsoro, B.: Cellular Genetic Algorithms. Springer (2008)
Baeck, T., Fogel, D.B., Michalewicz, Z. (eds.): Advanced Algorithms and Operations (Evolutionary Computation), 1st edn. Taylor & Francis (November 2000)
Brockhoff, D., Friedrich, T., Hebbinghaus, N., Klein, C., Neumann, F., Zitzler, E.: Do Additional Objectives Make a Problem Harder? In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, GECCO 2007, pp. 765–772. ACM, New York (2007)
Bui, L.T., Abbass, H.A., Branke, J.: Multiobjective optimization for dynamic environments. In: The 2005 IEEE Congress on Evolutionary Computation, vol. 3, pp. 2349–2356 (2005)
Burke, E.K., Kendall, G., Newall, J., Hart, E., Ross, P., Schulenburg, S.: Handbook of Meta-heuristics. Hyper-heuristics: An Emerging Direction in Modern Search Technology. Kluwer (2003)
Burke, E.K., Kendall, G., Soubeiga, E.: A Tabu-Search Hyperheuristic for Timetabling and Rostering. Journal of Heuristics 9(6), 451–470 (2003)
Burke, E.K., McCollum, B., Meisels, A., Petrovic, S., Qu, R.: A graph-based hyper-heuristic for educational timetabling problems. European Journal of Operational Research 176(1), 177–192 (2007)
Burke, E.K., Kendall, G., Landa Silva, J.D., O’Brien, R., Soubeiga, E.: An Ant Algorithm Hyperheuristic for the Project Presentation Scheduling Problem. In: Proceedings of the 2005 IEEE Congress on Evolutionary Computation (CEC 2005), Edinburgh, Scotland, September 2-5, vol. 3, pp. 2263–2270 (2005)
Caamaño, P., Prieto, A., Becerra, J.A., Bellas, F., Duro, R.J.: Real-Valued Multimodal Fitness Landscape Characterization for Evolution. In: Wong, K.W., Mendis, B.S.U., Bouzerdoum, A. (eds.) ICONIP 2010, Part I. LNCS, vol. 6443, pp. 567–574. Springer, Heidelberg (2010)
Chen, P.-C., Kendall, G., Vanden Berghe, G.: An Ant Based Hyper-heuristic for the Travelling Tournament Problem. In: Proceedings of IEEE Symposium of Computational Intelligence in Scheduling (CISched 2007), Honolulu, Hawaii, pp. 19–26 (April 2007)
Ciftcioglu, Ö., Bittermann, M.S.: Solution diversity in multi-objective optimization: A study in virtual reality. In: IEEE Congress on Evolutionary Computation, pp. 1019–1026. IEEE (2008)
Cowling, P., Kendall, G., Han, L.: An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem. In: Proceedings of the 2002 IEEE Congress on Evolutionary Computation (CEC 2002), Honolulu, Hawaii, pp. 1185–1190. IEEE Computer Society (2002)
Cowling, P., Kendall, G., Soubeiga, E.: A parameter-free hyperheuristic for scheduling a sales summit. In: Proceedings of 4th Metahuristics International Conference (MIC 2001), Porto, Portugal, July 16-20, pp. 127–131 (2001)
Cowling, P.I., Kendall, G., Soubeiga, E.: Hyperheuristics: A Robust Optimisation Method Applied to Nurse Scheduling. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 851–860. Springer, Heidelberg (2002)
De Jong, K.: Parameter Setting in EAs: a 30 Year Perspective. In: Lobo, F.G., Lima, C.F., Michalewicz, Z. (eds.) Parameter Setting in Evolutionary Algorithms, pp. 1–18. Springer (2007)
Deb, K., Agrawal, R.B.: Simulated binary crossover for continuous search space. Complex Systems 9, 115–148 (1995)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6, 182–197 (2002)
Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B 26(1), 29–41 (1996)
Dowsland, K., Soubeiga, E., Burke, E.K.: A Simulated Annealing Hyper-heuristic for Determining Shipper Sizes. European Journal of Operational Research 179(3), 759–774 (2007)
Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation 3(2), 124–141 (1999)
Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Natural Computing Series. Springer (October 2008)
Glover, F.W., Kochenberger, G.A.: Handbook of Metaheuristics. International Series in Operations Research & Management Science. Springer (January 2003)
Gratch, J., Chien, S.: Learning search control knowledge for the deep space network scheduling problem. Technical report, Champaign, IL, USA (1993)
Handl, J., Lovell, S.C., Knowles, J.D.: Multiobjectivization by Decomposition of Scalar Cost Functions. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 31–40. Springer, Heidelberg (2008)
Hoos, H.H., Stützle, T.: Stochastic local search: foundations and applications. The Morgan Kaufmann Series in Artificial Intelligence. Morgan Kaufmann Publishers (2005)
Jain, A., Fogel, D.B.: Case studies in applying fitness distributions in evolutionary algorithms. ii. comparing the improvements from crossover and gaussian mutation on simple neural networks. In: Proc. of the 2000 IEEE Symposium on Combinations of Evolutionary Computation and Neural Networks, pp. 91–97 (2000)
Kendall, G., Cowling, P., Soubeiga, E.: Choice function and random hyperheuristics. In: Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL 2002), Singapore, pp. 667–671 (November 2002)
Knowles, J.D., Watson, R.A., Corne, D.W.: Reducing Local Optima in Single-Objective Problems by Multi-objectivization. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 269–283. Springer, Heidelberg (2001)
León, C., Miranda, G., Segura, C.: METCO: A Parallel Plugin-Based Framework for Multi-Objective Optimization. International Journal on Artificial Intelligence Tools 18(4), 569–588 (2009)
Lobo, F.G., Lima, C.F., Michalewicz, Z. (eds.): Parameter Setting in Evolutionary Algorithms. SCI, vol. 54. Springer (2007)
Lozano, M., Molina, D., Herrera, F.: Special Issue on Scalability of Evolutionary Algorithms and Other Metaheuristics for Large-Scale Continuous Optimization Problems. In: Soft Computing - A Fusion of Foundations, Methodologies and Applications, pp. 1–3 (2010)
Luna, F., Estébanez, C., León, C., Chaves-González, J.M., Alba, E., Aler, R., Segura, C., Vega-Rodríguez, M.A., Nebro, A.J., Valls, J.M., Miranda, G., Gómez-Pulido, J.A.: Metaheuristics for Solving a Real-World Frequency Assignment Problem in GSM Networks. In: Genetic and Evolutionary Computation Conference, Atlanta, U.S.A, pp. 1579–1586. ACM (July 2008)
Mendes, S.P., Molina, G., Vega-Rodríguez, M.A., Gómez-Pulido, J.A., Sáez, Y., Miranda, G., Segura, C., Alba, E., Isasi, P., León, C., Sánchez-Pérez, J.M.: Benchmarking a Wide Spectrum of Meta-Heuristic Techniques for the Radio Network Design Problem. IEEE Transactions on Evolutionary Computation, 1133–1150 (2009)
Mouret, J.-B.: Novelty-Based Multiobjectivization. In: Doncieux, S., Bredèche, N., Mouret, J.-B. (eds.) New Horizons in Evolutionary Robotics. SCI, vol. 341, pp. 139–154. Springer, Heidelberg (2011)
Ong, Y.-S., Lim, M.-H., Zhu, N., Wong, K.-W.: Classification of Adaptive Memetic Algorithms: A Comparative Study. IEEE Transactions on Systems, Man, and Cybernetics - Part B 36(1), 141–152 (2006)
Segura, C., Cervantes, A., Nebro, A.J., Jaraíz-Simón, M.D., Segredo, E., García, S., Luna, F., Gómez-Pulido, J.A., Miranda, G., Luque, C., Alba, E., Vega-Rodríguez, M.Á., León, C., Galván, I.M.: Optimizing the DFCN Broadcast Protocol with a Parallel Cooperative Strategy of Multi-Objective Evolutionary Algorithms. In: Ehrgott, M., Fonseca, C.M., Gandibleux, X., Hao, J.-K., Sevaux, M. (eds.) EMO 2009. LNCS, vol. 5467, pp. 305–319. Springer, Heidelberg (2009)
Segura, C., Miranda, G., León, C.: Parallel hyperheuristics for the frequency assignment problem. Memetic Computing, 1–17 (2010)
Segura, C., Segredo, E., González, Y., León, C.: Multiobjectivisation of the Antenna Positioning Problem. In: Abraham, A., Corchado, J.M., González, S.R., De Paz Santana, J.F. (eds.) International Symposium on Distributed Computing and Artificial Intelligence. AISC, vol. 91, pp. 319–327. Springer, Heidelberg (2011)
Segura, C., Segredo, E., León, C.: Parallel island-based multiobjectivised memetic algorithms for a 2D packing problem. In: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO 2011, pp. 1611–1618. ACM, New York (2011)
Smit, S.K., Eiben, A.E.: Comparing parameter tuning methods for evolutionary algorithms. In: Proceedings of the Eleventh Congress on Evolutionary Computation, CEC 2009, Piscataway, NJ, USA, pp. 399–406. IEEE Press (2009)
Terashima-Marín, H., Ross, P.: Evolution of Constraint Satisfaction Strategies in Examination Timetabling. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), pp. 635–642. Morgan Kaufmann (1999)
Toffolo, A., Benini, E.: Genetic diversity as an objective in multi-objective evolutionary algorithms. Evolutionary Computation 11, 151–167 (2003)
Vinkó, T., Izzo, D.: Learning the best combination of solvers in a distributed global optimization environment. In: Proceedings of Advances in Global Optimization: Methods and Applications (AGO), Mykonos, Greece, pp. 13–17 (June 2007)
Zielinski, K., Laur, R.: Adaptive parameter setting for a multi-objective particle swarm optimization algorithm. In: The 2007 IEEE Congress on Evolutionary Computation, pp. 3019–3026 (September 2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Berlin Heidelberg
About this chapter
Cite this chapter
Segura, C., Segredo, E., León, C. (2013). Analysing the Robustness of Multiobjectivisation Approaches Applied to Large Scale Optimisation Problems. In: Tantar, E., et al. EVOLVE- A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation. Studies in Computational Intelligence, vol 447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32726-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-32726-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32725-4
Online ISBN: 978-3-642-32726-1
eBook Packages: EngineeringEngineering (R0)