Solution algorithm based on multi-stage tabu search for nested combinatorial optimization problem

K. Nara*, Y. Hayashi

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

Abstract

In this paper, the authors propose a new solution algorithm to solve a combinatorial optimization problem which determines installation and operation of Dispersed Energy Storages and Generators (DSG) in the electrical power system. Since the problem to determine the installation of DSG includes a problem which determines the operation of DSG. In the solution algorithm, temporarily determining the installation of DSG by TS, the operation of DSG is also determined by TS. The proposed algorithm consists of nested use of TS which can obtain approximate optimal solutions for the both combinatorial optimization problems (installation and operation). To demonstrate the validity of the algorithm, several numerical results are shown.

Original languageEnglish
Pages (from-to)III-551 - III-556
JournalProceedings of the IEEE International Conference on Systems, Man and Cybernetics
Volume3
Publication statusPublished - 1999 Dec 1
Externally publishedYes
Event1999 IEEE International Conference on Systems, Man, and Cybernetics 'Human Communication and Cybernetics' - Tokyo, Jpn
Duration: 1999 Oct 121999 Oct 15

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Hardware and Architecture

Fingerprint

Dive into the research topics of 'Solution algorithm based on multi-stage tabu search for nested combinatorial optimization problem'. Together they form a unique fingerprint.

Cite this