Accelerating ant colony optimization by using local search

This thesis report is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2015.Cataloged from PDF version of thesis report.Includes bibliographical references (page 42-45).Optimization is very important fact in terms of taking decision in mathematics, statistics, computer science and real life problem solving or decision making application. Many different optimization techniques have been developed for solving such functional problem. In order to solving various problem computer Science introduce evolutionary optimization algorithm and their hybrid. In recent years, test functions are using to validate new optimization algorithms and to compare the performance with other existing algorithm. There are many Single Object Optimization algorithm proposed earlier. For example: ACO, PSO, ABC. ACO is a popular optimization technique for solving hard combination mathematical optimization problem. In this paper, we run ACO upon five benchmark function and modified the parameter of ACO in order to perform SBX crossover and polynomial mutation. The proposed algorithm SBXACO is tested upon some benchmark function under both static and dynamic to evaluate performances. We choose wide range of benchmark function and compare results with existing DE and its hybrid DEahcSPX from other literature are also presented here.Nabila TabassumMaruful HaqueB. Computer Science and Engineerin

State-of-the-art in aerodynamic shape optimisation methods

Aerodynamic optimisation has become an indispensable component for any aerodynamic design over the past 60 years, with applications to aircraft, cars, trains, bridges, wind turbines, internal pipe flows, and cavities, among others, and is thus relevant in many facets of technology. With advancements in computational power, automated design optimisation procedures have become more competent, however, there is an ambiguity and bias throughout the literature with regards to relative performance of optimisation architectures and employed algorithms. This paper provides a well-balanced critical review of the dominant optimisation approaches that have been integrated with aerodynamic theory for the purpose of shape optimisation. A total of 229 papers, published in more than 120 journals and conference proceedings, have been classified into 6 different optimisation algorithm approaches. The material cited includes some of the most well-established authors and publications in the field of aerodynamic optimisation. This paper aims to eliminate bias toward certain algorithms by analysing the limitations, drawbacks, and the benefits of the most utilised optimisation approaches. This review provides comprehensive but straightforward insight for non-specialists and reference detailing the current state for specialist practitioners

Intelligent Decision Making Using Evolutionary System for Optimizing Product-Mix Model

The development and deployment of managerial decision support system represents an emerging trend in the business and organizational field in which the increased application of Decision Support Systems (DSS) can be compiling by Intelligent Systems (IS). Decision Support Systems (DSS) are a specific class of computerized information system that supports business and organizational decision-making activities. A properly designed DSS is an interactive software-based system intended to help decision makers compile useful information from raw data, documents, personal knowledge, and/or business models to identify and solve problems and make decisions. Competitive business pressures and a desire to leverage existing information technology investments have led many firms to explore the benefits of evolutionary system data management solutions such as Particle Swarm Optimization (PSO) and Genetic Algorithm (GA). This study proposes a new model for product mix problem based on evolutionary system for optimizing constraint values as well as objective function. The formulations of the objective function for the minimization problem. This technology is designed to help businesses to finding multi objective functions

A new evolutionary search strategy for global optimization of high-dimensional problems

Global optimization of high-dimensional problems in practical applications remains a major challenge to the research community of evolutionary computation. The weakness of randomization-based evolutionary algorithms in searching high-dimensional spaces is demonstrated in this paper. A new strategy, SP-UCI is developed to treat complexity caused by high dimensionalities. This strategy features a slope-based searching kernel and a scheme of maintaining the particle population's capability of searching over the full search space. Examinations of this strategy on a suite of sophisticated composition benchmark functions demonstrate that SP-UCI surpasses two popular algorithms, particle swarm optimizer (PSO) and differential evolution (DE), on high-dimensional problems. Experimental results also corroborate the argument that, in high-dimensional optimization, only problems with well-formative fitness landscapes are solvable, and slope-based schemes are preferable to randomization-based ones. © 2011 Elsevier Inc. All rights reserved

Solving Unconstrained Global Optimization Problems via Hybrid Swarm Intelligence Approaches

Stochastic global optimization (SGO) algorithms such as the particle swarm optimization (PSO) approach have become popular for solving unconstrained global optimization (UGO) problems. The PSO approach, which belongs to the swarm intelligence domain, does not require gradient information, enabling it to overcome this limitation of traditional nonlinear programming methods. Unfortunately, PSO algorithm implementation and performance depend on several parameters, such as cognitive parameter, social parameter, and constriction coefficient. These parameters are tuned by using trial and error. To reduce the parametrization of a PSO method, this work presents two efficient hybrid SGO approaches, namely, a real-coded genetic algorithm-based PSO (RGA-PSO) method and an artificial immune algorithm-based PSO (AIA-PSO) method. The specific parameters of the internal PSO algorithm are optimized using the external RGA and AIA approaches, and then the internal PSO algorithm is applied to solve UGO problems. The performances of the proposed RGA-PSO and AIA-PSO algorithms are then evaluated using a set of benchmark UGO problems. Numerical results indicate that, besides their ability to converge to a global minimum for each test UGO problem, the proposed RGA-PSO and AIA-PSO algorithms outperform many hybrid SGO algorithms. Thus, the RGA-PSO and AIA-PSO approaches can be considered alternative SGO approaches for solving standard-dimensional UGO problems

Comparison of different redispatch optimization strategies

In den letzten Jahren hat die Häufigkeit des Auftretens von Engpässen in den elektrischen Übertragungsnetzen stark zugenommen, weil die Stromnetze ursprünglich für die aktu-elle Energiemenge und deren starke Schwankung nicht ausgelegt sind. Darüber hinaus bringen die weiter steigende Nutzung der erneuerbaren dezentralen Energiequellen, die zunehmende Netzkomplexität, die Abschaltung konventioneller Kraftwerke, Progno-sefehler und der starke Wettbewerb auf dem Strommarkt die elektrischen Netze immer öfter an ihre Übertragungsgrenzen. Daher ist die Gefahr von Engpässen permanent ge-stiegen, insbesondere in Mitteleuropa. Wenn ein Engpass im Stromnetz entstanden ist, sind die Übertragungsnetzbetreiber ver-pflichtet, eine geeignete Abhilfemaßnahme so schnell wie möglich anzuwenden, um ihn zu beseitigen, z. B. durch den deutschlandweit verbreiteten Redispatch. Allerdings kann diese Gegenmaßnahme hohe Kosten für die Übertragungsnetzbetreiber verursachen, die zum Schluss die Stromverbraucher zahlen müssen. Deswegen ist die Realisierung eines kosten- und technisch effizienten Redispatches ein sehr wichtiges Thema des Netzbe-triebs geworden. Daher ist das Hauptziel dieser Arbeit, unterschiedliche Möglichkeiten und Ansätze für eine kostengünstige Redispatchumsetzung bei Entstehung der Engpässe zu entwickeln. Dafür werden verschiedene numerische und metaheuristische Optimierungsmethoden hinsichtlich ihrer Komplexität, Effizienz, Verlässlichkeit, Detaillierung und Rechenzeit verglichen und durch ein kleines Netzmodell sowie durch ein vereinfachtes ENTSO-E-Netzmodell verifiziert. Schließlich werden die Übertragungsnetzbetreiber durch die Erkenntnisse in dieser Arbeit in die Lage versetzt, ihre Stromnetze effizienter zu betreiben, in dem der Redispatchpro-zess verbessert wird. Dabei werden die hohen Redispatchkosten, insbesondere in Deutschland, deutlich gesenkt.In the recent years, line congestions in the electric transmission networks occur quite fre-quently due to the power grids were not originally designed for the current amount of energy and its strong fluctuation. Furthermore, the increasing utilization of renewable distributed energy sources, growth of the network complexity, reduction of the conven-tional power plant utilization, forecast errors and strong electricity market competition frequently bring the power grids to their transmission limits as well. Therefore, the risk of congestions has permanently increased, especially in central Europe. If a line congestion occurs in the electric network, the transmission system operator has to apply a suitable remedial action to overcome the problem as fast as possible, e.g by utilization of redispatch, which is very common in Germany. However, this measure can cause high costs for the transmission network operators. For this reason, the realization of an economically efficient and optimal redispatching has become very important issue in the power system operation. The main goal of this work is a consideration and development of various possibilities and methods for realization of a technically sound and cost-efficient redispatch in case of network congestions. Therefore, different numerical and metaheuristic optimization tech-niques are implemented, compared with respect to their complexity, efficiency, reliabil-ity, simulation time etc. and verified through a small test grid and simplified ENTSO-E network model. Furthermore, it is shown which technical and economic aspects of redispatching have a major influence on its realization and should always be taken into account or can be ne-glected while solving the redispatch optimization problem. Here, different approaches of the network sensitivity analysis are evaluated and compared as well. Finally, the transmission network operators can use the knowledge and results of this work to improve the current redispatch realization in their power grids, and thus to reduce the redispatch costs, which are especially high in Germany