Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Fitness Landscapes For The Total Tardiness Single Machine Scheduling Problem|
|Abstract:||This paper addresses several issues related to the approximate solution of the Single Machine Scheduling problem with sequence-dependent setup times using metaheuristic methods. Instances with known optimal solution are solved using a memetic algorithm and a multiple start approach. A fitness landscape analysis is also conducted on a subset of instances to understand the behavior of the two approaches during the optimization process. We also present a novel way to create instances with known optimal solutions from the optimally solved asymmetric travelling salesman problem (ATSP) instances. Finally we argue for the test set of instances to be used in future works as a convenient performance benchmark.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.