• Home
  • Search
  • Tabu Search Based Algorithm for Multi-Objective Network Reconfiguration Problem
  • Cite Icon4
  • https://doi.org/10.3968/j.est.1923847920110102.001Copy DOI Icon

Tabu Search Based Algorithm for Multi-Objective Network Reconfiguration Problem

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Abstract: The electric power distribution usually operates in a radial configuration, with tie switches between circuits to provide alternate feeds. The losses would be minimized if all switches were closed, but this is not done because it complicates the system’s protection against over currents. Whenever components fail, some of the switches must be operated to restore power to as many customers as possible. As loads vary with time, switch operations may reduce losses in the system. All of these are applications for reconfiguration. The reconfiguration problem is combinatorial problem, which precludes algorithms that guarantee a global optimum. Most existing reconfiguration algorithms fall into two categories. In the first, branch exchange, the system operates in a feasible radial configuration and the algorithm opens and closes candidate switches in pairs. In the second, loop cutting, the system is completely meshed and the algorithm opens candidate switches to reach a feasible radial configuration. Reconfiguration algorithms based on neural network, heuristics, genetic algorithms, and simulated annealing have also been reported, but not widely used. The objective of the paper presented in this work is to make a Tabu Search (TS) based algorithm for multi-objective programming to solve the network reconfiguration problem in a radial distribution system. Here six objectives are considered in conjunction with network constraints. The main objective of research is allocation of optimal switches to reduce the power losses of the system. It is tested for 33 bus systems. Simulation results of the case studies demonstrate the effectiveness of the solution algorithm and proved that the TS is suitable to solve this kind of problems. Key words: Combinatorial optimization; Distribution system; Energy Loss minimization; Genetic Algorithm; Simulating Annealing; Tabu search

Similar Papers
  • Research Article

Supervised Learning with Hybrid Global Optimisation Methods. Case Study: Automated Recognition and Classification of Cork Tiles

  • Jan 01, 2009
  • BiblioBoard Library Catalog (Open Research Library)
  • Antoniya Georgieva +1
  • Research Article
  • Citations2

RESOURCE MANAGEMENT IN WIDEBAND CDMA SYSTEMS USING GENETIC ALGORITHMS

  • Dec 09, 2004
  • Applied Artificial Intelligence
  • T M Chan +2
  • Research Article
  • Citations200

Evolutionary algorithms, simulated annealing and tabu search: a comparative study

  • Mar 13, 2001
  • Engineering Applications of Artificial Intelligence
  • Habib Youssef +2
  • Conference Article
  • Citations14

An Improved Genetic Algorithm

  • Dec 01, 2019
  • Liyuan Deng +2
  • Research Article
  • Citations19

Method for Loss Minimum Re-configuration Problem of Distribution System by Tabu Search

  • Jan 01, 2003
  • IEEJ Transactions on Power and Energy
  • Yuji Mishima +4
  • Research Article
  • Citations214

A comparative study of various meta-heuristic techniques applied to the multilevel thresholding problem

  • Nov 05, 2009
  • Engineering Applications of Artificial Intelligence
  • Kamal Hammouche +2
  • Research Article
  • Citations42

Comparison of Performance of Heuristic Search Methods for Phase Velocity Inversion in Shallow Surface Wave Method

  • Jun 01, 2005
  • Journal of Environmental and Engineering Geophysics
  • Hiroaki Yamanaka
  • Research Article

적합성 함수를 이용한 2차원 저장소 적재 문제의 휴리스틱 알고리즘

  • Oct 31, 2009
  • The KIPS Transactions:PartB
  • Yong-Ho Yon +2
  • Research Article
  • Citations4

Fast solution of radial distribution networks with automated compensation and reconfiguration

  • Sep 14, 2000
  • Electric Power Systems Research
  • Antonino Augugliaro* +3
  • Research Article
  • Citations99

Examining the performance of six heuristic optimisation techniques in different forest planning problems

  • Jan 01, 2005
  • Silva Fennica
  • Timo Pukkala +1
  • Research Article
  • Citations126

Solving a dynamic cell formation problem using metaheuristics

  • Feb 16, 2005
  • Applied Mathematics and Computation
  • R Tavakkoli-Moghaddam +3
  • Conference Article
  • Citations2

Optimal structuring element extraction for MST-based shapes description using tabu search

  • Oct 14, 1996
  • Tianzi Jiang +1
  • Research Article
  • Citations26

Tabu search with simulated annealing for solving a location–protection–disruption in hub network

  • Nov 19, 2021
  • Applied Soft Computing
  • Arun Kumar Sangaiah +1
  • Research Article
  • Citations179

Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem

  • Aug 01, 1998
  • INFORMS Journal on Computing
  • H A J Crauwels +2
  • Research Article
  • Citations18

Comparison of meta-heuristic algorithms for clustering rectangles

  • Oct 01, 1999
  • Computers & Industrial Engineering
  • Edmund Burke +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.