Swarm Intelligence and Evolutionary Techniques for Real World Applications

This work provides a comprehensive list of real-world applications of swarm intelligence and evolutionary computation technique

Hybrid Adaptive Computational Intelligence-based Multisensor Data Fusion applied to real-time UAV autonomous navigation

Nowadays, there is a remarkable world trend in employing UAVs and drones for diverse applications. The main reasons are that they may cost fractions of manned aircraft and avoid the exposure of human lives to risks. Nevertheless, they depend on positioning systems that may be vulnerable. Therefore, it is necessary to ensure that these systems are as accurate as possible, aiming to improve the navigation. In pursuit of this end, conventional Data Fusion techniques can be employed. However, its computational cost may be prohibitive due to the low payload of some UAVs. This paper proposes a Multisensor Data Fusion application based on Hybrid Adaptive Computational Intelligence - the cascaded use of Fuzzy C-Means Clustering (FCM) and Adaptive-Network-Based Fuzzy Inference System (ANFIS) algorithms - that have been shown able to improve the accuracy of current positioning estimation systems for real-time UAV autonomous navigation. In addition, the proposed methodology outperformed two other Computational Intelligence techniques

A shifted hyperbolic augmented Lagrangian-based artificial fish two swarm algorithm with guaranteed convergence for constrained global optimization

This article presents a shifted hyperbolic penalty function and proposes an augmented Lagrangian-based algorithm for non-convex constrained global optimization problems. Convergence to an ε-global minimizer is proved. At each iteration k, the algorithm requires the ε(k)-global minimization of a bound constrained optimization subproblem, where ε(k) → ε. The subproblems are solved by a stochastic population-based metaheuristic that relies on the artificial fish swarm paradigm and a two-swarm strategy. To enhance the speed of convergence, the algorithm invokes the Nelder–Mead local search with a dynamically defined probability. Numerical experiments with benchmark functions and engineering design problems are presented. The results show that the proposed shifted hyperbolic augmented Lagrangian compares favorably with other deterministic and stochastic penalty-based methods.This work was supported by COMPETE [POCI-01-0145-FEDER-007043]; FCT-Fundacao para a Ciencia e Tecnologia within the Project Scope [UID/CEC/00319/2013]; and partially supported by CMAT-Centre of Mathematics of the University of Minho

Determining Additional Modulus of Subgarde Reaction Based on Tolerable Settlement for the Nailed-slab System Resting on Soft Clay.

Abstract—Nailed-slab System is a proposed alternative solution for rigid pavement problem on soft soils. Equivalent modulus of subgrade reaction (k’) can be used in designing of nailed-slab system. This modular is the cumulative of modulus of subgrade reaction from plate load test (k) and additional modulus of subgrade reaction due to pile installing (∆∆∆∆k). A recent method has used reduction of pile resistance approach in determining ∆∆∆∆k. The relative displacement between pile and soils, and reduction of pile resistance has been identified. In fact, determining of reduction of pile resistance is difficult. This paper proposes an approach by considering tolerable settlement of rigid pavement. Validation is carried out with respect to a loading test of nailed-slab models. The models are presented as strip section of rigid pavement. The theory of beams on elastic foundation is used to calculate the slab deflection by using k’. Proposed approach can results in deflection prediction close to observed one. In practice, the Nailed-slab System would be constructed by multiple-row piles. Designing this system based on one-pile row analysis will give more safety design and will consume less time

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words

Recent Development of Hybrid Renewable Energy Systems

Abstract: The use of renewable energies continues to increase. However, the energy obtained from renewable resources is variable over time. The amount of energy produced from the renewable energy sources (RES) over time depends on the meteorological conditions of the region chosen, the season, the relief, etc. So, variable power and nonguaranteed energy produced by renewable sources implies intermittence of the grid. The key lies in supply sources integrated to a hybrid system (HS)