1,595 research outputs found
A Reinforcement Learning-assisted Genetic Programming Algorithm for Team Formation Problem Considering Person-Job Matching
An efficient team is essential for the company to successfully complete new
projects. To solve the team formation problem considering person-job matching
(TFP-PJM), a 0-1 integer programming model is constructed, which considers both
person-job matching and team members' willingness to communicate on team
efficiency, with the person-job matching score calculated using intuitionistic
fuzzy numbers. Then, a reinforcement learning-assisted genetic programming
algorithm (RL-GP) is proposed to enhance the quality of solutions. The RL-GP
adopts the ensemble population strategies. Before the population evolution at
each generation, the agent selects one from four population search modes
according to the information obtained, thus realizing a sound balance of
exploration and exploitation. In addition, surrogate models are used in the
algorithm to evaluate the formation plans generated by individuals, which
speeds up the algorithm learning process. Afterward, a series of comparison
experiments are conducted to verify the overall performance of RL-GP and the
effectiveness of the improved strategies within the algorithm. The
hyper-heuristic rules obtained through efficient learning can be utilized as
decision-making aids when forming project teams. This study reveals the
advantages of reinforcement learning methods, ensemble strategies, and the
surrogate model applied to the GP framework. The diversity and intelligent
selection of search patterns along with fast adaptation evaluation, are
distinct features that enable RL-GP to be deployed in real-world enterprise
environments.Comment: 16 page
Advances in Evolutionary Algorithms
With the recent trends towards massive data sets and significant computational power, combined with evolutionary algorithmic advances evolutionary computation is becoming much more relevant to practice. Aim of the book is to present recent improvements, innovative ideas and concepts in a part of a huge EA field
A Survey on Evolutionary Computation for Computer Vision and Image Analysis: Past, Present, and Future Trends
Computer vision (CV) is a big and important field
in artificial intelligence covering a wide range of applications.
Image analysis is a major task in CV aiming to extract, analyse
and understand the visual content of images. However, imagerelated
tasks are very challenging due to many factors, e.g., high
variations across images, high dimensionality, domain expertise
requirement, and image distortions. Evolutionary computation
(EC) approaches have been widely used for image analysis with
significant achievement. However, there is no comprehensive
survey of existing EC approaches to image analysis. To fill
this gap, this paper provides a comprehensive survey covering
all essential EC approaches to important image analysis tasks
including edge detection, image segmentation, image feature
analysis, image classification, object detection, and others. This
survey aims to provide a better understanding of evolutionary
computer vision (ECV) by discussing the contributions of different
approaches and exploring how and why EC is used for
CV and image analysis. The applications, challenges, issues, and
trends associated to this research field are also discussed and
summarised to provide further guidelines and opportunities for
future research
Evolutionary Computation
This book presents several recent advances on Evolutionary Computation, specially evolution-based optimization methods and hybrid algorithms for several applications, from optimization and learning to pattern recognition and bioinformatics. This book also presents new algorithms based on several analogies and metafores, where one of them is based on philosophy, specifically on the philosophy of praxis and dialectics. In this book it is also presented interesting applications on bioinformatics, specially the use of particle swarms to discover gene expression patterns in DNA microarrays. Therefore, this book features representative work on the field of evolutionary computation and applied sciences. The intended audience is graduate, undergraduate, researchers, and anyone who wishes to become familiar with the latest research work on this field
Multi-objective Optimization in Traffic Signal Control
Traffic Signal Control systems are one of the most popular Intelligent Transport Systems and they are widely used around the world to regulate traffic flow. Recently, complex optimization techniques have been applied to traffic signal control systems to improve their performance. Traffic simulators are one of the most popular tools to evaluate the performance of a potential solution in traffic signal optimization. For that reason, researchers commonly optimize traffic signal timing by using simulation-based approaches. Although evaluating solutions using microscopic traffic simulators has several advantages, the simulation is very time-consuming.
Multi-objective Evolutionary Algorithms (MOEAs) are in many ways superior to traditional search methods. They have been widely utilized in traffic signal optimization problems. However, running MOEAs on traffic optimization problems using microscopic traffic simulators to estimate the effectiveness of solutions is time-consuming. Thus, MOEAs which can produce good solutions at a reasonable processing time, especially at an early stage, is required. Anytime behaviour of an algorithm indicates its ability to provide as good a solution as possible at any time during its execution. Therefore, optimization approaches which have good anytime behaviour are desirable in evaluation traffic signal optimization. Moreover, small population sizes are inevitable for scenarios where processing capabilities are limited but require quick response times. In this work, two novel optimization algorithms are introduced that improve anytime behaviour and can work effectively with various population sizes.
NS-LS is a hybrid of Non-dominated Sorting Genetic Algorithm II (NSGA-II) and a local search which has the ability to predict a potential search direction. NS-LS is able to produce good solutions at any running time, therefore having good anytime behaviour. Utilizing a local search can help to accelerate the convergence rate, however, computational cost is not considered in NS-LS. A surrogate-assisted approach based on local search (SA-LS) which is an enhancement of NS-LS is also introduced. SA-LS uses a surrogate model constructed using solutions which already have been evaluated by a traffic simulator in previous generations.
NS-LS and SA-LS are evaluated on the well-known Benchmark test functions: ZDT1 and ZDT2, and two real-world traffic scenarios: Andrea Costa and Pasubio. The proposed algorithms are also compared to NSGA-II and Multiobjective Evolutionary Algorithm based on Decomposition (MOEA/D). The results show that NS-LS and SA-LS can effectively optimize traffic signal timings of the studied scenarios. The results also confirm that NS-LS and SA-LS have good anytime behaviour and can work well with different population sizes. Furthermore, SA-LS also showed to produce mostly superior results as compared to NS-LS, NSGA-II, and MOEA/D.Ministry of Education and Training - Vietna
Enhancing SAEAs with Unevaluated Solutions: A Case Study of Relation Model for Expensive Optimization
Surrogate-assisted evolutionary algorithms (SAEAs) hold significant
importance in resolving expensive optimization problems~(EOPs). Extensive
efforts have been devoted to improving the efficacy of SAEAs through the
development of proficient model-assisted selection methods. However, generating
high-quality solutions is a prerequisite for selection. The fundamental
paradigm of evaluating a limited number of solutions in each generation within
SAEAs reduces the variance of adjacent populations, thus impacting the quality
of offspring solutions. This is a frequently encountered issue, yet it has not
gained widespread attention. This paper presents a framework using unevaluated
solutions to enhance the efficiency of SAEAs. The surrogate model is employed
to identify high-quality solutions for direct generation of new solutions
without evaluation. To ensure dependable selection, we have introduced two
tailored relation models for the selection of the optimal solution and the
unevaluated population. A comprehensive experimental analysis is performed on
two test suites, which showcases the superiority of the relation model over
regression and classification models in the selection phase. Furthermore, the
surrogate-selected unevaluated solutions with high potential have been shown to
significantly enhance the efficiency of the algorithm.Comment: 18 pages, 9 figure
Computational Intelligence for Solving Complex Optimization Problems
Complex optimization issues may now be solved using computational intelligence (CI), which has shown to be a powerful and diverse discipline. Traditional optimization approaches frequently struggle to offer efficient and effective solutions because real-world situations are becoming more complicated. Evolutionary algorithms, neural networks, fuzzy systems, and swarm intelligence are just a few examples of the many methods that fall under the umbrella of computational intelligence and are inspired by both natural and artificial intelligence. This abstract examines how computational intelligence techniques are used to solve complicated optimization issues, highlighting their benefits, drawbacks, and most recent developments. In this, computational intelligence techniques provide a potent and adaptable solution for resolving challenging optimization issues. They are highly adapted for dealing with the non-linear connections, uncertainties, and multi-objective situations that arise in real-world problems. The limits of computational intelligence have recently been pushed by recent developments in hybrid techniques and metaheuristics, even if obstacles in algorithm design and parameter tuning still exist. Computational intelligence is anticipated to play an increasingly significant role in tackling complicated optimization issues and fostering innovation across a variety of disciplines as technology continues to advance
An Optimized Type-2 Self-Organizing Fuzzy Logic Controller Applied in Anesthesia for Propofol Dosing to Regulate BIS
During general anesthesia, anesthesiologists who provide anesthetic dosage traditionally play a fundamental role to regulate Bispectral Index (BIS). However, in this paper, an optimized type-2 Self-Organizing Fuzzy Logic Controller (SOFLC) is designed for Target Controlled Infusion (TCI) pump related to propofol dosing guided by BIS, to realize automatic control of general anesthesia. The type-2 SOFLC combines a type-2 fuzzy logic controller with a self-organizing (SO) mechanism to facilitate online training while able to contend with operational uncertainties. A novel data driven Surrogate Model (SM) and Genetic Programming (GP) based strategy is introduced for optimizing the type-2 SOFLC parameters offline to handle inter-patient variability. A pharmacological model is built for simulation in which different optimization strategies are tested and compared. Simulation results are presented to demonstrate the applicability of our approach and show that the proposed optimization strategy can achieve better control performance in terms of steady state error and robustness
Evolutionary Dynamic Optimization and Machine Learning
Evolutionary Computation (EC) has emerged as a powerful field of Artificial
Intelligence, inspired by nature's mechanisms of gradual development. However,
EC approaches often face challenges such as stagnation, diversity loss,
computational complexity, population initialization, and premature convergence.
To overcome these limitations, researchers have integrated learning algorithms
with evolutionary techniques. This integration harnesses the valuable data
generated by EC algorithms during iterative searches, providing insights into
the search space and population dynamics. Similarly, the relationship between
evolutionary algorithms and Machine Learning (ML) is reciprocal, as EC methods
offer exceptional opportunities for optimizing complex ML tasks characterized
by noisy, inaccurate, and dynamic objective functions. These hybrid techniques,
known as Evolutionary Machine Learning (EML), have been applied at various
stages of the ML process. EC techniques play a vital role in tasks such as data
balancing, feature selection, and model training optimization. Moreover, ML
tasks often require dynamic optimization, for which Evolutionary Dynamic
Optimization (EDO) is valuable. This paper presents the first comprehensive
exploration of reciprocal integration between EDO and ML. The study aims to
stimulate interest in the evolutionary learning community and inspire
innovative contributions in this domain
- …