Search

The paper presents a study on the efficiency of Ant Colony Communities (ACC) used to solve the Travelling Salesman Problem. The ACC is an approach to parallelize the Ant Colony Optimization algorithm (ACO). An ACC is made up of a Community Server that coordinates the work of a set ant colony clients. Each client implements a classical ACO algorithm. The individual colonies process cargos of data obtained from the server and send them back the as partial results. The paper presents a general description of the ACC concept and describes in details two ways of implementing it. The first one uses an inhomogeneous environment of traditional computers working in an asynchronous mode. The second one uses the homogenous Hadoop environment and the processing is done in a synchronized mode. The performance of the Communities is estimated by low level measures: their power and scalability. The high level measure deals with the length of obtained routes. The paper presents also the taxonomy of parallel implementations of the Ant Colony Optimization. [ABSTRACT FROM AUTHOR]

Consolidation of services is one of the key problems in cloud data centers. It consists of two separate but related issues: Virtual machine (VM) placement and VM migration problems. In this paper, a VMconsolidation scheme is proposed that turns the virtual machine consolidation (VMC) problem into a vector packing optimization problem based on deadlockfree migration (DFM) to minimize the energy consumptions. To solve this NP-hard and computationally infeasible for large data centers problem, a novel algorithm named Chicken Swarm Optimization based on deadlock-free migration (DFM-CSO) algorithm is proposed. The DFM-CSO algorithm is characterized by the 'one-step look-ahead with n-VMs migration in parallel (OSLA-NVMIP)' method, which carries out the VM migration validation and the rearrangement of target physical host, as well as records the migration order for each solution placement, so that VM transfer can be completed according to the migration sequence. The experimental results, for both real and synthetic datasets, show that the proposed algorithm with higher convergence rate is favourable in comparison with the other deadlock-free migration algorithms. [ABSTRACT FROM AUTHOR]

Abstract: This paper presents the development of an optimized fuzzy logic based photovoltaic (PV) energy dispatch controller using a swarm intelligence algorithm The PV system considered is grid-independent and consists of a fuzzy logic controller (FLC), PV arrays, battery storage, and two types of loads: a constant critical load and a time-varying non-critical load. The swarm intelligence applied in this paper is the particle swarm optimization (PSO) algorithm and is used to optimize both membership functions and rule set of the FLC. By using PSO algorithm, the optimized FLC is able to maximize energy to the system loads while also maintaining a higher average state of battery charge. This optimized FLC is then compared with the standard energy dispatch controller, referred to as the “PV-priority” controller. The PV-priority controller attempts to power all loads and then charge the battery resulting on lesser number of days of power to critical loads unlike the optimized FLC. [Copyright &y& Elsevier]

The particle swarm optimization algorithm (PSO) is not good at dealing with discrete optimization problems, and for the krill herd algorithm (KH), the ability of local search is relatively poor. In this paper, we optimized PSO by quantum behavior and optimized KH by simulated annealing, so a new hybrid algorithm, named the annealing krill quantum particle swarm optimization (AKQPSO) algorithm, is proposed, and is based on the annealing krill herd algorithm (AKH) and quantum particle swarm optimization algorithm (QPSO). QPSO has better performance in exploitation and AKH has better performance in exploration, so AKQPSO proposed on this basis increases the diversity of population individuals, and shows better performance in both exploitation and exploration. In addition, the quantum behavior increased the diversity of the population, and the simulated annealing strategy made the algorithm avoid falling into the local optimal value, which made the algorithm obtain better performance. The test set used in this paper is a classic 100-Digit Challenge problem, which was proposed at 2019 IEEE Congress on Evolutionary Computation (CEC 2019), and AKQPSO has achieved better performance on benchmark problems. [ABSTRACT FROM AUTHOR]

Numerous problems encountered in real life cannot be actually formulated as a single objective problem; hence the requirement of Multi-Objective Optimization (MOO) had arisen several years ago. Due to the complexities in such type of problems powerful heuristic techniques were needed, which has been strongly satisfied by Swarm Intelligence (SI) techniques. Particle Swarm Optimization (PSO) has been established in 1995 and became a very mature and most popular domain in SI. Multi-Objective PSO (MOPSO) established in 1999, has become an emerging field for solving MOOs with a large number of extensive literature, software, variants, codes and applications. This paper reviews all the applications of MOPSO in miscellaneous areas followed by the study on MOPSO variants in our next publication. An introduction to the key concepts in MOO is followed by the main body of review containing survey of existing work, organized by application area along with their multiple objectives, variants and further categorized variants. [ABSTRACT FROM AUTHOR]

Abstract: This paper presents a real-value version of particle swarm optimization (PSO) for solving the open vehicle routing problem (OVRP) that is a well-known combinatorial optimization problem. In OVRP a vehicle does not return to the depot after servicing the last customer on a route. A particular decoding method is proposed for implementing PSO for OVRP. In the decoding method, a vector of the customer’s position is constructed in descending order. Then each customer is assigned to a route with taking into account feasibility conditions. Finally one-point move has been applied on constructed routes that seem promising to result in a better solution. Experimental evaluations on benchmark data sets demonstrate the competitiveness of the proposed algorithm. [Copyright &y& Elsevier]

In this paper, an optimal and intelligent multi-focus image fusion algorithm is presented, expected to achieve perfect reconstruction or optimal fusion of multi-focus images with high speed. A synergistic combination of segmentation techniques and binary particle swarm optimization (BPSO) intelligent search strategies is employed in salience analysis of contrast feature-vision system. Also, several evaluations concerning image definition are exploited and used to evaluate the performance of the method proposed. Experiments are performed on a large number of images and the results show that the BPSO algorithm is much faster than the traditional genetic algorithm. The method proposed is also compared with some classical or new fusion methods, such as discrete wavelet-based transform (DWT), nonsubsampled contourlet transform (NSCT), NSCT-PCNN (pulse coupled neural networks (PCNN) method in NSCT domain) and curvelet transform. The simulation results with high accuracy and high speed prove the superiority and effectiveness of the present method. [ABSTRACT FROM AUTHOR]

Novel dual band-notched monopole antenna is proposed in this paper, which is designed by an improved particle swarm optimization algorithm linked with HFSS. By etching a one order Minkowski fractal slot on the radiating patch and introducing a semi-octagon-shaped resonator on the back plane, excellent dual notched frequency bands characteristics of the proposed antenna are achieved. The antenna satisfies the VSWR requirement of less than 2.0 in the frequency band between 2.87 and 12 GHz, except two frequency stop-bands of 3.2–4.01 GHz and 5.55–6.1 GHz. The effects of the key parameters on the dual notched bands are also analyzed. A fairly stable radiation pattern over the frequency range of interest can be obtained. Moreover, measured group delay and transmission characteristics indicate that the antenna has good pulse handling capabilities. [ABSTRACT FROM AUTHOR]