Binary and Integer Coded Backtracking Search Optimization Algorithm for Transmission Network Expansion Planning

摘要

This paper proposes binary and integer coded of backtracking search (BS) technique for solving the Transmission Network Expansion Planning (TNEP) considering security constraints. TNEP is formulated as a mixed integer, non-linear, non-convex optimization problem. It aims to optimally select of the routs, types, and number of the added circuits to meet economically the expected future load forecasted while the operational and planning constrained are considered. The BS technique has various significant advantages of being simple structure, having single control parameter, and operating with two new tuned mutation and crossover which control the amplitude of the search-direction matrix and search space boundaries. The BS technique is applied to solve the TNEP problem on two Egyptian networks namely West Delta System (WDS) and 500 kV of Extra High Voltage System (EHVS) where the predicted load forecasting up to 2030 is based on the adaptive neuro-fuzzy inference system (ANFIS). The simulation results for the two realistic networks show the capability of the proposed technique to solve efficiently the TNEP problem and their superiority over the heuristic technique, the integer-based particle swarm optimization (IBPSO) technique and multi-verse optimizer (MVO) at acceptable economical and technical benefits.