禁忌算法在集输管网布站设计中的应用  

Application of Tabu Search Algorithm to Optimal Arrangement of Stations for Gas Gathering and Transferring Network

作　　者：甄宝军[1] 梁政[1] 邓雄[1] 赵俊[1] 

机构地区：[1]西南石油学院

出　　处：《石油规划设计》2005年第4期24-25,45,共3页Petroleum Planning & Engineering

摘　　要：天然气集输管网的布站设计中引入了具有快速搜索能力的禁忌搜索算法,由于该算法在求解时不依赖于梯度信息,因而特别适合解决大规模复杂问题。禁忌算法克服了单纯形算法优化效果在优化过程中随函数维数的增加明显下降的缺点,并且将其成功应用于算例中。计算结果表明,禁忌算法优于单纯形算法,具有一定的可行性和有效性。The Tabu search algorithm with rapid search ability is introduced into the optimal arrangement of stations for gas gathering and transportation network. The Tabu search algorithm is independent of gradient and especially suitable to solve the large-scale complicated problems. This algorithm can control the obvious decline of optimization effect of the simplex algorithm with the increase of functional dimension. The calculated results of some examples demonstrate the feasibility and validity of the Tabu search algorithm better than that of the simplex algorithm.

关 键 词：天然气 集输管网 布站设计 禁忌搜索算法 数学模型 

分 类 号：TE973.1[石油与天然气工程—石油机械设备]