Evolutionary and Reinforcement Fuzzy Control

Many modern and classical techniques exist for the design of control systems. However, many real world applications are inherently complex and the application of traditional design and control techniques is limited. In addition, no single design method exists which can be applied to all types of system. Due to this 'deficiency', recent years have seen an exponential increase in the use of methods loosely termed 'computational intelligent techniques' or 'soft- computing techniques'. Such techniques tend to solve problems using a population of individual elements or potential solutions or the flexibility of a network as opposed to using a rigid, single point of computing. Through use of computational redundancies, soft-computing allows unmatched tractability in practical problem solving. The intelligent paradigm most successfully applied to control engineering, is that of fuzzy logic in the form of fuzzy control. The motivation of using fuzzy control is twofold. First, it allows one to incorporate heuristics into the control strategy, such as the model operator actions. Second, it allows nonlinearities to be defined in an intuitive way using rules and interpolations. Although it is an attractive tool, there still exist many problems to be solved in fuzzy control. To date most applications have been limited to relatively simple problems of low dimensionality. This is primarily due to the fact that the design process is very much a trial and error one and is heavily dependent on the quality of expert knowledge provided by the operator. In addition, fuzzy control design is virtually ad hoc, lacking a systematic design procedure. Other problems include those associated with the curse of dimensionality and the inability to learn and improve from experience. While much work has been carried out to alleviate most of these difficulties, there exists a lack of drive and exploration in the last of these points. The objective of this thesis is to develop an automated, systematic procedure for optimally learning fuzzy logic controllers (FLCs), which provides for autonomous and simple implementations. In pursuit of this goal, a hybrid method is to combine the advantages artificial neural networks (ANNs), evolutionary algorithms (EA) and reinforcement learning (RL). This overcomes the deficiencies of conventional EAs that may omit representation of the region within a variable's operating range and that do not in practice achieve fine learning. This method also allows backpropagation when necessary or feasible. It is termed an Evolutionary NeuroFuzzy Learning Intelligent Control technique (ENFLICT) model. Unlike other hybrids, ENFLICT permits globally structural learning and local offline or online learning. The global EA and local neural learning processes should not be separated. Here, the EA learns and optimises the ENFLICT structure while ENFLICT learns the network parameters. The EA used here is an improved version of a technique known as the messy genetic algorithm (mGA), which utilises flexible cellular chromosomes for structural optimisation. The properties of the mGA as compared with other flexible length EAs, are that it enables the addressing of issues such as the curse of dimensionality and redundant genetic information. Enhancements to the algorithm are in the coding and decoding of the genetic information to represent a growing and shrinking network; the defining of the network properties such as neuron activation type and network connectivity; and that all of this information is represented in a single gene. Another step forward taken in this thesis on neurofuzzy learning is that of learning online. Online in this case refers to learning unsupervised and adapting to real time system parameter changes. It is much more attractive because the alternative (supervised offline learning) demands quality learning data which is often expensive to obtain, and unrepresentative of and inaccurate about the real environment. First, the learning algorithm is developed for the case of a given model of the system where the system dynamics are available or can be obtained through, for example, system identification. This naturally leads to the development of a method for learning by directly interacting with the environment. The motivation for this is that usually real world applications tend to be large and complex, and obtaining a mathematical model of the plant is not always possible. For this purpose the reinforcement learning paradigm is utilised, which is the primary learning method of biological systems, systems that can adapt to their environment and experiences, in this thesis, the reinforcement learning algorithm is based on the advantage learning method and has been extended to deal with continuous time systems and online implementations, and which does not use a lookup table. This means that large databases containing the system behaviour need not be constructed, and the procedure can work online where the information available is that of the immediate situation. For complex systems of higher order dimensions, and where identifying the system model is difficult, a hierarchical method has been developed and is based on a hybrid of all the other methods developed. In particular, the procedure makes use of a method developed to work directly with plant step response, thus avoiding the need for mathematical model fitting which may be time-consuming and inaccurate. All techniques developed and contributions in the thesis are illustrated by several case studies, and are validated through simulations

Simulation-optimization in logistics, transportation, and SCM

Javier Faulín Fajardo... [et al.] son editores de la obra.This is a reprint of articles from the Special Issue published online in the open access journal Algorithms (ISSN 1999-4893) (available at: https://www.mdpi.com/journal/algorithms/special issues/Simulation Optimization). This book provides a selected collection of recent works in the growing area of simulation-optimization methods applied to transportation, logistics, and supply chain networks. Many of the authors that contribute to the book are internationally recognized experts in the field, as well as frequent speakers at the prestigious Winter Simulation Conference, where some of the Guest Editors organize an annual track on logistics, transportation and supply chains. Inside this track, it is usual to find several sessions on the concept of simheuristics, a special type of simulation optimization that combines metaheuristics with simulation to deal with complex and large-scale optimization problems under uncertainty conditions. The chapters in the book cover a wide area of logistics and transportation applications, from bike-sharing systems to container terminals, parcel locker systems, or e-commerce applications

Control system design applications with hybrid genetic algorithms

This thesis investigates the hybrid application of stochastic and heuristic algorithms, in particular genetic algorithms (GA), simulated annealing (SA) and Greedy search algorithms for the design of linear and nonlinear control systems. We compare the rate of convergence, computational effort required (FLOPS) and ease of implementation. Where possible, results are compared with the more traditional control system design methodologies. Two specific practical applications include aircraft flight control systems, and a nonlinear example of an industrial bioreactor fermentation process. Stochastic algorithms (GA) and heuristic algorithms (SA, Greedy, Tabu search) are powerful search methods, capable of locating the global minimum or maximum (extremum) of multimodal functions. They operate without the need for function gradients and are robust to noisy data. The current research trend is directed towards the solution to constrained multiobjective optimization problems of multimodal functions which may result in a family of optimal solutions (i.e Pareto optimal set) and game theoretic approaches such as Nash and Stackelberg Equilibria. Genetic algorithms suffer from one particular drawback, the rate of convergence can be unacceptably slow if accurate solutions are sought. To overcome this deficiency, hybridization of genetic algorithms with fast local search procedures are often used. Two heuristic based search procedures are: greedy search and fast simulated annealing. We investigate three types of Hybrid algorithms: (i) genetic algorithms (GA), (ii) hybrid GA + simulated annealing (SA), and (iii) hybrid GA + greedy search. These methods are applied to solving off-line linear and nonlinear control problems which may otherwise have no direct analytical solution. In cases where solutions are obtainable using conventional methods, results are compared with hybrid algorithms. Robustness against modeling errors, nonlinearities, disturbances and parametric uncertainty will also be discussed. We investigate five specific design applications, these include: training radial basis function (RBF) neural networks, robust eigenstructure assignment (ESA), model reference adaptive control (MRAC), robust mixed H2/H00 design, and lastly fault detection and isolation (FDI). We show that hybrid algorithms can perform better, can handle a broader class of problems, and have fewer restrictions than conventional methods. Furthermore, stochastic and heuristic methods can directly deal with constraints

Molecular phylogeny of horseshoe crab using mitochondrial Cox1 gene as a benchmark sequence

An effort to assess the utility of 650 bp Cytochrome C oxidase subunit I (DNA barcode) gene in delineating the members horseshoe crabs (Family: xiphosura) with closely related sister taxa was made. A total of 33 sequences were extracted from National Center for Biotechnological Information (NCBI) which include horseshoe crabs, beetles, common crabs and scorpion sequences. Constructed phylogram showed beetles are closely related with horseshoe crabs than common crabs. Scorpion spp were distantly related to xiphosurans. Phylogram and observed genetic distance (GD) date were also revealed that Limulus polyphemus was closely related with Tachypleus tridentatus than with T.gigas. Carcinoscorpius rotundicauda was distantly related with L.polyphemus. The observed mean Genetic Distance (GD) value was higher in 3rd codon position in all the selected group of organisms. Among the horseshoe crabs high GC content was observed in L.polyphemus (38.32%) and lowest was observed in T.tridentatus (32.35%). We conclude that COI sequencing (barcoding) could be used in identifying and delineating evolutionary relatedness with closely related specie

Collected Papers (on Physics, Artificial Intelligence, Health Issues, Decision Making, Economics, Statistics), Volume XI

This eleventh volume of Collected Papers includes 90 papers comprising 988 pages on Physics, Artificial Intelligence, Health Issues, Decision Making, Economics, Statistics, written between 2001-2022 by the author alone or in collaboration with the following 84 co-authors (alphabetically ordered) from 19 countries: Abhijit Saha, Abu Sufian, Jack Allen, Shahbaz Ali, Ali Safaa Sadiq, Aliya Fahmi, Atiqa Fakhar, Atiqa Firdous, Sukanto Bhattacharya, Robert N. Boyd, Victor Chang, Victor Christianto, V. Christy, Dao The Son, Debjit Dutta, Azeddine Elhassouny, Fazal Ghani, Fazli Amin, Anirudha Ghosha, Nasruddin Hassan, Hoang Viet Long, Jhulaneswar Baidya, Jin Kim, Jun Ye, Darjan Karabašević, Vasilios N. Katsikis, Ieva Meidutė-Kavaliauskienė, F. Kaymarm, Nour Eldeen M. Khalifa, Madad Khan, Qaisar Khan, M. Khoshnevisan, Kifayat Ullah,, Volodymyr Krasnoholovets, Mukesh Kumar, Le Hoang Son, Luong Thi Hong Lan, Tahir Mahmood, Mahmoud Ismail, Mohamed Abdel-Basset, Siti Nurul Fitriah Mohamad, Mohamed Loey, Mai Mohamed, K. Mohana, Kalyan Mondal, Muhammad Gulfam, Muhammad Khalid Mahmood, Muhammad Jamil, Muhammad Yaqub Khan, Muhammad Riaz, Nguyen Dinh Hoa, Cu Nguyen Giap, Nguyen Tho Thong, Peide Liu, Pham Huy Thong, Gabrijela Popović‬‬‬‬‬‬‬‬‬‬, Surapati Pramanik, Dmitri Rabounski, Roslan Hasni, Rumi Roy, Tapan Kumar Roy, Said Broumi, Saleem Abdullah, Muzafer Saračević, Ganeshsree Selvachandran, Shariful Alam, Shyamal Dalapati, Housila P. Singh, R. Singh, Rajesh Singh, Predrag S. Stanimirović, Kasan Susilo, Dragiša Stanujkić, Alexandra Şandru, Ovidiu Ilie Şandru, Zenonas Turskis, Yunita Umniyati, Alptekin Ulutaș, Maikel Yelandi Leyva Vázquez, Binyamin Yusoff, Edmundas Kazimieras Zavadskas, Zhao Loon Wang.‬‬‬