摘要
输电系统最优规划问题是一个复杂的非线性组合优化问题，至今未得到很好的解决。Tabu搜索（TS－TabuSearch）方法是近年来出现的用于求解组合优化问题的一种高效的启发式搜索技术。本文尝试了应用TS方法来解决输电系统最优规划问题，发展了相应的数学模型和其法。3个算例系统的计算结果证明了这种方法的可行性。
篢ransmission network optimal planning prob-lem is a nonlinear, large scale combinatorial optimizationproblem. Although this problem has been extensively stud-ied, it is still not well solved. ln recent years, there is anenormous amount of interest in the applications of Genetic Al-gorithms (GA), Simulated Annealing (SA) and Tabu Search(TS) for solving some difficu1t or poorly characterized opti-mization problems with multi-medal or combinatorial nature.These methods are generally called II medern heuristic' tech-niques. The applications of GA and SA in solving the trans-mission network optimal planning problem are reported re-cently. TS is emerging as a new, highly efficient, searchparadigm for quickly finding high quality solutions to combi-natorial optimization problems. It is characterized by gather-ing konwledge during the search, and subsequently profitingfrom this knowledge. In this paper, the authors investigatethe application of TS to the transmission network optimalplanning problem, and develop the mathematical model andsolution algorithm. The test results for three sample systems,although preliminary, have verified the feasibility and effi-ciency of the developed TS based transmission network opti-mal planning method.
出处
《电网技术》
EI
CSCD
北大核心
1997年第5期2-7,共6页
Power System Technology
基金
国家自然科学基金青年基金
