Motion-encoded particle swarm optimization for moving target search using UAVs

This paper presents a novel algorithm named the motion-encoded particle swarm optimization (MPSO) for finding a moving target with unmanned aerial vehicles (UAVs). From the Bayesian theory, the search problem can be converted to the optimization of a cost function that represents the probability of detecting the target. Here, the proposed MPSO is developed to solve that problem by encoding the search trajectory as a series of UAV motion paths evolving over the generation of particles in a PSO algorithm. This motion-encoded approach allows for preserving important properties of the swarm including the cognitive and social coherence, and thus resulting in better solutions. Results from extensive simulations with existing methods show that the proposed MPSO improves the detection performance by 24\% and time performance by 4.71 times compared to the original PSO, and moreover, also outperforms other state-of-the-art metaheuristic optimization algorithms including the artificial bee colony (ABC), ant colony optimization (ACO), genetic algorithm (GA), differential evolution (DE), and tree-seed algorithm (TSA) in most search scenarios. Experiments have been conducted with real UAVs in searching for a dynamic target in different scenarios to demonstrate MPSO merits in a practical application.Comment: Applied Soft Computing, 202

Evaluating the use of a Net-Metering mechanism in microgrids to reducepower generation costs with a swarm-intelligent algorithm

The micro-generation of electricity arises as a clean and efficient alternative to provide electrical power. However, the unpredictability of wind and solar radiation poses a challenge to attend load demand, while maintaining a stable operation of the microgrids (MGs). This paper proposes the modeling and optimization, using a swarm-intelligent algorithm, of a hybrid MG system (HMGS) with a Net-Metering compensation policy. Using real industrial and residential data from a Spanish region, a HMGS with a generic ESS is used to analyze the influence of four different Net-Metering compensation levels regarding costs, percentage of renewable energy sources (RESs), and LOLP. Furthermore, the performance of two ESSs, Lithium Titanate Spinel (Li4Ti5O12 (LTO)) and Vanadium redox flow batteries (VRFB), is assessed in terms of the final $/kWh costs provided by the MG. The results obtained indicate that the Net-Metering policy reduces the surplus from over 14$ dollars of savings, when compared to a MG using a LTO system without Net-Metering.European CommissionAgencia Estatal de InvestigaciónComunidad de Madri

Evolutionary Computation 2020

Intelligent optimization is based on the mechanism of computational intelligence to refine a suitable feature model, design an effective optimization algorithm, and then to obtain an optimal or satisfactory solution to a complex problem. Intelligent algorithms are key tools to ensure global optimization quality, fast optimization efficiency and robust optimization performance. Intelligent optimization algorithms have been studied by many researchers, leading to improvements in the performance of algorithms such as the evolutionary algorithm, whale optimization algorithm, differential evolution algorithm, and particle swarm optimization. Studies in this arena have also resulted in breakthroughs in solving complex problems including the green shop scheduling problem, the severe nonlinear problem in one-dimensional geodesic electromagnetic inversion, error and bug finding problem in software, the 0-1 backpack problem, traveler problem, and logistics distribution center siting problem. The editors are confident that this book can open a new avenue for further improvement and discoveries in the area of intelligent algorithms. The book is a valuable resource for researchers interested in understanding the principles and design of intelligent algorithms

Routing algorithm for the ground team in transmission line inspection using unmanned aerial vehicle

With the rapid development of robotics technology, robots are increasingly used to conduct various tasks by utility companies. An unmanned aerial vehicle (UAV) is an efficient robot that can be used to inspect high-voltage transmission lines. UAVs need to stay within a data transmission range from the ground station and periodically land to replace the battery in order to ensure that the power system can support its operation. A routing algorithm must be used in order to guide the motion and deployment of the ground station while using UAV in transmission line inspection. Most existing routing algorithms are dedicated to pathfinding for a single object that needs to travel from a given start point to end point and cannot be directly used for guiding the ground station deployment and motion since multiple objects (i.e., the UAV and the ground team) whose motions and locations need to be coordinated are involved. In this thesis, we intend to explore the routing algorithm that can be used by utility companies to effectively utilize UAVs in transmission line inspection. Both heuristic and analytical algorithms are proposed to guide the deployment of the ground station and the landing point for UAV power system change. A case study was conducted to validate the effectiveness of the proposed routing algorithm and examine the performance and cost-effectiveness --Abstract, page iii

Uncertainty management in multiobjective hydro-thermal self-scheduling under emission considerations

In this paper, a stochastic multiobjective framework is proposed for a day-ahead short-term Hydro Thermal Self-Scheduling (HTSS) problem for joint energy and reserve markets. An efficient linear formulations are introduced in this paper to deal with the nonlinearity of original problem due to the dynamic ramp rate limits, prohibited operating zones, operating services of thermal plants, multi-head power discharge characteristics of hydro generating units and spillage of reservoirs. Besides, system uncertainties including the generating units\u27 contingencies and price uncertainty are explicitly considered in the stochastic market clearing scheme. For the stochastic modeling of probable multiobjective optimization scenarios, a lattice Monte Carlo simulation has been adopted to have a better coverage of the system uncertainty spectrum. Consequently, the resulting multiobjective optimization scenarios should concurrently optimize competing objective functions including GENeration COmpany\u27s (GENCO\u27s) profit maximization and thermal units\u27 emission minimization. Accordingly, the ε-constraint method is used to solve the multiobjective optimization problem and generate the Pareto set. Then, a fuzzy satisfying method is employed to choose the most preferred solution among all Pareto optimal solutions. The performance of the presented method is verified in different case studies. The results obtained from ε-constraint method is compared with those reported by weighted sum method, evolutionary programming-based interactive Fuzzy satisfying method, differential evolution, quantum-behaved particle swarm optimization and hybrid multi-objective cultural algorithm, verifying the superiority of the proposed approach

Hybrid Advanced Optimization Methods with Evolutionary Computation Techniques in Energy Forecasting

More accurate and precise energy demand forecasts are required when energy decisions are made in a competitive environment. Particularly in the Big Data era, forecasting models are always based on a complex function combination, and energy data are always complicated. Examples include seasonality, cyclicity, fluctuation, dynamic nonlinearity, and so on. These forecasting models have resulted in an over-reliance on the use of informal judgment and higher expenses when lacking the ability to determine data characteristics and patterns. The hybridization of optimization methods and superior evolutionary algorithms can provide important improvements via good parameter determinations in the optimization process, which is of great assistance to actions taken by energy decision-makers. This book aimed to attract researchers with an interest in the research areas described above. Specifically, it sought contributions to the development of any hybrid optimization methods (e.g., quadratic programming techniques, chaotic mapping, fuzzy inference theory, quantum computing, etc.) with advanced algorithms (e.g., genetic algorithms, ant colony optimization, particle swarm optimization algorithm, etc.) that have superior capabilities over the traditional optimization approaches to overcome some embedded drawbacks, and the application of these advanced hybrid approaches to significantly improve forecasting accuracy

Optimal Inventory Control and Distribution Network Design of Multi-Echelon Supply Chains

Optimale Bestandskontrolle und Gestaltung von Vertriebsnetzen mehrstufiger Supply Chains Aufgrund von Global Sourcing, Outsourcing der Produktion und Versorgung weltweiter Kunden innerhalb eines komplexen Vertriebsnetzes, in welchem mehrere Anlagen durch verschiedene Aktivitäten miteinander vernetzt sind, haben die meisten Unternehmen heutzutage immer komplexere Supply Chain-Netzwerke in einer immer unbeständiger werdenden Geschäftsumgebung. Mehr beteiligte Unternehmen in der Wertschöpfungskette bedeuten mehr Knoten und Verbindungen im Netzwerk. Folglich bringt die Globalisierung Komplexität und neue Herausforderungen, obwohl Unternehmen immer stärker von globalen Supply Chains profitieren. In einer solchen Geschäftsumgebung müssen sich die Akteure innerhalb der Supply Chain (SC) auf die effiziente Verwaltung und Koordination des Materialflusses im mehrstufigen System fokussieren, um diesen Herausforderungen handhaben zu können. In vielen Fällen beinhaltet die Supply Chain eines Unternehmens unterschiedliche Entscheidungen auf verschiedenen Planungsebenen, wie der Anlagenstandort, die Bestände und die Verkehrsmittel. Jede dieser Entscheidungen spielt eine bedeutende Rolle hinsichtlich der Gesamtleistung und das Verhältnis zwischen ihnen kann nicht ignoriert werden. Allerdings wurden diese Entscheidungen meist einzeln untersucht. In den letzten Jahren haben zahlreiche Studien die Bedeutung der Integration von beteiligten Entscheidungen in Supply Chains hervorgehoben. In diesem Zusammenhang sollten Entscheidungen über Anlagenstandort, Bestand und Verkehrsmittel gemeinsam in einem Optimierungsproblem des Vertriebsnetzes betrachtet werden, um genauere Ergebnisse für das Gesamtsystem zu erzeugen. Darüber hinaus ist ein effektives Management des Materialflusses über die gesamte Lieferkette hinweg, aufgrund der dynamischen Umgebung mit mehreren Zielen, ein schwieriges Problem. Die Lösungsansätze, die in der Vergangenheit verwendet wurden, um Probleme mehrstufiger Supply Chains zu lösen, basierten auf herkömmlichen Verfahren unter der Verwendung von analytischen Techniken. Diese sind jedoch nicht ausreichend, um die Dynamiken in Lieferketten zu bewältigen, aufgrund ihrer Unfähigkeit, mit den komplexen Interaktionen zwischen den Akteuren der Supply Chain umzugehen und das stochastische Verhalten zu repräsentieren, das in vielen Problemen der realen Welt besteht. Die Simulationsmodellierung ist in letzter Zeit zu einem wichtigen Instrument geworden, da ein analytisches Modell nicht in der Lage ist, ein System abzubilden, das sowohl der Variabilität als auch der Komplexität unterliegt. Allerdings erfordern Simulationen umfangreiche Laufzeiten, um möglichst viele Lösungen zu bewerten und die optimale Lösung für ein definiertes Problem zu finden. Um mit dieser Schwierigkeit umzugehen, muss das Simulationsmodell in Optimierungsalgorithmen integriert werden. In Erwiderung auf die oben genannten Herausforderungen, ist eines der Hauptziele dieser Arbeit, ein Modell und ein Lösungsverfahren für die optimale Gestaltung von Vertriebsnetzwerken integrierter Supply Chains vorzuschlagen, das die Beziehung zwischen den Entscheidungen der verschiedenen Planungsebenen berücksichtigt. Die Problemstellung wird mithilfe von Zielfunktionen formuliert, um die Kundenabdeckung zu maximieren, den maximalen Abstand von den Anlagenstandorten zu den Bedarfspunkten zu minimieren oder die Gesamtkosten zu minimieren. Um die optimale Anzahl, Kapazität und Lage der Anlagen zu bestimmen, kommen der Nondominated Sorting Genetic Algorithm II (NSGA-II) und der Quantum-based Particle Swarm Optimization Algorithm (QPSO) zum Einsatz, um dieses Optimierungsproblem im Spannungsfeld verschiedener Ziele zu lösen. Aufgrund der Komplexität mehrstufiger Systeme und der zugrunde liegenden Unsicherheiten, wurde die Optimierung von Beständen über die gesamte Lieferkette hinweg zur wesentlichen Herausforderung, um die Kosten zu reduzieren und die Serviceanforderungen zu erfüllen. In diesem Zusammenhang ist das andere Ziel dieser Arbeit die Darstellung eines simulationsbasierten Optimierungs-Frameworks, in dem die Simulation, basierend auf der objektorientierten Programmierung, entwickelt wird und die Optimierung metaheuristische Techniken mit unterschiedlichen Kriterien, wie NSGA-II und MOPOSO, verwendet. Insbesondere das geplante Framework regt einen großen Nutzen an, sowohl für das Bestandsoptimierungsproblem in mehrstufigen Supply Chains, als auch für andere Logistikprobleme.Today, most companies have more complex supply chain networks in a more volatile business environment due to global sourcing, outsourcing of production and serving customers all over the world with a complex distribution network that has several facilities linked by various activities. More companies involved within the value chain, means more nodes and links in the network. Therefore, globalization brings complexities and new challenges as enterprises increasingly benefit from global supply chains. In such a business environment, Supply Chain (SC) members must focus on the efficient management and coordination of material flow in the multi-echelon system to handle with these challenges. In many cases, the supply chain of a company includes various decisions at different planning levels, such as facility location, inventory and transportation. Each of these decisions plays a significant role in the overall performance and the relationship between them cannot be ignored. However, these decisions have been mostly studied individually. In recent years, numerous studies have emphasized the importance of integrating the decisions involved in supply chains. In this context, facility location, inventory and transportation decisions should be jointly considered in an optimization problem of distribution network design to produce more accurate results for the whole system. Furthermore, effective management of material flow across a supply chain is a difficult problem due to the dynamic environment with multiple objectives. In the past, the majority of the solution approaches used to solve multi-echelon supply chain problems were based on conventional methods using analytical techniques. However, they are insufficient to cope with the SC dynamics because of the inability to handle to the complex interactions between the SC members and to represent stochastic behaviors existing in many real world problems. Simulation modeling has recently become a major tool since an analytical model is unable to formulate a system that is subject to both variability and complexity. However, simulations require extensive runtime to evaluate many feasible solutions and to find the optimal one for a defined problem. To deal with this problem, simulation model needs to be integrated in optimization algorithms. In response to the aforementioned challenges, one of the primary objectives of this thesis is to propose a model and solution method for the optimal distribution network design of an integrated supply chain that takes into account the relationship between decisions at the different levels of planning horizon. The problem is formulated with objective functions to maximize the customer coverage or minimize the maximal distance from the facilities to the demand points and minimize the total cost. In order to find optimal number, capacity and location of facilities, the Nondominated Sorting Genetic Algorithm II (NSGA-II) and Quantum-based Particle Swarm Optimization Algorithm (QPSO) are employed for solving this multiobjective optimization problem. Due to the complexities of multi-echelon system and the underlying uncertainty, optimizing inventories across the supply chain has become other major challenge to reduce the cost and to meet service requirements. In this context, the other aim of this thesis is to present a simulation-based optimization framework, in which the simulation is developed based on the object-oriented programming and the optimization utilizes multi-objective metaheuristic techniques, such as the well-known NSGA-II and MOPSO. In particular, the proposed framework suggests a great utility for the inventory optimization problem in multi-echelon supply chains, as well as for other logistics-related problems

Applied Metaheuristic Computing

For decades, Applied Metaheuristic Computing (AMC) has been a prevailing optimization technique for tackling perplexing engineering and business problems, such as scheduling, routing, ordering, bin packing, assignment, facility layout planning, among others. This is partly because the classic exact methods are constrained with prior assumptions, and partly due to the heuristics being problem-dependent and lacking generalization. AMC, on the contrary, guides the course of low-level heuristics to search beyond the local optimality, which impairs the capability of traditional computation methods. This topic series has collected quality papers proposing cutting-edge methodology and innovative applications which drive the advances of AMC

A Hybrid Grey based Two Steps Clustering and Firefly Algorithm for Portfolio Selection

Considering the concept of clustering, the main idea of the present study is based on the fact that all stocks for choosing and ranking will not be necessarily in one cluster. Taking the mentioned point into account, this study aims at offering a new methodology for making decisions concerning the formation of a portfolio of stocks in the stock market. To meet this end, Multiple-Criteria Decision-Making, Data Mining, and Multi-objective Optimization were employed. First, candidate stocks were clustered using two-step clustering method. Available stocks in each cluster were independently ranked using grey relational analysis. Firefly algorithm was employed for Pareto analysis of risk and ranking. The results of clustering in the stocks revealed that all candidate stocks were not placed in one cluster. The results of robustness analysis employed in ranking method verified the accuracy of calculations in the grey relational analysis through stock repetition of candidates in each cluster