•Much is disclosed about the paradigm, theory, and development of PSO.•Relevant neighborhood topologies, fitness landscapes, and variants are addressed.•Various PSO-based complex optimization ...scenarios are discussed.•Key PSO practices are introduced to facilitate further future implementation.•A set of interesting open issues and potential future research lines are put forward.
Over the ages, nature has constantly been a rich source of inspiration for science, with much still to discover about and learn from. Swarm Intelligence (SI), a major branch of artificial intelligence, was rendered to model the collective behavior of social swarms in nature. Ultimately, Particle Swarm Optimization algorithm (PSO) is arguably one of the most popular SI paradigms. Over the past two decades, PSO has been applied successfully, with good return as well, in a wide variety of fields of science and technology with a wider range of complex optimization problems, thereby occupying a prominent position in the optimization field. However, through in-depth studies, a number of problems with the algorithm have been detected and identified; e.g., issues regarding convergence, diversity, and stability. Consequently, since its birth in the mid-1990s, PSO has witnessed a myriad of enhancements, extensions, and variants in various aspects of the algorithm, specifically after the twentieth century, and the related research has therefore now reached an impressive state. In this paper, a rigorous yet systematic review is presented to organize and summarize the information on the PSO algorithm and the developments and trends of its most basic as well as of some of the very notable implementations that have been introduced recently, bearing in mind the coverage of paradigm, theory, hybridization, parallelization, complex optimization, and the diverse applications of the algorithm, making it more accessible. Ease for researchers to determine which PSO variant is currently best suited or to be invented for a given optimization problem or application. This up-to-date review also highlights the current pressing issues and intriguing open challenges haunting PSO, prompting scholars and researchers to conduct further research both on the theory and application of the algorithm in the forthcoming years.
This book presents an interesting sample of the latest advances in optimization techniques applied to electrical power engineering. It covers a variety of topics from various fields, ranging from ...classical optimization such as Linear and Nonlinear Programming and Integer and Mixed-Integer Programming to the most modern methods based on bio-inspired metaheuristics. The featured papers invite readers to delve further into emerging optimization techniques and their real application to case studies such as conventional and renewable energy generation, distributed generation, transport and distribution of electrical energy, electrical machines and power electronics, network optimization, intelligent systems, advances in electric mobility, etc.
This book presents an interesting sample of the latest advances in optimization techniques applied to electrical power engineering. It covers a variety of topics from various fields, ranging from ...classical optimization such as Linear and Nonlinear Programming and Integer and Mixed-Integer Programming to the most modern methods based on bio-inspired metaheuristics. The featured papers invite readers to delve further into emerging optimization techniques and their real application to case studies such as conventional and renewable energy generation, distributed generation, transport and distribution of electrical energy, electrical machines and power electronics, network optimization, intelligent systems, advances in electric mobility, etc.
Resisting efficiency’s overreach Greenbaum, Dov; Gerstein, Mark
Science (American Association for the Advancement of Science),
09/2023, Volume:
381, Issue:
6663
Journal Article
Peer reviewed
Society’s obsession with optimization has a cost, argues a mathematical modeler
Additional Cover Liu, Jun; Li, Renfu; Wang, Kun ...
International journal for numerical methods in engineering,
11/2022, Volume:
123, Issue:
22
Journal Article
Peer reviewed
Open access
The cover image is based on the Research Article Net‐based thermal‐fluid model and hybrid optimization of cooling channels by Jun Liu et al., https://doi.org/10.1002/nme.7075.
Featured Cover Zhang, Yiming; Wang, Xueya; Wang, Xinquan ...
International journal for numerical methods in engineering,
11/2022, Volume:
123, Issue:
22
Journal Article
Peer reviewed
Open access
The cover image is based on the Research Article Virtual displacement based discontinuity layout optimization by Yiming Zhang et al., https://doi.org/10.1002/nme.7084.
Over recent decades, the field of mobile robot path planning has evolved significantly, driven by the pursuit of enhanced navigation solutions. The need to determine optimal trajectories within ...complex environments has led to the exploration of diverse path planning methodologies. This paper focuses on a specific subset: Bio-inspired Population-based Optimization (BPO) methodologies. BPO methods play a pivotal role in generating efficient paths for path planning. Amidst the abundance of optimization approaches over the past decade, only a fraction of studies have effectively integrated these methods into path planning strategies. This paper focus is on the years 2014-2023, reviewing BPO techniques applied to mobile robot path planning challenges. Contributions include a comprehensive review of recent BPO methods in mobile robot path planning, along with an experimental methodology for method comparison under consistent conditions. This encompasses the same environment, initial conditions, and replicates. A multi-objective function is incorporated to evaluate optimization methods. The paper delves into key concepts, mathematical models, and algorithm implementations of examined optimization techniques. The experimental setup, methodology, and benchmarking performance results are discussed. In conclusion, this paper reviews recent BPO algorithms and introduces a standardized approach for benchmarking BPO algorithms, providing insights into their strengths and challenges in mobile robot path planning.
Complex continuous optimization problems widely exist nowadays due to the fast development of the economy and society. Moreover, the technologies like Internet of things, cloud computing, and big ...data also make optimization problems with more challenges including
M
any-dimensions,
M
any-changes,
M
any-optima,
M
any-constraints, and
M
any-costs. We term these as 5-M challenges that exist in large-scale optimization problems, dynamic optimization problems, multi-modal optimization problems, multi-objective optimization problems, many-objective optimization problems, constrained optimization problems, and expensive optimization problems in practical applications. The evolutionary computation (EC) algorithms are a kind of promising global optimization tools that have not only been widely applied for solving traditional optimization problems, but also have emerged booming research for solving the above-mentioned complex continuous optimization problems in recent years. In order to show how EC algorithms are promising and efficient in dealing with the 5-M complex challenges, this paper presents a comprehensive survey by proposing a novel taxonomy according to the function of the approaches, including
reducing problem difficulty
,
increasing algorithm diversity
,
accelerating convergence speed
,
reducing running time
, and
extending application field
. Moreover, some future research directions on using EC algorithms to solve complex continuous optimization problems are proposed and discussed. We believe that such a survey can draw attention, raise discussions, and inspire new ideas of EC research into complex continuous optimization problems and real-world applications.
PDF
