Abstract
Several general benchmark generators (BGs) are available for the dynamic continuous optimization domain, in which generators use functions with adjustable parameters to simulate shifting landscapes. In the combinatorial domain the work is still on early stages. Many attempts of dynamic BGs are limited to the range of algorithms and combinatorial optimization problems (COPs) they are compatible with, and usually the optimum is not known during the dynamic changes of the environment. In this paper, we propose a BG that can address the aforementioned limitations of existing BGs. The proposed generator allows full control over some important aspects of the dynamics, in which several test environments with different properties can be generated where the optimum is known, without re-optimization.
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
Branke, J.: Memory enhanced evolutionary algorithms for changing optimization problems. In: Proc. of the 1999 IEEE Congr. on Evol. Comput., pp. 1875–1882 (1999)
Dorigo, M., Stützle, T.: Ant Colony Optimization. The MIT Press, London (2004)
Fu, H., Sendhoff, B., Tang, K., Yao, X.: Characterising environmental changes in robust optimisation over time. In: Proc. of the 2012 IEEE Congr. on Evol. Comput., pp. 551–558 (2012)
Guntsch, M., Middendorf, M.: Applying Population Based ACO to Dynamic Optimization Problems. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) ANTS 2002. LNCS, vol. 2463, pp. 111–122. Springer, Heidelberg (2002)
Jin, Y., Branke, J.: Evolutionary optimization in uncertain environments - a survey. IEEE Trans. Evol. Comput. 9(3), 303–317 (2005)
Holland, J.: Adaption in Natural and artificial systems. University of Michigan Press, Ann Arbor (1975)
Kilby, P., Prosser, P., Shaw, P.: Dynamic VRPs: A study of scenarios, Tech. Rep. APES-06-1998, University of Strathclyde, U.K. (1998)
Mavrovouniotis, M., Yang, S.: Memory-Based Immigrants for Ant Colony Optimization in Changing Environments. In: Di Chio, C., Cagnoni, S., Cotta, C., Ebner, M., Ekárt, A., Esparcia-Alcázar, A.I., Merelo, J.J., Neri, F., Preuss, M., Richter, H., Togelius, J., Yannakakis, G.N. (eds.) EvoApplications 2011, Part I. LNCS, vol. 6624, pp. 324–333. Springer, Heidelberg (2011)
Mei, Y., Tang, K., Yao, X.: A memetic algorithm for periodic capacitated arc routing problem. IEEE Trans. on Syst. Man and Cybern., Part B: Cybern. 41(6), 1654–1667 (2011)
Morrison, R.W., De Jong, K.A.: A test problem generator for non-stationary environments. In: Proc. of the 1999 IEEE Congr. on Evol. Comput., pp. 2047–2053 (1999)
Morrison, R.W.: Performance measurement in dynamic environments. In: Proc. of the 2003 Genetic and Evol. Comput. Conf., pp. 5–8 (2003)
Nguyen, T.T., Yao, X.: Dynamic Time-Linkage Problems Revisited. In: Giacobini, M., Brabazon, A., Cagnoni, S., Di Caro, G.A., Ekárt, A., Esparcia-Alcázar, A.I., Farooq, M., Fink, A., Machado, P. (eds.) EvoWorkshops 2009. LNCS, vol. 5484, pp. 735–744. Springer, Heidelberg (2009)
Rand, W., Riolo, R.: Measurements for understanding the behavior of the genetic algorithm in dynamic environments: A case study using the shaky ladder hyperplane-defined functions. In: Proc. of the 2005 Genetic and Evol. Comput. Conf., pp. 32–38 (2005)
Weicker, K.: Performance Measures for Dynamic Environments. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN VII. LNCS, vol. 2439, pp. 64–73. Springer, Heidelberg (2002)
Trojanowski, K., Michalewicz, Z.: Evolutionary algorithms for non-stationary environments. In: Proc. of 8th Workshop on Intelligent Information Systems, pp. 229–240 (1999)
Yang, S.: Non-stationary problem optimization using the primal-dual genetic algorithm. In: Proc. of the 2003 IEEE Congr. on Evol. Comput., pp. 2246–2253 (2003)
Yu, X., Jin, Y., Tang, K., Yao, X.: Robust optimization over Time – A new perspective on dynamic optimization problems. In: Proc. of the 2010 IEEE Congr. on Evol Comput., pp. 3998–4003 (2010)
Younes, A., Calamai, P., Basir, O.: Generalized benchmark generation for dynamic combinatorial problems. In: Proc. of the 2005 Genetic and Evol. Comput. Conf., pp. 25–31 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mavrovouniotis, M., Yang, S., Yao, X. (2012). A Benchmark Generator for Dynamic Permutation-Encoded Problems. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds) Parallel Problem Solving from Nature - PPSN XII. PPSN 2012. Lecture Notes in Computer Science, vol 7492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32964-7_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-32964-7_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32963-0
Online ISBN: 978-3-642-32964-7
eBook Packages: Computer ScienceComputer Science (R0)