A Modified Shuffled Frog Leaping Algorithm for PAPR Reduction in OFDM Systems

© 2015 IEEE. Significant reduction of the peak-to-average power ratio (PAPR) is an implementation challenge in orthogonal frequency division multiplexing (OFDM) systems. One way to reduce PAPR is to apply a set of selected partial transmission sequence (PTS) to the transmit signals. However, PTS selection is a highly complex NP-hard problem and the computational complexity is very high when a large number of subcarriers are used in the OFDM system. In this paper, we propose a new heuristic PTS selection method, the modified chaos clonal shuffled frog leaping algorithm (MCCSFLA). MCCSFLA is inspired by natural clonal selection of a frog colony, it is based on the chaos theory. We also analyze MCCSFLA using the Markov chain theory and prove that the algorithm can converge to the global optimum. Simulation results show that the proposed algorithm achieves better PAPR reduction than using others genetic, quantum evolutionary and selective mapping algorithms. Furthermore, the proposed algorithm converges faster than the genetic and quantum evolutionary algorithms

Optimal distribution network reconfiguration using meta-heuristic algorithms

Finding optimal configuration of power distribution systems topology is an NP-hard combinatorial optimization problem. It becomes more complex when time varying nature of loads in large-scale distribution systems is taken into account. In the second chapter of this dissertation, a systematic approach is proposed to tackle the computational burden of the procedure. To solve the optimization problem, a novel adaptive fuzzy based parallel genetic algorithm (GA) is proposed that employs the concept of parallel computing in identifying the optimal configuration of the network. The integration of fuzzy logic into GA enhances the efficiency of the parallel GA by adaptively modifying the migration rates between different processors during the optimization process. A computationally efficient graph encoding method based on Dandelion coding strategy is developed which automatically generates radial topologies and prevents the construction of infeasible radial networks during the optimization process. The main shortcoming of the proposed algorithm in Chapter 2 is that it identifies only one single solution. It means that the system operator will not have any option but relying on the found solution. That is why a novel hybrid optimization algorithm is proposed in the third chapter of this dissertation that determines Pareto frontiers, as candidate solutions, for multi-objective distribution network reconfiguration problem. Implementing this model, the system operator will have more flexibility in choosing the best configuration among the alternative solutions. The proposed hybrid optimization algorithm combines the concept of fuzzy Pareto dominance (FPD) with shuffled frog leaping algorithm (SFLA) to recognize non-dominated suboptimal solutions identified by SFLA. The local search step of SFLA is also customized for power systems applications so that it automatically creates and analyzes only the feasible and radial configurations in its optimization procedure which significantly increases the convergence speed of the algorithm. In the fourth chapter, the problem of optimal network reconfiguration is solved for the case in which the system operator is going to employ an optimization algorithm that is automatically modifying its parameters during the optimization process. Defining three fuzzy functions, the probability of crossover and mutation will be adaptively tuned as the algorithm proceeds and the premature convergence will be avoided while the convergence speed of identifying the optimal configuration will not decrease. This modified genetic algorithm is considered a step towards making the parallel GA, presented in the second chapter of this dissertation, more robust in avoiding from getting stuck in local optimums. In the fifth chapter, the concentration will be on finding a potential smart grid solution to more high-quality suboptimal configurations of distribution networks. This chapter is considered an improvement for the third chapter of this dissertation for two reasons: (1) A fuzzy logic is used in the partitioning step of SFLA to improve the proposed optimization algorithm and to yield more accurate classification of frogs. (2) The problem of system reconfiguration is solved considering the presence of distributed generation (DG) units in the network. In order to study the new paradigm of integrating smart grids into power systems, it will be analyzed how the quality of suboptimal solutions can be affected when DG units are continuously added to the distribution network. The heuristic optimization algorithm which is proposed in Chapter 3 and is improved in Chapter 5 is implemented on a smaller case study in Chapter 6 to demonstrate that the identified solution through the optimization process is the same with the optimal solution found by an exhaustive search

An Improved Genetic-Shuffled Frog-Leaping Algorithm for Permutation Flowshop Scheduling

Due to the NP-hard nature, the permutation flowshop scheduling problem (PFSSP) is a fundamental issue for Industry 4.0, especially under higher productivity, efficiency, and self-managing systems. This paper proposes an improved genetic-shuffled frog-leaping algorithm (IGSFLA) to solve the permutation flowshop scheduling problem. In the proposed IGSFLA, the optimal initial frog (individual) in the initialized group is generated according to the heuristic optimal-insert method with fitness constrain. The crossover mechanism is applied to both the subgroup and the global group to avoid the local optimal solutions and accelerate the evolution. To evolve the frogs with the same optimal fitness more outstanding, the disturbance mechanism is applied to obtain the optimal frog of the whole group at the initialization step and the optimal frog of the subgroup at the searching step. The mathematical model of PFSSP is established with the minimum production cycle (makespan) as the objective function, the fitness of frog is given, and the IGSFLA-based PFSSP is proposed. Experimental results have been given and analyzed, showing that IGSFLA not only provides the optimal scheduling performance but also converges effectively

Design of water distribution networks using a pseudo-genetic algorithm and sensitivity of genetic operators

[EN] Genetic algorithms (GA) are optimization techniques that are widely used in the design of water distribution networks. One of the main disadvantages of GA is positional bias, which degrades the quality of the solution. In this study, a modified pseudo-genetic algorithm (PGA) is presented. In a PGA, the coding of chromosomes is performed using integer coding; in a traditional GA, binary coding is utilized. Each decision variable is represented by only one gene. This variation entails a series of special characteristics in the definition of mutation and crossover operations. Some benchmark networks have been used to test the suitability of a PGA for designing water distribution networks. More than 50,000 simulations were conducted with different sets of parameters. A statistical analysis of the obtained solutions was also performed. Through this analysis, more suitable values of mutation and crossover probabilities were discovered for each case. The results demonstrate the validity of the method. Optimum solutions are not guaranteed in any heuristic method. Hence, the concept of a good solution is introduced. A good solution is a design solution that does not substantially exceed the optimal solution that is obtained from the simulations. This concept may be useful when the computational cost is critical. The main conclusion derived from this study is that a proper combination of population and crossover and mutation probabilities leads to a high probability that good solutions will be obtained[This work was supported by the project DPI2009-13674 (OPERAGUA) of the Direccion General de Investigacion y Gestion del Plan Nacional de I + D + I del Ministerio de Ciencia e Innovacion, Spain.Mora Meliá, D.; Iglesias Rey, PL.; Martínez-Solano, FJ.; Fuertes Miquel, VS. (2013). Design of water distribution networks using a pseudo-genetic algorithm and sensitivity of genetic operators. Water Resources Management. 27(12):4149-4162. https://doi.org/10.1007/s11269-013-0400-6S414941622712Alperovits E, Shamir U (1977) Design of optimal water distribution systems. Water Resour Res 13(6):885–900Balla M, Lingireddy S (2000) Distributed genetic algorithm model on network of personal computers. J Comput Civ Eng 14(3):199–205. doi: 10.1061/(ASCE)0887-3801(2000)14:3(199)Baños R, Gil C, Agulleiro JI, Reca J (2007) A memetic algorithm for water distribution network design. Advances in Soft Computing 39:279–289. doi: 10.1007/978-3-540-70706-6_26Cisty M (2010) Hybrid genetic algorithm and linear programming method for least-cost design of water distribution systems. Water Resour Manage 24(1):1–24. doi: 10.1007/s1269-009-9434-1Chung G, Lansey K (2008) Application of the shuffled frog leaping algorithm for the optimization of a general large-scale in a watersupply system. Water Resour Manage 23:797–823. doi: 10.1007/s11269-008-9300-6Cunha MC, Sousa J (1999) Water distribution network design optimization: simulated annealing approach. J Water Resour Plann Manage 125(4):215–221. doi: 10.1061/(ASCE)0733-9496(1999)125:4(215)Eusuff M, Lansey K (2003) Optimization of water distribution network design using the shuffled frog leaping algorithm. J Water Resour Plann Manage 129(3):210–225. doi: 10.1061/(ASCE)0733-9496(2003)129:3(210)Fujiwara O, Khang DB (1990) A two phase decomposition method for optimal design of looped water distribution network. Water Resour Res 26(4):539–549. doi: 10.1029/WR026i004p00539Geem ZW (2006) Optimal cost design of water distribution networks using harmony search. Eng Optimiz 38(3):259–277. doi: 10.1080/03052150500467430Goldberg DE, Kuo CH (1987) Genetic algorithms in pipeline optimization. J Comput Civil Eng 1(2):128–141. doi: 10.1061/(ASCE)0887-3801(1987)1:2(128)Goulter IC, Morgan DR (1985) An integrated approach to the layout and design of water distribution systems. Civil Eng Syst 2(2):104–113. doi: 10.1080/02630258508970389Halhal D, Walters GA, Ouazar D, Savic DA (1997) Water network rehabilitation with structured messy genetic algorithms. J Water Resour Plann Manage 123(3):137–147. doi: 10.1061/(ASCE)0733-9496(1997)123:3(137)Iglesias-Rey PL, Martínez-Solano FJ, Mora-Meliá D, Ribelles-Aguilar JV (2012) The battle water networks II: Combination of meta-heuristic techniques with the concept of setpoint function in water network optimization algorithms. In: Proc. 14th Water Distribution Systems Analysis symposium (WDSA), Engineers Australia, Adelaide, AustraliaJin YX, Cheng HZ, Yan J, Zhang L (2007) New discrete method for particle swarm optimization and its application in transmission network expansion planning. Electr Pow Syst Res 77(3–4):227–233. doi: 10.1016/j.epsr.2006.02.016Lansey KE, Mays LW (1989). Optimization model for design of water distribution systems. Reliability analysis of water distribution systems. In: L. R. Mays (ed) ASCE: Reston, VaLouati M, Benabdallah S, Lebdi F, Milutin D (2011) Application of a genetic algorithm for the optimization of a complex reservoir system in Tunisia. Water Resour Manage 25(10):2387–2404. doi: 10.1007/s11269-011-9814-1Matías A (2003) “Diseño de redes de distribución de agua contemplando la fiabilidad mediante Algoritmos Genéticos”. Ph.D. Thesis, Universidad Politécnica de Valencia, ValenciaNazif S, Karamouz M, Tabesh M, Moridi A (2010) Pressure management model for urban water distribution networks. Water Resour Manage 24(3):437–458. doi: 10.1007/s11269-009-9454-xPrasad DT, Park NS (2004) Multiobjective genetic algorithms for design of water distribution networks. J Water Resour Plann Manage 130(1):73–82. doi: 10.1061/(ASCE)0733-9496(2004)130:1(73)Reca J, Martinez J (2006) Genetic algorithms for the design of looped irrigation water distribution networks. Water Resour Res 42(5):W05416. doi: 10.1029/2005WR004383Reca J, Martinez J, Gil C, Baños R (2008) Application of several meta-heuristic techniques to the optimization of real looped water distribution networks. Water Resour Manage 22(10):1367–1379. doi: 10.1007/s11269-007-9230-8Rossman LA (2000) EPANET 2.0 User’s manual. EPA/600/R-00/057, 2000Savic DA, Walters GA (1997) Genetic algorithms for least-cost design of water distribution systems. J Water Resour Plann Manage 123(2):67–77. doi: 10.1061/(ASCE)0733-9496(1997)123:2(67)Su YL, Mays LW, Duan N, Lansey KE (1987) Reliability based optimization model for water distribution systems. J Hydraul Eng 113(12):1539–1556. doi: 10.1061/(ASCE)0733-9429(1987)113:12(1539)Tsai FTC, Katiyar V, Toy D, Goff RA (2008) Conjunctive management of large-scale pressurized water distribution and groundwater systems in semi-arid area with parallel genetic algorithm. Water Resour Manage 23(8):1497–1517. doi: 10.1007/s11269-008-9338-5Vairavamoorthy K, Ali M (2000) Optimal design of water distribution systems using genetic algorithms. Comput Aided Civ Infrastruc Eng 15(5):374–382. doi: 10.1111/0885-9507.00201Wang QJ (1991) The genetic algorithm and its application to calibrating conceptual rainfall-runoff models. Water Resour Res 27(9):2467–2471. doi: 10.1029/91WR0130

On the role of metaheuristic optimization in bioinformatics

Metaheuristic algorithms are employed to solve complex and large-scale optimization problems in many different fields, from transportation and smart cities to finance. This paper discusses how metaheuristic algorithms are being applied to solve different optimization problems in the area of bioinformatics. While the text provides references to many optimization problems in the area, it focuses on those that have attracted more interest from the optimization community. Among the problems analyzed, the paper discusses in more detail the molecular docking problem, the protein structure prediction, phylogenetic inference, and different string problems. In addition, references to other relevant optimization problems are also given, including those related to medical imaging or gene selection for classification. From the previous analysis, the paper generates insights on research opportunities for the Operations Research and Computer Science communities in the field of bioinformatics