Algorithm portfolio based scheme for dynamic optimization problems

References

• P. Angeline. Tracking extrema in dynamic environments. In P. Angeline, R. Reynolds, J. McDonnell, and R. Eberhart, editors, Evolutionary Programming VI, volume 1213 of Lecture Notes in Computer Science, pages 335–345. Springer Berlin Heidelberg, 1997.
   Google Scholar
• T. Blackwell and J. Branke. Multiswarms, exclusion, and anti-convergence in dynamic environments. IEEE Transactions on Evolutionary Computation, 10(4):459–472, 2006.
   Web of Science ®Google Scholar
• J. Branke, M. Orbayi, and S. Uyar. The role of representations in dynamic knapsack problems. In F. Rothlauf, J. Branke, S. Cagnoni, E. Costa, C. Cotta, R. Drechsler, E. Lutton, P. Machado, J. Moore, J. Romero, G. Smith, G. Squillero, and H. Takagi, editors, Applications of Evolutionary Computing, volume 3907 of Lecture Notes in Computer Science, pages 764–775. Springer Berlin Heidelberg, 2006.
   Google Scholar
• J. Branke and H. Schmeck. Designing evolutionary algorithms for dynamic optimization problems. In A. Ghosh and S. Tsutsui, editors, Advances in Evolutionary Computing, Natural Computing Series, pages 239–262. Springer Berlin Heidelberg, 2003.
   Google Scholar
• E. K. Burke, M. Gendreau, M. Hyde, G. Kendall, G. Ochoa, E. Özcan, and R. Qu. Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society, 64(12):1695–1724, 2013.
   Web of Science ®Google Scholar
• P. Cowling, G. Kendall, and E. Soubeiga. A hyperheuristic approach to scheduling a sales summit. In E. Burke and W. Erben, editors, Practice and Theory of Automated Timetabling III, volume 2079 of Lecture Notes in Computer Science, pages 176–190. Springer Berlin Heidelberg, 2001.
   Google Scholar
• C. Cruz, J. R. González and D. A. Pelta. Optimization in dynamic environments: a survey on problems, methods and measures. Soft Computing, 15(7):1427–1448, 2011.
   Web of Science ®Google Scholar
• F. O. de França, F. J. Von Zuben, and L. N. de Castro. An artificial immune network for multimodal function optimization on dynamic environments. In Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, GECCO '05, pages 289–296, New York, NY, USA, 2005. ACM.
   Google Scholar
• I. G. del Amo, D. A. Pelta, J. R. González, and A. D. Masegosa. An algorithm comparison for dynamic optimization problems. Applied Soft Computing, 12(10):3176–3192, 2012.
   Web of Science ®Google Scholar
• S. Droste. Analysis of the (1+1) EA for a dynamically bitwise changing OneMax. In E. Cantú-Paz, J. Foster, K. Deb, L. Davis, R. Roy, U.-M. O'Reilly, H.-G. Beyer, R. Standish, G. Kendall, S. Wilson, M. Harman, J. Wegener, D. Dasgupta, M. Potter, A. Schultz, K. Dowsland, N. Jonoska, and J. Miller, editors, Genetic and Evolutionary Computation (GECCO 2003),volume 2723 of Lecture Notes in Computer Science, pages 909–921. Springer Berlin Heidelberg, 2003.
   Google Scholar
• W. Du and B. Li. Multi-strategy ensemble particle swarm optimization for dynamic optimization. Information Sciences, 178(15):3096–3109, 2008.
   Web of Science ®Google Scholar
• J. Fajardo and A. Rosete. Algoritmo multigenerador de soluciones, para la competencia y colaboración de generadores metaheurísticos. Revista Internacional de Investigación de Operaciones, 1:57–63, 2011.
   Google Scholar
• C. Fernandes, J. Laredo, A. Rosa, and J. Merelo. The sandpile mutation genetic algorithm: an investigation on the working mechanisms of a diversity-oriented and self-organized mutation operator for non-stationary functions. Applied Intelligence, 39(2):279–306, 2013.
   Web of Science ®Google Scholar
• M. Gagliolo and J. Schmidhuber. Learning dynamic algorithm portfolios. Annals of Mathematics and Artificial Intelligence, 47(3-4):295–328, 2006.
   Web of Science ®Google Scholar
• S., García, D. Molina, M. Lozano, and F. Herrera. A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC'2005 special session on real parameter optimization. Journal of Heuristics, 15(6):617–644, 2009.
   Web of Science ®Google Scholar
• C. P. Gomes and B. Selman. Algorithm portfolios. Artificial Intelligence, 126:43–62, 2001.
   Web of Science ®Google Scholar
• J. González, C. Cruz, I. Amo, and D. Pelta. An adaptive multiagent strategy for solving combinatorial dynamic optimization problems. In D. Pelta, N. Krasnogor, D. Dumitrescu, C. Chira, and R. Lung, editors, Nature Inspired Cooperative Strategies for Optimization (NICSO 2011), volume 387 of Studies in Computational Intelligence, pages 41–55. Springer Berlin Heidelberg, 2011.
   Google Scholar
• J. R. González, A. D. Masegosa, and I. G. del Amo. A cooperative strategy for solving dynamic optimization problems. Memetic Computing, 3:3–14, 2011.
   Google Scholar
• M. Guntsch, M. Middendorf, and H. Schmeck. An ant colony optimization approach to dynamic TSP. In Proceedings of the 2001 Genetic and Evolutionary Computation Conference, GECCO'01, pages 860–867, San Francisco, CA, USA, 2001. Morgan Kaufmann.
   Google Scholar
• B. A. Huberman, R. M. Lukose, and T. Hogg. An economics approach to hard computational problems. Science, 275:51–54, 1997.
   PubMed Web of Science ®Google Scholar
• H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.
   Google Scholar
• B. Kiraz, A. S. Uyar, and E. Özcan. Selection hyper-heuristics in dynamic environments. Journal of the Operational Research Society, 64(12):1753–1769, 2013.
   Web of Science ®Google Scholar
• C. Li, S. Yang, T. Nguyen, E. Yu, X. Yao, Y. Jin, H. Beyer, and P. Suganthan. Benchmark generator for CEC 2009 competition on dynamic optimization. Technical report, 2008.
   Google Scholar
• L. Liu, D. Wang, and W. Ip. A permutation-based dual genetic algorithm for dynamic optimization problems. Soft Computing, 13(7):725–738, 2009.
   Web of Science ®Google Scholar
• A. D. Masegosa, D. Pelta, and I. G. del Amo. The role of cardinality and neighborhood sampling strategy in agent-based cooperative strategies for dynamic optimization problems. Applied Soft Computing, 14, Part C(0):577–593, 2014.
   Web of Science ®Google Scholar
• D. C. Mattfeld and C. Bierwirth. An efficient genetic algorithm for job shop scheduling with tardiness objectives. European Journal of Operational Research, 155(3):616–630, 2004.
   Web of Science ®Google Scholar
• M. Mavrovouniotis and S. Yang. A memetic ant colony optimization algorithm for the dynamic travelling salesman problem. Soft Computing, 15(7):1405–1425, 2011.
   Web of Science ®Google Scholar
• R. Morrison. Designing Evolutionary Algorithms for Dynamic Environments. Natural Computing Series. Springer Berlin Heidelberg, 2004.
   Google Scholar
• R. Morrison and K. De Jong. A test problem generator for non-stationary environments. In Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999, volume 3, pages 2047–2053, Washington D.C., USA, 1999. IEEE Press.
   Google Scholar
• T. T. Nguyen, S. Yang, and J. Branke. Evolutionary dynamic optimization: A survey of the state of the art. Swarm and Evolutionary Computation, 6:1–24, 2012.
   Web of Science ®Google Scholar
• M. Nikolić, F. Marić, and P. Janičić. Simple algorithm portfolio for SAT. Artificial Intelligence Review, 40(4):457–465, 2013.
   Web of Science ®Google Scholar
• F. Peng, K. Tang, G. Chen, and X. Yao. Population-based algorithm portfolios for numerical optimization. IEEE Transactions on Evolutionary Computation, 14(5):782–800, 2010.
   Web of Science ®Google Scholar
• M. Petrik and S. Zilberstein. Learning parallel portfolios of algorithms. Annals of Mathematics and Artificial Intelligence, 48(1-2):85–106, 2006.
   Web of Science ®Google Scholar
• D. Pisinger. Where are the hard knapsack problems?. Computers and Operations Research, 32(9):2271–2284, 2005.
   Web of Science ®Google Scholar
• P. Rohlfshagen and X. Yao. The dynamic knap-sack problem revisited: A new benchmark problem for dynamic combinatorial optimisation. In M. Giacobini, A. Brabazon, S. Cagnoni, G. Caro, A. Ekárt, A. Esparcia-Alcázar, M. Farooq, A. Fink, and P. Machado, editors, Applications of Evolutionary Computing, volume 5484 of Lecture Notes in Computer Science, pages 745–754. Springer Berlin Heidelberg, 2009.
   Google Scholar
• R. Santana, P. Larrañaga, and J. A. Lozano. Adaptive estimation of distribution algorithms. In C. Cotta, M. Sevaux, and K. Sörensen, editors, Adaptive and Multilevel Metaheuristics, volume 136 of Studies in Computational Intelligence, pages 177–197. Springer Berlin Heidelberg, 2008.
   Google Scholar
• L. Schöemann. The impact of population sizes and diversity on the adaptability of evolution strategies in dynamic environments. In Proceedings of the 2004 Congress on Evolutionary Computation, CEC2004, volume 2, pages 1270–1277, Portland, OR, US, 2004. IEEE Press.
   Google Scholar
• L. Schönemann. Evolution strategies in dynamic environments. In S. Yang, Y.-S. Ong, and Y. Jin, editors, Evolutionary Computation in Dynamic and Uncertain Environments, volume 51 of Studies in Computational Intelligence, pages 51–77. Springer Berlin Heidelberg, 2007.
   Google Scholar
• N. Shukla, A. Choudhary, P. Prakash, K. Fernandes, and M. Tiwari. Algorithm portfolios for logistics optimization considering stochastic demands and mobility allowance. International Journal of Production Economics, 141(1):146–166, 2013.
   Web of Science ®Google Scholar
• N. Shukla, M. K. Tiwari, and D. Ceglarek. Genetic algorithms based algorithm portfolio for inventory routing problem with stochastic demand. International Journal of Production Research, 51(1):118–137, 2013.
   Web of Science ®Google Scholar
• S. A. Stanhope and J. M. Daida. (1+1) genetic algorithm fitness dynamics in a changing environment. In Proceedings of the 1999 Congress of Evolutionary Computation, CEC 2009, volume 3, pages 1851–1858, Washington D.C., USA, 1999.
   Google Scholar
• R. Tinós, and S. Yang. A self-organizing random immigrants genetic algorithm for dynamic optimization problems. Genetic Programming and Evolvable Machines, 8(3):255–286, 2007.
   Web of Science ®Google Scholar
• H. R. Topcuoglu, A. Ucar, and L. Altin. A hyperheuristic based framework for dynamic optimization problems. Applied Soft Computing, 19(0):236–251, 2014.
   Web of Science ®Google Scholar
• A. M. Turky and S. Abdullah. A multi-population harmony search algorithm with external archive for dynamic optimization problems. Information Sciences, 272(0):84–95, 2014.
   Web of Science ®Google Scholar
• G. Uludağ, B. Kiraz, A. Etaner-Uyar, and E. özcan. A framework to hybridize PBIL and a hyper-heuristic for dynamic environments. In C. A. C. Coello, V. Cutello, K. Deb, S. Forrest, G. Nicosia, and M. Pavone, editors, Parallel Problem Solving from Nature, PPSN XII, volume 7492 of Lecture Notes in Computer Science, pages 358–367. Springer Berlin Heidelberg, 2012.
   Google Scholar
• H. Wang, D. Wang, and S. Yang. A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems. Soft Computing, 13(8-9):763–780, 2009.
   Web of Science ®Google Scholar
• L. Xu, F. Hutter, H. H. Hoos, and K. Leyton-Brown. SATzilla: Portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research, 32:565–606, 2008.
   Web of Science ®Google Scholar
• S. R. Yadav, R. R. M. Muddada, M. Tiwari, and R. Shankar. An algorithm portfolio based solution methodology to solve a supply chain optimization problem. Expert Systems with Applications, 36(4):8407–8420, 2009.
   Web of Science ®Google Scholar
• S. Yang, Y. Jiang, and T. T. Nguyen. Metaheuristics for dynamic combinatorial optimization problems. IMA Journal of Management Mathematics, 24(4):451–480, 2013.
   Web of Science ®Google Scholar
• S. Yang, Y. Ong, and Y. Jin. Evolutionary Computation in Dynamic and Uncertain Environments, volume 51 of Studies in Computational Intelligence. Springer, 2007.
   Google Scholar
• S. Yang and X. Yao. Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Computing, 9(11):815–834, 2005
   Web of Science ®Google Scholar