Title Iterated Greedy Algorithms: Foundations and results Seminar

In this talk we introduce the Iterated Greedy (IG) methods which have resulted in state-of-the-art performance for several combinatorial optimization problems despite their simplicity. We will start from the origins of the methodology, its basic configuration with solution initialization, destruction operator, reconstruction and local search as well as initial results. We will also comment on extensions to populations and more complex local search based on variable neighborhood search. We will comment on the advantages and drawbacks of the technique while discussing results obtained in different optimization problems of increasing difficulty, with special emphasis on machine scheduling optimization.