다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

[신간의 별자리x] 우리/미술, 그리고 ‘슬픔의 박물관’

Differential Evolution (DE) is arguably one of the most powerful and versatile evolutionary optimizers for the continuous parameter spaces in recent times. Almost 5 years have passed since the first comprehensive survey article was published on DE by Das and Suganthan in 2011. Several developments have been reported on various aspects of the algorithm in these 5 years and the research on and with DE have now reached an impressive state. Considering the huge progress of research with DE and its applications in diverse domains of science and technology, we find that it is a high time to provide a critical review of the latest literatures published and also to point out some important future avenues of research. The purpose of this paper is to summarize and organize the information on these current developments on DE. Beginning with a comprehensive foundation of the basic DE family of algorithms, we proceed through the recent proposals on parameter adaptation of DE, DE-based single-objective global optimizers, DE adopted for various optimization scenarios including constrained, large-scale, multi-objective, multi-modal and dynamic optimization, hybridization of DE with other optimizers, and also the multi-faceted literature on applications of DE. The paper also presents a dozen of interesting open problems and future research issues on DE.

Recent advances in differential evolution – An updated survey

Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms.

/pdf/a-comprehensive-survey-on-particle-swarm-optimization-1d380v5xx1.pdf

A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

Contents: Variety and Quality. Variability loss and tolerance. Determining tolerances. Tolerance design and experimental design. Offline and online quality control. Parameter design and tolerance design: case study. Experimental design for smaller is better characteristics. Experimental design for larger is better characteristics. Bypassing the S/N ratio: spring experiment. Experimental design for dynamic characteristics.

Introduction to quality engineering. designing quality into products a

Differential evolution (DE) and particle swarm optimization (PSO) are two formidable population-based optimizers (POs) that follow different philosophies and paradigms, which are successfully and widely applied in scientific and engineering research The hybridization between DE and PSO represents a promising way to create more powerful optimizers, especially for specific problem solving In the past decade, numerous hybrids of DE and PSO have emerged with diverse design ideas from many researchers This paper attempts to comprehensively review the existing hybrids based on DE and PSO with the goal of collection of different ideas to build a systematic taxonomy of hybridization strategies Taking into account five hybridization factors, ie, the relationship between parent optimizers, hybridization level, operating order (OO), type of information transfer (TIT), and type of transferred information (TTI), we propose several classification mechanisms and a versatile taxonomy to differentiate and analyze various hybridization strategies A large number of hybrids, which include the hybrids of DE and PSO and several other representative hybrids, are categorized according to the taxonomy The taxonomy can be utilized not only as a tool to identify different hybridization strategies, but also as a reference to design hybrid optimizers The tradeoff between exploration and exploitation regarding hybridization design is discussed and highlighted Based on the taxonomy proposed, this paper also indicates several promising lines of research that are worthy of devotion in future

/pdf/hybridizing-differential-evolution-and-particle-swarm-bnce5jkiyz.pdf

Hybridizing Differential Evolution and Particle Swarm Optimization to Design Powerful Optimizers: A Review and Taxonomy

Global optimization process can often be divided into two subprocesses: exploration and exploitation. The tradeoff between exploration and exploitation (T:Er&Ei) is crucial in search and optimization, having a great effect on global optimization performance, e.g., accuracy and convergence speed of optimization algorithms. In this paper, definitions of exploration and exploitation are first given based on information correlation among samplings. Then, some general indicators of optimization hardness are presented to characterize problem difficulties. By analyzing a typical contraction-based three-stage optimization process, optimal contraction theorem is presented to show that T:Er&Ei depends on the optimization hardness of problems to be optimized. T:Er&Ei will gradually lean toward exploration as optimization hardness increases. In the case of great optimization hardness, exploration-dominated optimizers outperform exploitation-dominated optimizers. In particular, random sampling will become an outstanding optimizer when optimization hardness reaches a certain degree. Besides, the optimal number of contraction stages increases with optimization hardness. In an optimal contraction way, the whole sampling cost is evenly distributed in all contraction stages, and each contraction takes the same contracting ratio. Furthermore, the characterization of optimization hardness is discussed in detail. The experiments with several typical global optimization algorithms used to optimize three groups of test problems validate the correctness of the conclusions made by T:Er&Ei analysis.

/pdf/optimal-contraction-theorem-for-exploration-exploitation-45mlmhpxz6.pdf

Optimal Contraction Theorem for Exploration–Exploitation Tradeoff in Search and Optimization

The coordination between unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs) is a proactive research topic whose great value of application has attracted vast attention. This paper outlines the motivations for studying the cooperative control of UAVs and UGVs, and attempts to make a comprehensive investigation and analysis on recent research in this field. First, a taxonomy for classification of existing unmanned aerial and ground vehicles systems (UAGVSs) is proposed, and a generalized optimization framework is developed to allow the decision-making problems for different types of UAGVSs to be described in a unified way. By following the proposed taxonomy, we show how different types of UAGVSs can be built to realize the goal of a common task, that is target tracking, and how optimization problems can be formulated for a UAGVS to perform specific tasks. This paper presents an optimization perspective to model and analyze different types of UAGVSs, and serves as a guidance and reference for developing UAGVSs.

Coordination Between Unmanned Aerial and Ground Vehicles: A Taxonomy and Optimization Perspective

A memetic algorithm for path planning of curvature-constrained UAVs performing surveillance of multiple ground targets

In this paper, we propose an efficient rule-based heuristic to solve asset-based dynamic weapon-target assignment (DWTA) problems. The main idea of the proposed heuristic is to utilize the domain knowledge of DWTA problems to directly achieve weapon assignment, without large number of function evaluations. We update the saturation states of constraints in the assignment process to guarantee the feasibility of generated solutions. For the purpose of testing the performance of the proposed heuristic, we build a general Monte Carlo simulation-based DWTA framework. For comparison, we also employ a Monte Carlo method (MCM) to make DWTA decisions in different defense scenarios. From simulations with DWTA instances under different scales, the heuristic has obvious advantages over the MCM with regard to solution quality and computation time. The proposed method can solve large-scale DWTA problems (e.g., those including 100 weapons, 100 targets, and four defense stages) within only a few seconds.

/pdf/an-efficient-rule-based-constructive-heuristic-to-solve-3p0eptm03o.pdf

Bin Xin

Papers

Hybridizing Differential Evolution and Particle Swarm Optimization to Design Powerful Optimizers: A Review and Taxonomy

Optimal Contraction Theorem for Exploration–Exploitation Tradeoff in Search and Optimization

Coordination Between Unmanned Aerial and Ground Vehicles: A Taxonomy and Optimization Perspective

A memetic algorithm for path planning of curvature-constrained UAVs performing surveillance of multiple ground targets

An Efficient Rule-Based Constructive Heuristic to Solve Dynamic Weapon-Target Assignment Problem