Transmission expansion planning (TEP) is one of the critical issues of the deregulated electricity market. In view of this, a salp swarm algorithm (SSA) is being considered in the present work for the solution of TEP problem with the added security constraint. The features of SSA algorithm are its foraging behavior of salps swarming in the oceans. Under the TEP problem, the work considered here is to determine the cost-effective expansion planning in the deregulated electricity market. For this act, some of the important constraints such as power flow of the lines, right-of-way’s validity and maximum line addition are taken into consideration. The studied power system networks are IEEE 25-bus system, Brazilian 46-bus system and Columbian 93-bus system for the study of TEP problem. The results are compared to those offered by some other state-of-the-art algorithms. It showed that SSA is effective algorithm for the TEP problem.

中文翻译：

---

一种具有安全约束的扩展规划的新型 Salp Swarm 算法

输电扩张计划 (TEP) 是电力市场放松管制的关键问题之一。鉴于此，目前正在考虑使用 Salp swarm 算法（SSA）来解决具有附加安全约束的 TEP 问题。SSA 算法的特点是其对海洋中成群的海藻的觅食行为。在 TEP 问题下，这里考虑的工作是确定解除管制的电力市场中具有成本效益的扩张计划。对于该法案，考虑了一些重要的约束，例如线路的功率流、通行权的有效性和最大线路添加量。研究的电力系统网络有IEEE 25 总线系统、巴西46 总线系统和哥伦比亚93 总线系统，用于研究TEP 问题。结果与其他一些最先进的算法提供的结果进行了比较。表明SSA是解决TEP问题的有效算法。