Simulated annealing is a metaheuristic that balances exploration and exploitation to solve global optimization problems. However, deal with multi- many-objective problems, this balance needs be improved due diverse factors such as the number of objectives. To issue, work proposes MOSA/D, hybrid framework for multi-objective simulated based on decomposition evolutionary perturbation functions. A...

Abstract We describe the solver that we developed for Sports Timetabling Competition ITC2021, a three-stage simulated annealing approach, makes use of portfolio six different neighborhoods. Five these neighborhoods are taken from literature on round-robin tournament scheduling, whereas last one, denoted as PartialSwapTeamsPhased, is novel contribution and it specifically designed phased version...

Because of its highly combinatorial aspect, its dynamic nature and its practical interest for manufacturing systems, the scheduling problem has been widely studied in the literature by various methods: heuristics, constraint propagation techniques, Constraint Satisfaction Problem formalism, simulated annealing, Taboo search, genetic algorithms, neural networks, etc. This paper deals with the Fl...