This paper proposes a novel population-based optimization algorithm called Sine Cosine Algorithm (SCA) for solving optimization problems. The SCA creates multiple initial random candidate solutions and requires them to fluctuate outwards or towards the best solution using a mathematical model based on sine and cosine functions. Several random and adaptive variables also are integrated to this algorithm to emphasize exploration and exploitation of the search space in different milestones of optimization. The performance of SCA is benchmarked in three test phases. Firstly, a set of well-known test cases including unimodal, multi-modal, and composite functions are employed to test exploration, exploitation, local optima avoidance, and convergence of SCA. Secondly, several performance metrics (search history, trajectory, average fitness of solutions, and the best solution during optimization) are used to qualitatively observe and confirm the performance of SCA on shifted two-dimensional test functions. Finally, the cross-section of an aircraft's wing is optimized by SCA as a real challenging case study to verify and demonstrate the performance of this algorithm in practice. The results of test functions and performance metrics prove that the algorithm proposed is able to explore different regions of a search space, avoid local optima, converge towards the global optimum, and exploit promising regions of a search space during optimization effectively. The SCA algorithm obtains a smooth shape for the airfoil with a very low drag, which demonstrates that this algorithm can highly be effective in solving real problems with constrained and unknown search spaces. Note that the source codes of the SCA algorithm are publicly available at http://www.alimirjalili.com/SCA.html .

SCA: A Sine Cosine Algorithm for solving optimization problems

The Ant Lion Optimizer

System Identification I

Energy is a vital input for social and economic development. As a result of the generalization of agricultural, industrial and domestic activities the demand for energy has increased remarkably, especially in emergent countries. This has meant rapid grower in the level of greenhouse gas emissions and the increase in fuel prices, which are the main driving forces behind efforts to utilize renewable energy sources more effectively, i.e. energy which comes from natural resources and is also naturally replenished. Despite the obvious advantages of renewable energy, it presents important drawbacks, such as the discontinuity of generation, as most renewable energy resources depend on the climate, which is why their use requires complex design, planning and control optimization methods. Fortunately, the continuous advances in computer hardware and software are allowing researchers to deal with these optimization problems using computational resources, as can be seen in the large number of optimization methods that have been applied to the renewable and sustainable energy field. This paper presents a review of the current state of the art in computational optimization methods applied to renewable and sustainable energy, offering a clear vision of the latest research advances in this field.

Optimization methods applied to renewable and sustainable energy: A review

Shuffled Frog Leaping Algorithm (SFLA) is a meta-heuristic for solving discrete optimization problems. Here it is applied to determine optimal discrete pipe sizes for new pipe networks and for network expansions. SFLA is a population based, cooperative search metaphor inspired by natural memetics. The algorithm uses memetic evolution in the form of infection of ideas from one individual to another in a local search. The local search is similar in concept to particle swarm optimization. A shuffling strategy allows for the exchange of information between local searches to move toward a global optimum. This paper summarizes the development of SFLANET, a computer model that links SFLA and the hydraulic simulation software EPANET and its library functions. Application of SFLANET to literature network design problems is then described. Although the algorithm is in its initial stages of development, promising results were obtained.

Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm

The genetic algorithm technique is a relatively new optimization technique. In this paper we present a methodology for optimizing pipe networks using genetic algorithms. Unknown decision variables are coded as binary strings. We investigate a three-operator genetic algorithm comprising reproduction, crossover, and mutation. Results are compared with the techniques of complete enumeration and nonlinear programming. We apply the optimization techniques to a case study pipe network. The genetic algorithm technique finds the global optimum in relatively few evaluations compared to the size of the search space.

/pdf/genetic-algorithms-compared-to-other-techniques-for-pipe-1o136bs96r.pdf

Genetic algorithms compared to other techniques for pipe optimization

An improved genetic algorithm (GA) formulation for pipe network optimization has been developed. The new GA uses variable power scaling of the fitness function. The exponent introduced into the fitness function is increased in magnitude as the GA computer run proceeds. In addition to the more commonly used bitwise mutation operator, an adjacency or creeping mutation operator is introduced. Finally, Gray codes rather than binary codes are used to represent the set of decision variables which make up i the pipe network design. Results are presented comparing the performance of the traditional or simple GA formulation and the improved GA formulation for the New York City tunnels problem. The case study results indicate the improved GA performs significantly better than the simple GA. In addition, the improved GA performs better than previously used traditional optimization methods such as linear, dynamic, and nonlinear programming methods and an enumerative search method. The improved GA found a solution for the New York tunriels problem which is the lowest-cost feasible discrete size solution yet presented in the literature.

https://digital.library.adelaide.edu.au/dspace/bitstream/2440/1073/1/hdl_1073.pdf

An Improved Genetic Algorithm for Pipe Network Optimization

During the last decade, evolutionary methods such as genetic algorithms have been used extensively for the optimal design and operation of water distribution systems. More recently, ant colony optimization algorithms (ACOAs), which are evolutionary methods based on the foraging behavior of ants, have been successfully applied to a number of benchmark combinatorial optimization problems. In this paper, a formulation is developed which enables ACOAs to be used for the optimal design of water distribution systems. This formulation is applied to two benchmark water distribution system optimization problems and the results are compared with those obtained using genetic algorithms (GAs). The findings of this study indicate that ACOAs are an attractive alternative to GAs for the optimal design of water distribution systems, as they outperformed GAs for the two case studies considered both in terms of computational efficiency and their ability to find near global optimal solutions.

/pdf/ant-colony-optimization-for-design-of-water-distribution-crao1vpvb8.pdf

Ant Colony Optimization for Design of Water Distribution Systems

https://www.win.tue.nl/~atijssel/pdf_files/Bergant-Simpson-Tijsseling_2006.pdf

Water hammer with column separation: A historical review

This paper reviews a number of unsteady friction models for transient pipe flow. Two distinct unsteady friction models, the Zielke and the Brunone models, are investigated in detail. The Zielke model, originally developed for transient laminar flow, has been selected to verify its effectiveness for "low Reynolds number" transient turbulent flow. The Brunone model combines local inertia and wall friction unsteadiness. This model is verified using the Vardy's analytically deduced shear decay coefficient C ∗ to predict the Brunone's friction coefficient k rather than use the traditional trial and error method for estimating k. The two unsteady friction models have been incorporated into the method of characteristics water hammer algorithm. Numerical results from the quasi-steady friction model and the Zielke and the Brunone unsteady friction models are compared with results of laboratory measurements for water hammer cases with laminar and low Reynolds number turbulent flows. Conclusions about the range of v...

/pdf/developments-in-unsteady-pipe-flow-friction-modelling-470d3v1cn9.pdf

Angus R. Simpson

Papers

Genetic algorithms compared to other techniques for pipe optimization

An Improved Genetic Algorithm for Pipe Network Optimization

Ant Colony Optimization for Design of Water Distribution Systems

Water hammer with column separation: A historical review

Developments in unsteady pipe flow friction modelling