Abstract
This contribution addresses the role of anticipation in evolutionary algorithms for dynamic optimization problems. Recent approaches have mainly focused on maintaining the population diversity as a warrant for the ability of tracking the optimum. In our paper, we show that it is also useful to anticipate changes of the environment by explicitly searching for solutions which maintain flexibility. Although this is a valid approach to all dynamic optimization problems, it seems particularly important for optimization problems where a part of the solution is fixed at each step. For the example of job shop scheduling, we suggest a measure of flexibility and show that much better solutions can be obtained when this measure is incorporated into the fitness-function.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bierwirth, C., Mattfeld, D.C., Kopfer, H. (1996): On Permutation Representations for Scheduling Problems. In Voigt et al. (eds.): Proc. of PPSN IV, Springer, Berlin, pp. 310–318
Bierwirth, C., Mattfeld, D.C. (1999): Production Scheduling and Rescheduling with Genetic Algorithms. Evolutionary Computation, 7(1), pp. 1–17
Branke, J. (1998): Creating Robust Solutions by Means of an Evolutionary Algorithm. In Eiben et al. (eds.): Proc. of PPSN V, Springer, Berlin, pp. 119–128
Branke, J. (2000): Efficient Evolutionary Algorithms for Searching Robust Solutions. To appear in: Adaptive Computing in Design and Manufacture, Springer, Berlin
Branke, J. (1999): Evolutionary Algorithms for Dynamic Optimization Problems-A Survey. Technical Report No. 387, Insitute AIFB, University of Karlsruhe, Germany
Cheng, R., Gen, M., Tsujimura, Y. (1996): A Tutorial Survey of Job-Shop Scheduling Problems Using Genetic Algorithms. Comp. Ind. Engng., 30, pp. 983–997
Lin, S., Goodman, E., Punch, W. (1997): A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problems. In Bäck T. (ed.): Proc. of the 7th Int. Conf. on Genetic Alg., Morgan Kaufmann, San Mateo CA, pp. 481–489
Mattfeld, D.C, Bierwirth, C. (1998): Minimizing Job Tardiness: Priority Rules vs. Adaptive Scheduling. In Parmee, I.C. (ed.): Adaptive Computing in Design and Manufacture, Springer, London, pp. 59–67
Raman, N., Talbot, F.B. (1993): The Job Shop Tardiness Problem: A Decomposition Approach. EJOR, 69, pp. 187–199
Sgall, J. (1998): On-line Scheduling. In Fiat, A., Woeginger, G.J. (eds.): Online Algorithms: The State of the Art. Springer, Berlin, pp. 196–232
Storer R., Wu, D., Vaccari, R. (1992): New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling. Man. Sci., 38, pp. 1495–1509
Tjornfelt-Jensen, M., and Hansen, T.K. (1999): Robust solutions to Job Shop problems. In Congress on Evolutionary Computation, IEEE, pp. 1138–1144
Tjornfelt-Jensen, M. (2000): Robustness based Rescheduling using GAs. Submitted to: IEEE Transaction on Evolutionary Computing
Tsutsui, S. and Ghosh, A. (1997): Genetic Algorithms with a Robust Solution Searching Scheme. In: IEEE Transactions on Evolutionary Computation, 1(3), pp. 201–208
Vepsalainen, A.P.J., Morton, T.E. (1987): Priority Rules for Job Shops with Weighted Tardiness Costs. Man. Sci., 33(8), pp. 1035–1047
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Branke, J., Mattfeld, D.C. (2000). Anticipation in Dynamic Optimization: The Scheduling Case. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_25
Download citation
DOI: https://doi.org/10.1007/3-540-45356-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41056-0
Online ISBN: 978-3-540-45356-7
eBook Packages: Springer Book Archive