Paper Info
Title
Partitioning of supply/demand graphs with capacity limitations: an ant colony approach
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.
Year
DOI
Venue
2018
10.1007/s10878-015-9945-z
J. Comb. Optim.
Keywords
Field
DocType
Ant colony optimization,Microgrid,Graph partitioning,Demand vertex,Supply vertex,Combinatorial optimization,GRASP
Ant colony optimization algorithms,Mathematical optimization,Combinatorics,GRASP,Combinatorial optimization,Greedy algorithm,Graph partition,Ant colony,Mathematics,Approximation error,Metaheuristic
Journal
Volume
Issue
ISSN
35
1
1382-6905
Citations 
PageRank 
References 
4
0.43
21
Authors
3
Name
Order
Citations
PageRank
Raka Jovanovic11218.70
Abdelkader Bousselham2212.32
Stefan Voß359246.77