Partitioning of supply/demand graphs with capacity limitations: an ant colony approach

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

In recent years there has been a growing interest for the problem of the minimal partitioning of graphs with supply and demand, due to its close connection to electrical distribution systems, especially in the context of smartgrids. In this paper we present a new version of the problem which is more suitable for practical applications in modeling such systems. More precisely, the constraint of having a unique supply node in a subgraph (partition) is substituted with a limit on the number of subgraphs and the capacity for each of them. The problem is initially solved by a two stage greedy method. With the goal of further improving the quality of found solutions, a corresponding GRASP and an ant colony optimization algorithm are developed. Due to the novelty of the problem, we include a description of a method for generating test instances with known optimal solutions. In our computational experiments we evaluate the performance of the proposed algorithms on both trees and general graphs. The tests show that the proposed ant colony approach manages to frequently find optimal solutions. It has an average relative error of less than 2 % when compared to known optimal solutions. Moreover, it outperform the GRASP.

Original languageEnglish
JournalJournal of Combinatorial Optimization
DOIs
Publication statusAccepted/In press - 18 Aug 2015

Keywords

  • Ant colony optimization
  • Combinatorial optimization
  • Demand vertex
  • Graph partitioning
  • GRASP
  • Microgrid
  • Supply vertex

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics
  • Computational Theory and Mathematics
  • Computer Science Applications
  • Control and Optimization

Fingerprint Dive into the research topics of 'Partitioning of supply/demand graphs with capacity limitations: an ant colony approach'. Together they form a unique fingerprint.

  • Cite this