Because of successful implementations and high intensity, metaheuristic research has been extensively reported in literature, which covers algorithms, applications, comparisons, and analysis. Though, little has been evidenced on insightful analysis of metaheuristic performance issues, and it is still a “black box” that why certain metaheuristics perform better on specific optimization problems and not as good on others. The performance related analyses performed on algorithms are mostly quantitative via performance validation metrics like mean error, standard deviation, and co-relations have been used. Moreover, the performance tests are often performed on specific benchmark functions—few studies are those which involve real data from scientific or engineering optimization problems. In order to draw a comprehensive picture of metaheuristic research, this paper performs a survey of metaheuristic research in literature which consists of 1222 publications from year 1983 to 2016 (33 years). Based on the collected evidence, this paper addresses four dimensions of metaheuristic research: introduction of new algorithms, modifications and hybrids, comparisons and analysis, and research gaps and future directions. The objective is to highlight potential open questions and critical issues raised in literature. The work provides guidance for future research to be conducted more meaningfully that can serve for the good of this area of research.

Metaheuristic research: a comprehensive survey

The partitional clustering concept started with K-means algorithm which was published in 1957. Since then many classical partitional clustering algorithms have been reported based on gradient descent approach. The 1990 kick started a new era in cluster analysis with the application of nature inspired metaheuristics. After initial formulation nearly two decades have passed and researchers have developed numerous new algorithms in this field. This paper embodies an up-to-date review of all major nature inspired metaheuristic algorithms employed till date for partitional clustering. Further, key issues involved during formulation of various metaheuristics as a clustering problem and major application areas are discussed.

A survey on nature inspired metaheuristic algorithms for partitional clustering

Multiobjective design optimization problems require multiobjective optimization techniques to solve, and it is often very challenging to obtain high-quality Pareto fronts accurately. In this article, the recently developed flower pollination algorithm (FPA) is extended to solve multiobjective optimization problems. The proposed method is used to solve a set of multiobjective test functions and two bi-objective design benchmarks, and a comparison of the proposed algorithm with other algorithms has been made, which shows that the FPA is efficient with a good convergence rate. Finally, the importance for further parametric studies and theoretical analysis is highlighted and discussed.

/pdf/flower-pollination-algorithm-a-novel-approach-for-4yrn41ae49.pdf

Flower pollination algorithm: A novel approach for multiobjective optimization

Multiobjective design optimization problems require multiobjective optimization techniques to solve, and it is often very challenging to obtain high-quality Pareto fronts accurately. In this paper, the recently developed flower pollination algorithm (FPA) is extended to solve multiobjective optimization problems. The proposed method is used to solve a set of multobjective test functions and two bi-objective design benchmarks, and a comparison of the proposed algorithm with other algorithms has been made, which shows that FPA is efficient with a good convergence rate. Finally, the importance for further parametric studies and theoretical analysis are highlighted and discussed.

/pdf/flower-pollination-algorithm-a-novel-approach-for-4igz0940ep.pdf

Flower Pollination Algorithm: A Novel Approach for Multiobjective Optimization

Review of applications of algorithms in bio-inspired computing.Brief description of algorithms without mathematical notations.Brief description of scope of applications of the algorithms.Identification of algorithms whose applications may be explored.Identification of algorithms on which theory development may be explored. With the explosion of data generation, getting optimal solutions to data driven problems is increasingly becoming a challenge, if not impossible. It is increasingly being recognised that applications of intelligent bio-inspired algorithms are necessary for addressing highly complex problems to provide working solutions in time, especially with dynamic problem definitions, fluctuations in constraints, incomplete or imperfect information and limited computation capacity. More and more such intelligent algorithms are thus being explored for solving different complex problems. While some studies are exploring the application of these algorithms in a novel context, other studies are incrementally improving the algorithm itself. However, the fast growth in the domain makes researchers unaware of the progresses across different approaches and hence awareness across algorithms is increasingly reducing, due to which the literature on bio-inspired computing is skewed towards few algorithms only (like neural networks, genetic algorithms, particle swarm and ant colony optimization). To address this concern, we identify the popularly used algorithms within the domain of bio-inspired algorithms and discuss their principles, developments and scope of application. Specifically, we have discussed the neural networks, genetic algorithm, particle swarm, ant colony optimization, artificial bee colony, bacterial foraging, cuckoo search, firefly, leaping frog, bat algorithm, flower pollination and artificial plant optimization algorithm. Further objectives which could be addressed by these twelve algorithms have also be identified and discussed. This review would pave the path for future studies to choose algorithms based on fitment. We have also identified other bio-inspired algorithms, where there are a lot of scope in theory development and applications, due to the absence of significant literature.

Bio inspired computing - A review of algorithms and scope of applications

A memetic meta-heuristic called the shuffled frog-leaping algorithm (SFLA) has been developed for solving combinatorial optimization problems. The SFLA is a population-based cooperative search metaphor inspired by natural memetics. The algorithm contains elements of local search and global information exchange. The SFLA consists of a set of interacting virtual population of frogs partitioned into different memeplexes. The virtual frogs act as hosts or carriers of memes where a meme is a unit of cultural evolution. The algorithm performs simultaneously an independent local search in each memeplex. The local search is completed using a particle swarm optimization-like method adapted for discrete problems but emphasizing a local search. To ensure global exploration, the virtual frogs are periodically shuffled and reorganized into new memplexes in a technique similar to that used in the shuffled complex evolution algorithm. In addition, to provide the opportunity for random generation of improved information,...

Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization

Booster disinfectant is introduced within a distribution system to maintain disinfectant residuals and avoid high dosages near water sources. Assuming that first order reaction kinetics apply to chlorine decay, an integer linear programming optimization problem is posed to determine booster locations and their injection rates. The formulation avoids long water quality simulations by adding constraints requiring the concentrations at the beginning and end of the design period to be the same. The optimization problem is divided into two levels. The upper level selects the booster locations using a genetic algorithm, if more than a few boosters are included, or enumeration, if the number of boosters and/or potential locations is relatively small. Given a set of boosters from the upper level, the lower level minimizes the chlorine mass to be injected to maintain required residuals. The approach is applied to the Brushy Plains system for alternative numbers of allowable boosters.

Locating Satellite Booster Disinfectant Stations

The COVID-19 pandemic affected the operation of water utilities across the world. In the context of utilities, new protocols were needed to ensure that employees can work safely, and that water service is not interrupted. This study reports on how the operations of 27 water utilities worldwide were affected by the COVID-19 pandemic. Interviews were conducted between June and October 2020;respondents represent utilities that varied in population size, location, and customer composition (e.g., residential, industrial, commercial, institutional, and university customers). Survey questions focused on the effects of the pandemic on water system operation, demand, revenues, system vulnerabilities, and the use and development of emergency response plans (ERPs). Responses indicate that significant changes in water system operations were implemented to ensure that water utility employees could continue working while maintaining safe social distancing or alternatively working from home. A total of 23 of 27 utilities reported small changes in demand volumes and patterns, which can lead to some changes in water infrastructure operations and water quality. Utilities experienced a range of impacts on finances, where most utilities discussed small decreases in revenues, with a few reporting more drastic impacts. The pandemic revealed new system vulnerabilities, including supply chain management, capacity of staff to perform certain functions remotely, and finances. Some utilities applied existing guidance developed through ERPs with slight modifications, other utilities developed new ERPs to specifically address unique conditions induced by the pandemic, and a few utilities did not use or reference their existing ERPs to change operations. Many utilities suggested that lessons learned would be used in future ERPs, such as personnel training on pandemic risk management or annual mock exercises for preparing employees to better respond to emergencies.

Fayzul Pasha

Papers

Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization

Locating Satellite Booster Disinfectant Stations

Effects of the COVID-19 Pandemic on Water Utility Operations and Vulnerability