Abstract—A large number of metaheuristics and local search methods have been developed for combinatorial and global optimization. We present our PEAST algorithm which is capable of solving very difficult real-world scheduling problems, such as workforce scheduling, sports scheduling and school timetabling. The goal of this paper is to identify the crucial components of the PEAST algorithm. We believe that recognizing the importance of these components helps other researchers strengthen their population-based and local search methods.
Index Terms—PEAST algorithm, local search, population-based methods, real-world scheduling.
Nico Kyngäs, Kimmo Nurmi, and Jari Kyngäs are with the Satakunta University of Applied Sciences, Tiedepuisto 3, Pori, Finland (e-mail: nico.kyngas@samk.fi, cimmo.nurmi@samk.fi, jari.kyngas@samk.fi).
[PDF]
Cite: Nico Kyngäs, Kimmo Nurmi, and Jari Kyngäs, "Crucial Components of the PEAST Algorithm in Solving Real-World Scheduling Problems," Lecture Notes on Software Engineering vol. 1, no. 3, pp. 230-236, 2013.
![[Click]](http://www.lnse.org/img/lnse_v4n1-n3_ei%28inspec%29_indexscreenshot.jpg){kind=link}
![[Click]](http://www.lnse.org/img/lnse_v3n4_ei%28inspec%29_indexscreenshot.jpg){kind=link}