@InProceedings{BarbosaSenn:2019:HeOrRa,
               author = "Barbosa, Eduardo Batista de Moraes and Senne, Edson L. F.",
          affiliation = "{Instituto Nacional de Pesquisas Espaciais (INPE)} and 
                         {Universidade Estadual Paulista (UNESP)}",
                title = "A heuristic oriented racing algorithm for the fine-tuning of 
                         metaheuristics",
            booktitle = "Proceedings...",
                 year = "2019",
         organization = "Metaheuristics International Conference",
             abstract = "The metaheuristics have become a powerful tool to solve real-world 
                         optimization problems. Its ease adaptability, usually demands 
                         effort to correctly define its components (e.g.: problem 
                         representation, neighborhood structure, etc.) and parameters to 
                         achieve their best performance. Thus, this paper aims to present 
                         an approach on the fine-tuning of metaheuristics combining Design 
                         of Experiments and Racing algorithms. The key idea is a heuristic 
                         method, which explores a search space of parameters looking for 
                         candidate configurations near of a promising alternative and 
                         consistently finds the good ones. To confirm this approach, we 
                         present a case study for fine-tuning a VNS metaheuristic on the 
                         classical Traveling Salesman Problem, and compare its results 
                         against a well established racing method. In general, our approach 
                         proved to be effective in terms of the overall time of the tuning 
                         process.",
  conference-location = "Cartagena, Colombia",
      conference-year = "28-31 July",
             language = "en",
           targetfile = "Barbosa_heuristic.pdf",
        urlaccessdate = "26 abr. 2024"
}