Iaê Santos Bonilha

Dr. Iaê Santos Bonilha


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 December 2021 in Algorithms
Verified
Journal Article
Open access
PDF file
FMFelipe Muller
Felipe Muller
IBIaê Santos Bonilha
Iaê Santos Bonilha
Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the objective of intelligently combining heuristic methods to solve hard optimization problems. Ant colony optimization (ACO) algorithms have been proven to deal with Dynamic Optimization Problems (DOPs) properly. Despite the good results obtained by the integration of local search operators with ACO, little has been done to tackle DOPs. In this research, one of the most reliable ACO schemes, the MAX-MIN Ant System (MMAS), has been integrated with advanced and effective local search operators, resulting in an innovative hyper-heuristic. The local search operators are the Lin–Kernighan (LK) and the Unstringing and Stringing (US) heuristics, and they were intelligently chosen to improve the solution obtained by ACO. The proposed method aims to combine the adaptation capabilities of ACO for DOPs and the good performance of the local search operators chosen in an adaptive way and based on their performance, creating in this way a hyper-heuristic. The travelling salesman problem (TSP) was the base problem to generate both symmetric and asymmetric dynamic test cases. Experiments have shown that the MMAS provides good initial solutions to the local search operators and the hyper-heuristic creates a robust and effective method for the vast majority of test cases.

2 October 2022
Verified
Book Chapter
Closed access
PDF file
MMMichalis Mavrovouniotis
Michalis Mavrovouniotis
GEGeorgios Ellinas
Georgios Ellinas
IBIaê Santos Bonilha
Iaê Santos Bonilha
FMFelipe Muller
Felipe Muller
MPMarios Polycarpou
Marios Polycarpou

29 November 2024 in ARACÊ
Verified
Journal Article
Open access
PDF file
FMFelipe Muller
Felipe Muller
VSVanessa Andréia Schneider
Vanessa Andréia Schneider
IBIaê Santos Bonilha
Iaê Santos Bonilha
VSVeridiane Bárbara de Souza
Veridiane Bárbara de Souza
GCGreici da Rosa Da Cruz
Greici da Rosa Da Cruz
GFGédson Mário Borges Dal Forno
Gédson Mário Borges Dal Forno
This paper deals with the problem of the selection of a set of clients that will receive an offer for one or more products during a promotion campaign. Such campaigns are fundamental marketing tools for improving the economic profit of a firm, either by acquiring new customers or by generating additional revenue from existing customers. We work with a well-known mathematical model for the problem. We add the cannibalism constraint to the problem, which avoids some products to be offered simultaneously, to simulate competing products cannibalizing each other’s market. We propose a hybrid heuristic, the first by combining a Genetic Algorithm (GA) with Tabu Search (TS). Extensive computational experiments were performed on a set of test problems from literature with and without the cannibalism constraint. We compare our method with a TS and a Matheuristic from literature. The hybrid method outperforms the competing methods in all test cases and all sizes of instances.