An ant colony optimization algorithm for partitioning graphs withsupply and demand.pdfVIP

A s R a b c d a A R R A A K A M G D S C 1 i f l D t ( t l c o g n n s c n o p n g h 1Applied Soft Computing 41 (2016) 317–330 Contents lists available at ScienceDirect Applied Soft Computing j ourna l h o mepage: www.elsev ier .com/ locate /asoc n ant colony optimization algorithm for partitioning graphs with upply and demand aka Jovanovica,?, Milan Tubab, Stefan Vo?c,d Qatar Environment and Energy Research Institute, Hamad bin Khalifa University, PO Box 5825, Doha, Qatar Faculty of Computer Science, Megatrend University, Belgrade, Serbia Institute of Information Systems, University of Hamburg, Von-Melle-Park 5, 20146 Hamburg, Germany Escuela de Ingenieria Industrial, Pontificia Universidad Católica de Valparaíso, Chile r t i c l e i n f o rticle history: eceived 4 December 2014 eceived in revised form 10 January 2016 ccepted 10 January 2016 vailable online 18 January 2016 a b s t r a c t In this paper we focus on finding high quality solutions for the problem of maximum partitioning of graphs with supply and demand (MPGSD). There is a growing interest for the MPGSD due to its close connection to problems appearing in the field of electrical distribution systems, especially for the optimization of self-adequacy of interconnected microgrids. We propose an ant colony optimization algorithm for the problem. With the goal of further improving the algorithm we combine it with a previously developed correction procedure. In our computational experiments we evaluate the performance of the proposedeywords: nt colony optimization icrogrid raph partitioning emand vertex upply vertex algorithm on trees, 3-connected graphs, series–parallel graphs and general graphs. The tests show that the method manages to find optimal solutions for more than 50% of the problem instances, and has an average relative error of less than 0.5% when compared to