Josiel Neumann Kuk
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Josiel Neumann Kuk has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Richard Aderbal Goncalves
Midwest State University of Parana (UNICENTRO), Guarapuava, Brazil
8 shared publications - Aurora Pozo
UFPR
6 shared publications - Sandra Mara Guse Scós Venske
UNICENTRO
5 shared publications Carolina P. Almeida
3 shared publications- Lucas Marcondes Pavelski
Federal University of Technology – Paraná (UTFPR)
3 shared publications - Myriam Regattieri Delgado
UTFPR
3 shared publications
Latest Publications
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 7-12
A New Adaptive Operator Selection for NSGA-III Applied to CEC 2018 Many-Objective Benchmark
As well as new algorithms are constantly proposed, new test functions for these algorithms are also designed. In this paper we explore 15 new benchmark functions proposed for CEC-2018 Multiobjective Evolutionary Algorithms (MOEA) Competition for many-objective optimization. The functions have diverse properties which cover a good representation of various real-world scenarios. We propose many-objective approaches that were designed considering three schemes to perform adaptive operator selection with NSGA-III algorithm: Thompson Sampling, Probability Matching and Adaptive Pursuit. They select from a pool of candidates composed by DE mutations and a Genetic Algorithm crossover. Thompson Sampling is a multi-armed bandit approach, i.e., it was designed to deal with the exploration versus exploitation dilemma intrinsic to the adaptive operator selection problem. Its use in a many objective evolutionary algorithm is innovative and constitutes the main contribution of this work. As the CEC-2018 is composed by complex, potentially nonlinear functions, we also perform the analysis of the effects of the insertion of a nonlinear operator within the candidate pool of operators. Statistical analysis of the experiments were performed with Mann-Whitney and Friedman tests. The IGD indicator was used to infer the quality of the solutions. The results indicate the use of Thompson Sampling as an adaptive operator selection is promising and increases the optimization performance of NSGA-III. They also indicate that the use of the nonlinear operator is capable of improving the results of all adaptive versions.
- 1 October 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 7-12
A New Adaptive Operator Selection for NSGA-III Applied to CEC 2018 Many-Objective Benchmark
As well as new algorithms are constantly proposed, new test functions for these algorithms are also designed. In this paper we explore 15 new benchmark functions proposed for CEC-2018 Multiobjective Evolutionary Algorithms (MOEA) Competition for many-objective optimization. The functions have diverse properties which cover a good representation of various real-world scenarios. We propose many-objective approaches that were designed considering three schemes to perform adaptive operator selection with NSGA-III algorithm: Thompson Sampling, Probability Matching and Adaptive Pursuit. They select from a pool of candidates composed by DE mutations and a Genetic Algorithm crossover. Thompson Sampling is a multi-armed bandit approach, i.e., it was designed to deal with the exploration versus exploitation dilemma intrinsic to the adaptive operator selection problem. Its use in a many objective evolutionary algorithm is innovative and constitutes the main contribution of this work. As the CEC-2018 is composed by complex, potentially nonlinear functions, we also perform the analysis of the effects of the insertion of a nonlinear operator within the candidate pool of operators. Statistical analysis of the experiments were performed with Mann-Whitney and Friedman tests. The IGD indicator was used to infer the quality of the solutions. The results indicate the use of Thompson Sampling as an adaptive operator selection is promising and increases the optimization performance of NSGA-III. They also indicate that the use of the nonlinear operator is capable of improving the results of all adaptive versions.
- 12 April 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computational Intelligence Magazine
- Vol. 12 (2) , 34-45
Hyper-Heuristic Based Product Selection for Software Product Line Testing
A Software Product Line (SPL) is defined as a set of software systems that share a common and managed set of features satisfying specific needs of a particular market segment or domain [1]. The SPL offers a number of common artifacts for building products, including mandatory and variable elements. SPL approaches have been adopted by many software companies1 to ease reuse and reduce time and production costs. A feature represents a functionality that is visible to the user and can be designed as a variability, which represents a variable functionality that may or may not be present in a product. On the other hand, mandatory features are common to all SPL products. To facilitate feature management, most SPL methodologies use the Feature Model (FM) [2] to represent all the SPL variabilities and commonalities.
- 12 April 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computational Intelligence Magazine
- Vol. 12 (2) , 34-45
Hyper-Heuristic Based Product Selection for Software Product Line Testing
A Software Product Line (SPL) is defined as a set of software systems that share a common and managed set of features satisfying specific needs of a particular market segment or domain [1]. The SPL offers a number of common artifacts for building products, including mandatory and variable elements. SPL approaches have been adopted by many software companies1 to ease reuse and reduce time and production costs. A feature represents a functionality that is visible to the user and can be designed as a variability, which represents a variable functionality that may or may not be present in a product. On the other hand, mandatory features are common to all SPL products. To facilitate feature management, most SPL methodologies use the Feature Model (FM) [2] to represent all the SPL variabilities and commonalities.
- 19 February 2017
- Published by Springer Nature
- p. 267-281
Adaptive Operator Selection for Many-Objective Optimization with NSGA-III
- 19 February 2017
- Published by Springer Nature
- p. 267-281
Adaptive Operator Selection for Many-Objective Optimization with NSGA-III
- 21 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4135-4142
Product selection based on upper confidence bound MOEA/D-DRA for testing software product lines
The selection of products for testing Software Product Lines (SPLs) is an optimization problem. The goal is to select a possible minimum set of products that satisfies testing criteria, such as, pairwise and mutation testing. Multi-objective Evolutionary Algorithms (MOEAs) have been successfully used to solve this problem and other ones related to software development. However, the use of MOEAs demands setting a number of control parameters and selection of genetic operators, to which the algorithm performance is often very sensitive. Adaptive Operator Selection (AOS) methods, such as Upper Confidence Bound (UCB) based ones can help in this task. UCB methods used with Multi-objective Evolutionary Algorithm Based on Decomposition with Dynamical Resource Allocation (MOEA/D-DRA) have presented promising results, but they are underexplored in the Search Based Software Engineering (SBSE) field. To contribute to this research area and to solve efficiently the product selection problem, this paper investigates the use of different AOS UCB-based methods with MOEA/D-DRA. The idea is to reduce effort spent by the tester. Some parameters and evolutionary operators can be automatically set. The approach is empirical evaluated using four instances and three UCB methods. The UCB methods present similar results and outperform the canonical version of MOEA/D-DRA.
- 21 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4135-4142
Product selection based on upper confidence bound MOEA/D-DRA for testing software product lines
The selection of products for testing Software Product Lines (SPLs) is an optimization problem. The goal is to select a possible minimum set of products that satisfies testing criteria, such as, pairwise and mutation testing. Multi-objective Evolutionary Algorithms (MOEAs) have been successfully used to solve this problem and other ones related to software development. However, the use of MOEAs demands setting a number of control parameters and selection of genetic operators, to which the algorithm performance is often very sensitive. Adaptive Operator Selection (AOS) methods, such as Upper Confidence Bound (UCB) based ones can help in this task. UCB methods used with Multi-objective Evolutionary Algorithm Based on Decomposition with Dynamical Resource Allocation (MOEA/D-DRA) have presented promising results, but they are underexplored in the Search Based Software Engineering (SBSE) field. To contribute to this research area and to solve efficiently the product selection problem, this paper investigates the use of different AOS UCB-based methods with MOEA/D-DRA. The idea is to reduce effort spent by the tester. Some parameters and evolutionary operators can be automatically set. The approach is empirical evaluated using four instances and three UCB methods. The UCB methods present similar results and outperform the canonical version of MOEA/D-DRA.
- 1 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 181-186
Adaptive Operator Selection in NSGA-III
Many-objective optimization (four or more objectives) presents many challenges to be considered, highlighting the need to create better algorithms prepared to deal efficiently with the increasing number of objectives. One such challenge is to determine the most efficient operator or combination of operators to be used during the optimization. In order to deal with this challenge, we propose the use of adaptive operator selection mechanisms in many-objective optimization algorithms. Two adaptive operator selection mechanisms, Adaptive Pursuit (AP) and Probability Matching (PM), are incorporated into the NSGA-III framework (a recently proposed, state-of-the-art algorithm to solve many-objective problems) to autonomously select the most suitable operator while solving a many-objective problem, according to the previous performance of each operator. The proposed algorithms, NSGA-IIIAP and NSGA-IIIPM, are tested in four different multi-objective problems from the DTLZ test suite with 3 up to 20 objectives. Statistical tests were performed to infer the significance of the results. The hypothesis that adaptive ways to select the operator to be applied during each stage of the evolutionary process is an effective way to improve the performance of the NSGA-III framework is corroborated by our results.
- 1 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 181-186
Adaptive Operator Selection in NSGA-III
Many-objective optimization (four or more objectives) presents many challenges to be considered, highlighting the need to create better algorithms prepared to deal efficiently with the increasing number of objectives. One such challenge is to determine the most efficient operator or combination of operators to be used during the optimization. In order to deal with this challenge, we propose the use of adaptive operator selection mechanisms in many-objective optimization algorithms. Two adaptive operator selection mechanisms, Adaptive Pursuit (AP) and Probability Matching (PM), are incorporated into the NSGA-III framework (a recently proposed, state-of-the-art algorithm to solve many-objective problems) to autonomously select the most suitable operator while solving a many-objective problem, according to the previous performance of each operator. The proposed algorithms, NSGA-IIIAP and NSGA-IIIPM, are tested in four different multi-objective problems from the DTLZ test suite with 3 up to 20 objectives. Statistical tests were performed to infer the significance of the results. The hypothesis that adaptive ways to select the operator to be applied during each stage of the evolutionary process is an effective way to improve the performance of the NSGA-III framework is corroborated by our results.
- 1 November 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 7-12
A Hyper-Heuristic for the Environmental/Economic Dispatch Optimization Problem
Hyper-Heuristics are high-level methodologies developed to select or generate heuristics for solving complex problems. Despite their success, there is a lack of multi-objective hyper-heuristics. In the multi-objective optimization context, MOEA/D decomposes a problem into a number of sub problems handled by individuals in a collaborative manner. Our approach, named MOEA/D-HHSW, expands the MOEA/D framework with a multi-objective selection hyper-heuristic. It uses the proposed adaptive choice function with sliding window to determine which low-level heuristic (differential evolution operators) should be applied by each individual during MOEA/D execution. The proposed approach is tested in three known instances of the multi-objective environmental/economic dispatch problem, formulated as a non-linear constrained optimization problem with competing and non-commensurable objectives. MOEA/D-HHSW outperforms state-of-the-art algorithms reported in the literature for all considered instances.
- 1 November 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 7-12
A Hyper-Heuristic for the Environmental/Economic Dispatch Optimization Problem
Hyper-Heuristics are high-level methodologies developed to select or generate heuristics for solving complex problems. Despite their success, there is a lack of multi-objective hyper-heuristics. In the multi-objective optimization context, MOEA/D decomposes a problem into a number of sub problems handled by individuals in a collaborative manner. Our approach, named MOEA/D-HHSW, expands the MOEA/D framework with a multi-objective selection hyper-heuristic. It uses the proposed adaptive choice function with sliding window to determine which low-level heuristic (differential evolution operators) should be applied by each individual during MOEA/D execution. The proposed approach is tested in three known instances of the multi-objective environmental/economic dispatch problem, formulated as a non-linear constrained optimization problem with competing and non-commensurable objectives. MOEA/D-HHSW outperforms state-of-the-art algorithms reported in the literature for all considered instances.
- 24 October 2015
- Published by Springer Nature
- p. 129-138
Decomposition Based Multiobjective Hyper Heuristic with Differential Evolution
- 24 October 2015
- Published by Springer Nature
- p. 129-138
Decomposition Based Multiobjective Hyper Heuristic with Differential Evolution
- 1 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
MOEA/D with adaptive operator selection for the environmental/economic dispatch problem
Adaptive Operator Selection (AOS) is a method used to dynamically determine which operator should be applied in an optimization algorithm based on its performance history. Upper Confidence Bound (UCB) algorithms have been successfully applied for this task due to its ability to tackle the Exploration versus Exploitation (EvE) dilemma presented on AOS. However, it is important to note that the use of UCB algorithms for AOS is still incipient on Multiobjective Evolutionary Algorithms (MOEAs) and many contributions can be made. The aim of this paper is to extend the study of UCB based AOS methods, applying it to a real world problem: the Environmental/Economic Load Dispatch (EELD). Three methods are proposed: MOEA/D-UCB1, MOEA/D-UCB-T and MOEA/D-UCB-V. In these proposals the UCB-based algorithms from the Multi-Armed Bandit (MAB) literature are combined with MOEA/D (MOEA based on decomposition), one of the most successful MOEAs. A pool of operators composed of four Differential Evolution operators is used. The proposed approaches are evaluated in three known instances of the multi-objective environmental/economic dispatch problem, formulated as a nonlinear constrained optimization problem with competing objectives. Experimental results demonstrate that MOEA/D-UCB1 and MOEA/D-UCB-T can be favorably compared with state-of-the-art algorithms reported in the literature for all considered instances.
- 1 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
MOEA/D with adaptive operator selection for the environmental/economic dispatch problem
Adaptive Operator Selection (AOS) is a method used to dynamically determine which operator should be applied in an optimization algorithm based on its performance history. Upper Confidence Bound (UCB) algorithms have been successfully applied for this task due to its ability to tackle the Exploration versus Exploitation (EvE) dilemma presented on AOS. However, it is important to note that the use of UCB algorithms for AOS is still incipient on Multiobjective Evolutionary Algorithms (MOEAs) and many contributions can be made. The aim of this paper is to extend the study of UCB based AOS methods, applying it to a real world problem: the Environmental/Economic Load Dispatch (EELD). Three methods are proposed: MOEA/D-UCB1, MOEA/D-UCB-T and MOEA/D-UCB-V. In these proposals the UCB-based algorithms from the Multi-Armed Bandit (MAB) literature are combined with MOEA/D (MOEA based on decomposition), one of the most successful MOEAs. A pool of operators composed of four Differential Evolution operators is used. The proposed approaches are evaluated in three known instances of the multi-objective environmental/economic dispatch problem, formulated as a nonlinear constrained optimization problem with competing objectives. Experimental results demonstrate that MOEA/D-UCB1 and MOEA/D-UCB-T can be favorably compared with state-of-the-art algorithms reported in the literature for all considered instances.
- 18 March 2015
- Published by Springer Nature
- p. 94-108
MOEA/D-HH: A Hyper-Heuristic for Multi-objective Problems
- 18 March 2015
- Published by Springer Nature
- p. 94-108
MOEA/D-HH: A Hyper-Heuristic for Multi-objective Problems