Optimization of water distribution network design using the Shuffled Frog Leaping Algorithm
Optimization of water distribution network design using the Shuffled Frog Leaping Algorithm
复制标题
DOI：
10.1061/(asce)0733-9496(2003)129:3(210
复制
发表时间：
2003-05-01
影响因子：
3.1
通讯作者：
Lansey, KE
中科院分区：
文献类型：
--
作者：
Eusuff, MM;Lansey, KE
洗牌青蛙跳跃算法是一种求解离散优化问题的元启发式算法。在这里，它被应用于确定新管网和网络扩展的最优离散管道尺寸。SFLA是一种基于群体的、受自然模因启发的合作搜索隐喻。该算法利用模因进化的形式，在局部搜索中从一个个体传染到另一个个体。局部搜索在概念上与粒子群优化相似。变换策略允许在局部搜索之间交换信息，以实现全局最优。本文综述了连接SFLA和液压仿真软件EPANET的计算机模型SFLANET的发展及其库功能。然后描述了SFLANET在文学网络设计问题中的应用。虽然该算法还处于发展的初级阶段，但已经取得了令人满意的结果。
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.