A self-adaptive artificial bee colony algorithm with local search for TSK-type neuro-fuzzy system training

© 2019 IEEE. In this paper, we introduce a self-adaptive artificial bee colony (ABC) algorithm for learning the parameters of a Takagi-Sugeno-Kang-type (TSK-type) neuro-fuzzy system (NFS). The proposed NFS learns fuzzy rules for the premise part of the fuzzy system using an adaptive clustering method according to the input-output data at hand for establishing the network structure. All the free parameters in the NFS, including the premise and the following TSK-type consequent parameters, are optimized by the modified ABC (MABC) algorithm. Experiments involve two parts, including numerical optimization problems and dynamic system identification problems. In the first part of investigations, the proposed MABC compares to the standard ABC on mathematical optimization problems. In the remaining experiments, the performance of the proposed method is verified with other metaheuristic methods, including differential evolution (DE), genetic algorithm (GA), particle swarm optimization (PSO) and standard ABC, to evaluate the effectiveness and feasibility of the system. The simulation results show that the proposed method provides better approximation results than those obtained by competitors methods

Memetic Artificial Bee Colony Algorithm for Large-Scale Global Optimization

Memetic computation (MC) has emerged recently as a new paradigm of efficient algorithms for solving the hardest optimization problems. On the other hand, artificial bees colony (ABC) algorithms demonstrate good performances when solving continuous and combinatorial optimization problems. This study tries to use these technologies under the same roof. As a result, a memetic ABC (MABC) algorithm has been developed that is hybridized with two local search heuristics: the Nelder-Mead algorithm (NMA) and the random walk with direction exploitation (RWDE). The former is attended more towards exploration, while the latter more towards exploitation of the search space. The stochastic adaptation rule was employed in order to control the balancing between exploration and exploitation. This MABC algorithm was applied to a Special suite on Large Scale Continuous Global Optimization at the 2012 IEEE Congress on Evolutionary Computation. The obtained results the MABC are comparable with the results of DECC-G, DECC-G*, and MLCC.Comment: CONFERENCE: IEEE Congress on Evolutionary Computation, Brisbane, Australia, 201

Past, present and future of path-planning algorithms for mobile robot navigation in dynamic environments

Mobile robots have been making a significant contribution to the advancement of many sectors including automation of mining, space, surveillance, military, health, agriculture and many more. Safe and efficient navigation is a fundamental requirement of mobile robots, thus, the demand for advanced algorithms rapidly increased. Mobile robot navigation encompasses the following four requirements: perception, localization, path-planning and motion control. Among those, path-planning is a vital part of a fast, secure operation. During the last couple of decades, many path-planning algorithms were developed. Despite most of the mobile robot applications being in dynamic environments, the number of algorithms capable of navigating robots in dynamic environments is limited. This paper presents a qualitative comparative study of the up-to-date mobile robot path-planning methods capable of navigating robots in dynamic environments. The paper discusses both classical and heuristic methods including artificial potential field, genetic algorithm, fuzzy logic, neural networks, artificial bee colony, particle swarm optimization, bacterial foraging optimization, ant-colony and Agoraphilic algorithm. The general advantages and disadvantages of each method are discussed. Furthermore, the commonly used state-of-the-art methods are critically analyzed based on six performance criteria: algorithm's ability to navigate in dynamically cluttered areas, moving goal hunting ability, object tracking ability, object path prediction ability, incorporating the obstacle velocity in the decision, validation by simulation and experimentation. This investigation benefits researchers in choosing suitable path-planning methods for different applications as well as identifying gaps in this field. © 2020 IEEE

Optimising the climate resilience of shipping networks

Climate catastrophes (e.g. hurricane, flooding and heat waves) are generating increasing impact on port operations and hence configuration of shipping networks. This paper formulates the routing problem to optimise the resilience of shipping networks, by taking into account the disruptions due to climate risks to port operations. It first describes a literature review with the emphasis on environmental sustainability, port disruptions due to climate extremes and routing optimisation in shipping operations. Second, a centrality assessment of port cities by a novel multi-centrality-based indicator is implemented. Third, a climate resilience model is developed by incorporating the port disruption days by climate risks into shipping route optimisation. Its main contribution is constructing a novel methodology to connect climate risk indices, centrality assessment, and shipping routing to observe the changes of global shipping network by climate change impacts