Summary
There are several characteristics that make scheduling and timetabling problems particularly difficult to solve: they have huge search spaces, they are often highly constrained, they require sophisticated solution representation schemes, and they usually require very time-consuming fitness evaluation routines. There is a considerable number of memetic algorithms that have been proposed in the literature to solve scheduling and timetabling problems. In this chapter, we concentrate on identifying and discussing those strategies that appear to be particularly useful when designing memetic algorithms for this type of problems. For example, the many different ways in which knowledge of the problem domain can be incorporated into memetic algorithms is very helpful to design effective strategies to deal with infeasibility of solutions. Memetic algorithms employ local search, which serves as an effective intensification mechanism that is very useful when using sophisticated representation schemes and time-consumingfitness evaluation functions. These algorithms also incorporate a population, which gives them an effective explorative ability to sample huge search spaces. Another important aspect that has been investigated when designing memetic algorithms for scheduling and timetabling problems, is how to establish the right balance between the work performed by the genetic search and the work performed by the local search. Recently, researchers have put considerable attention in the design of self-adaptive memetic algorithms. That is, to incorporate memes that adapt themselves according to the problem domain being solved and also to the particular conditions of the search process. This chapter also discusses some recent ideas proposed by researchers that might be useful when designing self-adaptive memetic algorithms. Finally, we give a summary of the issues discussed throughout the chapter and propose some future research directions in the design of memetic algorithms for scheduling and timetabling problems.
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
Aickelin U., Dowsland K.A. (2000). Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of scheduling, 3(3), 139–153.
Alkan A., Ozcan E. (2003). Memetic algorithms for timetabling. Proceedings of the 2003 congress on evolutionary computation (CEC 2003), 1796–1802, IEEE press.
Basseur M., Seynhaeve F., Talbi E.G. (2002). Design of multi-objective evolutionary algorithms to the flow-shop scheduling problem. Proceedings of the 2002 congress on evolutionary computation (CEC 2002), IEEE press, 1151–1156.
Blazewicz J., Domschke W., Pesch E. (1996). The job shop scheduling problem: conventional and new solution techniques. European journal of operational research, 93, 1–33.
Burke E.K., Newall J.P. (1999). A multi-stage evolutionary algorithm for the timetable problem. IEEE transactions on evolutionary computation, 3(1), 1085–1092.
Burke E.K., Newall J.P., Weare R.F. (1996). A memetic algorithm for university exam timetabling. The practice and theory of automated timetabling: Selected papers from the 1st international conference on the practice and theory of automated timetabling (PATAT 1995), Lecture notes in computer science, 1153, 241–250, Springer.
Burke E.K., Cowling P., Landa Silva J.D. (2001). Hybrid population-based metaheuristic approaches for the space allocation problem. Proceedings of the 2001 congress on evolutionary computation (CEC 2001), IEEE press, 232–239.
Burke E.K., Cowling P., Landa Silva J.D., Petrovic S. (2001). Combining hybrid metaheuristics and populations for the multiobjective optimisation of space allocation problems. Proceedings of the 2001 genetic and evolutionary computation conference (GECCO 2001), Morgan kaufmann, 1252–1259.
Burke E., Cowling P., De Causmaecker P., Vanden Berghe G. (2001). A memetic approach to the nurse rostering problem. Applied intelligence, 15(3), 199–214.
Burke E.K., Hart E., Kendall G., Newall J., Ross P., Schulemburg S. (2003). Hyper-heuristics: an emerging direction in modern search technology. In: Glover F.W., Kochenberger G.A. (eds.), Handbook of metaheuristics, Kluwer academic publishers, 2003.
Burke E.K., Landa Silva J.D., Soubeiga E. (2003). Hyperheuristic approaches for multiobjective optimisation. Proceedings of the 5th metaheuristics international conference (MIC 2003), Kyoto Japan. Extended version available from the authors.
Burke E.K., Smith A. (1999). A memetic algorithm to schedule planned maintenance for the national grid. ACM Journal of experimental algorithmics, 4(1), 1084–1096.
Burke E.K., Smith A. (2000) Hybrid evolutionary techniques for the maintenance scheduling problem, IEEE transactions on power systems, 15(1), 122–128.
Colorni A., Dorigo M., Maniezzo V. (1998). Metaheuristics for high school timetabling, Computational optimization and applications, 9, 275–298.
Corne D., Dorigo M., Glover F. (eds.) (1999). New ideas in optimisation. Mc-Graw Hill.
Deris S., Omatu S., Ohta H., Saad P. (1999). Incorporating constraint propagation in genetic algorithm for university timetable planning. Engineering applications of artificial intelligence, 12, 241–253.
Erben Wilhelm (2001). A grouping genetic algorithm for graph colouring and exam timetabling. The practice and theory of automated timetabling III: Selected papers from the 3rd international conference on the practice and theory of automated timetabling (PATAT 2000), Lecture notes in computer science, 2079, 132–156, Springer.
Erben W., Keppler J. (1996). A genetic algorithm solving a weekly course-timetabling problem. The practice and theory of automated timetabling: Selected papers from the 1st international conference on the practice and theory of automated timetabling (PATAT 1995), Lecture notes in computer science, 1153, 198–211, Springer.
Ernst A.T., Jiang H., Krishnamoorthy M., Sier D. (2004). Staff scheduling and rostering: a review of applications, methods and models. European journal of operational research, 153, 3–27.
Grefenstette J.J., Fitzpatrick M.J. (1985). Genetic search with approximate function evaluation. Genetic algorithms and their applications: Proceedings of the first international conference on genetic algorithms, 112–120.
Mlandenovic N., Hansen P. (1997). Variable neighbourhood search. Computers and operations research, 24(11), 1097–1100.
Ishibuchi H., Murata T., Tomioka S. (1997). Effectiveness of genetic local search algorithms, Proceedings of the seventh international conference on genetic algorithms, 505–512.
Ishibuchi H., Yoshida T., Murata T. (2002b). Selection of initial solutions for local search in multiobjective genetic local search. Proceedings of the 2002 congress on evolutionary computation (CEC 2002), 950–955, IEEE press.
Ishibuchi H., Yoshida T., Murata T. (2003). Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE transactions on evolutionary computation, 7(2), 204–223.
Jaszkiewicz A. (2002). Genetic local search for multi-objective combinatorial optimization. European journal of operational research, 137(1), 50–71.
Kawanaka H., Yamamoto K., Toshikawa T., Shinogi T., Tsuruoka S. (2001). Genetic algorithm with the constraints for nurse scheduling problem. Proceedings of the 2001 congress on evolutionary computation (CEC 2001), 1123–1130, IEEE press.
Knowles J.D., Come D.W. (2000). M-PAES a memetic algorithm for multiobjective optimization. Proceedings of the 2000 congress on evolutionary computation (CEC 2000), 325–332, IEEE press.
Knowles J.D., Corne D.W. (2002). Towards landscape analyses to inform the design of a hybrid local search for the multiobjective quadratic assignment problem. In: Soft computing systems: design, management and applications, 271–279, IOS Press.
Krasnogor N. (2002). Studies on the theory and design space of memetic algorithms. PhD thesis, Faculty of computing, engineering and mathematical sciences, University of the West of England, UK.
Krasnogor N., Smith J. (2000). A memetic algorithm with self-adaptive local search: TSP as a case study. Proceedings of the 2000 genetic and evolutionary computation conference (GECCO 2000), 987–994, Morgan kaufmann.
Landa-Silva J.D. (2003). Metaheuristic and multiobjective approaches for space allocation. PhD Thesis, School of Computer Science and Information Technology, University of Nottingham.
Merz P, Freisleben B. (1999). Fitness landscape and memetic algorithm design. In: Corne D., Dorigo M., Glover F. (eds.), New ideas in optimisation, McGraw Hill, 245–260.
Moscato P. (1999). Memetic algorithms: a short introduction. In: Corne D., Dorigo M., Glover F. (eds.), New Ideas in Optimisation, 219–234, McGraw Hill, 1999.
Moscato P. (2002). Memetic algorithms’ home page. Online, available at http://www.densis.fee.unicamp.br/moscato/memetichome.html.
Murata T., Ishibuchi H., Gen M. (2000). Cellular genetic local search for multi-objective optimization. Proceedings of the 2000 genetic and evolutionary computation conference (GECCO 2000), Morgan kaufmann, 307–314.
Paechter B., Cumming A., Norman M.G., Luchiam H. (1996). Extensions to a memetic timetabling system. The practice and theory of automated timetabling: Selected papers from the 1st international conference on the practice and theory of automated timetabling (PATAT 1995), Lecture notes in computer science, 1153, 251–265, Springer.
Pinedo Michael (1995). Scheduling, theory, algorithms, and systems. Prentice-hall.
Preux Ph., Talbi E.G. (1999). Towards hybrid evolutionary algorithms. International transactions in operational research, 6, 557–570.
Randall M., Abramson D. (2001). A general meta-heuristic based solver for combinatorial optimisation problems. Computational optimization and applications, 20, 185–210.
Ross P., Hart E., Corne D. (1998). Some Observations about GA-based exam timetabling. The practice and theory of automated timetabling II: Selected papers from the 2nd international conference on the practice and theory of automated timetabling (PATAT 1997), Lecture notes in computer science, 1408, 115–129, Springer.
Salman F.S., Kalagnaman J.R., Murthy S., Davenport A. (2002). Cooperative strategies for solving bicriteria sparse multiple knapsack problem. Journal of heuristics, 8, 215–239.
Schaerf A. (1999). A Survey of automated timetabling. Artificial intelligence review, 13, 87–127.
Steuer Ralph E. (1986). Multiple criteria optimization: theory, computation and application. Wiley.
Talbi E.G. (2002). A Taxonomy of hybrid metaheuristics. Journal of heuristics, 8, 541–564.
Viana A., Pinho de Sousa J., Matos M.A. (2003). GRASP with constraint neighbourhoods: an application to the unit commitment problem. Proceedings of the 5th metaheuristics international conference (MIC 2003), 2003.
Watson J.P., Rana S., Whitley L.D., Howe A.E. (1999). The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling. Journal of scheduling, 2, 79–98.
Wren A. (1996). Scheduling, timetabling and rostering, a special relationship?. The practice and theory of automated timetabling: Selected papers from the 1st international conference on the practice and theory of automated timetabling (PATAT 1995), Lecture notes in computer science, 1153, 46–75, Springer.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Burke, E.K., Landa Silva, J.D. (2005). The Design of Memetic Algorithms for Scheduling and Timetabling Problems. In: Hart, W.E., Smith, J.E., Krasnogor, N. (eds) Recent Advances in Memetic Algorithms. Studies in Fuzziness and Soft Computing, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32363-5_13
Download citation
DOI: https://doi.org/10.1007/3-540-32363-5_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22904-9
Online ISBN: 978-3-540-32363-1
eBook Packages: EngineeringEngineering (R0)