Spider Search Algorithms for MIMO System and Assessment Using Simatic PCS7

This paper shows two optimization methods that are built on a spider optimization algorithm to enhance the proportional integral and derivative (PID) gain values for multiple-input-multiple-output (MIMO) arrangement which is automated with SIMATIC PCS7 Distributed Control System (SDCS). The leading methodologies are the Spider Search Algorithm (SSA) and Social Spider Optimization (SSO) which is meant primarily for optimizing PID gain values. The SSA is based on foraging strategy of colonial spiders and SSO works on the combined plan of the male and female spiders that removes the episodes of local optimization and exploration elusion. Thus, SSA and SSO are contrived for the ideal fine-tuning of PID conditions in the benchmark MIMO procedure. The system performance is understood by minimizing the integral absolute error (IAE) and the integral square error (ISE) as its objective functions. The time-domain features are examined for the aforesaid methods and thereafter compared with the previous genetic algorithm (GA). The settling time is 60s for the proposed method which is lesser than the other techniques. For illustrating the implemented controller\u27s strength, interference is manually presented in the real-time system. Findings indicate that the SSO surpasses output measures and performance indices beyond the presupposed SSA and GA intervals

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

HEDCOS: High Efficiency Dynamic Combinatorial Optimization System using Ant Colony Optimization algorithm

This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonDynamic combinatorial optimization is gaining popularity among industrial practitioners due to the ever-increasing scale of their optimization problems and efforts to solve them to remain competitive. Larger optimization problems are not only more computationally intense to optimize but also have more uncertainty within problem inputs. If some aspects of the problem are subject to dynamic change, it becomes a Dynamic Optimization Problem (DOP). In this thesis, a High Efficiency Dynamic Combinatorial Optimization System is built to solve challenging DOPs with high-quality solutions. The system is created using Ant Colony Optimization (ACO) baseline algorithm with three novel developments. First, introduced an extension method for ACO algorithm called Dynamic Impact. Dynamic Impact is designed to improve convergence and solution quality by solving challenging optimization problems with a non-linear relationship between resource consumption and fitness. This proposed method is tested against the real-world Microchip Manufacturing Plant Production Floor Optimization (MMPPFO) problem and the theoretical benchmark Multidimensional Knapsack Problem (MKP). Second, a non-stochastic dataset generation method was introduced to solve the dynamic optimization research replicability problem. This method uses a static benchmark dataset as a starting point and source of entropy to generate a sequence of dynamic states. Then using this method, 1405 Dynamic Multidimensional Knapsack Problem (DMKP) benchmark datasets were generated and published using famous static MKP benchmark instances as the initial state. Third, introduced a nature-inspired discrete dynamic optimization strategy for ACO by modelling real-world ants’ symbiotic relationship with aphids. ACO with Aphids strategy is designed to solve discrete domain DOPs with event-triggered discrete dynamism. The strategy improved inter-state convergence by allowing better solution recovery after dynamic environment changes. Aphids mediate the information from previous dynamic optimization states to maximize initial results performance and minimize the impact on convergence speed. This strategy is tested for DMKP and against identical ACO implementations using Full-Restart and Pheromone-Sharing strategies, with all other variables isolated. Overall, Dynamic Impact and ACO with Aphids developments are compounding. Using Dynamic Impact on single objective optimization of MMPPFO, the fitness value was improved by 33.2% over the ACO algorithm without Dynamic Impact. MKP benchmark instances of low complexity have been solved to a 100% success rate even when a high degree of solution sparseness is observed, and large complexity instances have shown the average gap improved by 4.26 times. ACO with Aphids has also demonstrated superior performance over the Pheromone-Sharing strategy in every test on average gap reduced by 29.2% for a total compounded dynamic optimization performance improvement of 6.02 times. Also, ACO with Aphids has outperformed the Full-Restart strategy for large datasets groups, and the overall average gap is reduced by 52.5% for a total compounded dynamic optimization performance improvement of 8.99 times

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Multi-objective optimization for time-based preventive maintenance within the transport network: a review

Preventive maintenance in transportation is essential not only to safeguard billions in business and infrastructure investment, but also to guarantee safety, reliability and efficacy within the network. Government, industry and society have been increasingly recognising the importance of keeping transport units condition well-preserved. The challenge, however, is to achieve optimal performance of the existing transport systems within acceptable costs, effective workforce use and minimum disruption. Those are generally conflicting objectives. Multi-objective optimisation approaches have served as powerful tools to assist stakeholders to properly deploy preventive maintenance in industry. In this study, we review the research conducted in the application of multi-objective optimisation for preventive maintenance in transport-related activities. We focus on time-based preventive maintenance for production, infrastructure, rail and energy providers. In our review, we are interested in aspects such as the types of problems addressed, the existing objectives, the approaches to solutions, and how the outcomes obtained support decision

State estimation and trajectory tracking control for a nonlinear and multivariable bioethanol production system

In this paper a controller is proposed based on linear algebra for a fed-batch bioethanol production process. It involves fnding feed rate profles (control actions obtained as a solution of a linear equations system) in order to make the system follow predefned concentration profles. A neural network states estimation is designed in order to know those variables that cannot be measured. The controller is tuned using a Monte Carlo experiment for which a cost function that penalizes tracking errors is defned. Moreover, several tests (adding parametric uncertainty and perturbations in the control action) are carried out so as to evaluate the controller performance. A comparison with another controller is made. The demonstration of the error convergence, as well as the stability analysis of the neural network, are included.Fil: Fernández, Maria Cecilia. Universidad Nacional de San Juan. Facultad de Ingeniería. Instituto de Ingeniería Química; ArgentinaFil: Pantano, Maria Nadia. Universidad Nacional de San Juan. Facultad de Ingeniería. Instituto de Ingeniería Química; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Rossomando, Francisco Guido. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - San Juan. Instituto de Automática. Universidad Nacional de San Juan. Facultad de Ingeniería. Instituto de Automática; ArgentinaFil: Ortiz, Oscar Alberto. Universidad Nacional de San Juan. Facultad de Ingeniería. Instituto de Ingeniería Química; ArgentinaFil: Scaglia, Gustavo Juan Eduardo. Universidad Nacional de San Juan. Facultad de Ingeniería. Instituto de Ingeniería Química; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentin

Artificial Intelligence Enabled Project Management: A Systematic Literature Review

In the Industry 5.0 era, companies are leveraging the potential of cutting-edge technologies such as artificial intelligence for more efficient and green human-centric production. In a similar approach, project management would benefit from artificial intelligence in order to achieve project goals by improving project performance, and consequently, reaching higher sustainable success. In this context, this paper examines the role of artificial intelligence in emerging project management through a systematic literature review; the applications of AI techniques in the project management performance domains are presented. The results show that the number of influential publications on artificial intelligence-enabled project management has increased significantly over the last decade. The findings indicate that artificial intelligence, predominantly machine learning, can be considerably useful in the management of construction and IT projects; it is notably encouraging for enhancing the planning, measurement, and uncertainty performance domains by providing promising forecasting and decision-making capabilities

New developments in mathematical control and information for fuzzy systems

Hamid Reza Karimi, Mohammed Chadli and Peng Sh