Synthesis of waste interception and allocation networks using genetic-alopex algorithm

In this paper, the hybrid genetic-alopex algorithm (GAA) is proposed to sol ve the problem of synthesis of waste interception and allocation networks ( WINs). Algorithm of pattern extraction (alopex) adopts 'noises' generated r andomly to cast off local optima and enhances the capacity of hillclimbing. Genetic algorithms (GA) is good at keeping evolving of total population an d parallel computing. The combination of GA and alopex enhances the algorit hm in that it converges at the global optimum easily and accelerates the co nvergence to some extent. In addition, several advanced genetic operators a re adopted to protect diversity of the population. Results of testing funct ions and a case study show that GAA is stable and can converge to global op timum well for the problem of high dimensions. (C) 2000 Elsevier Science Lt d. All rights reserved.