Partitioning of supply/demand graphs with capacity limitations: an ant colony approach
From MaRDI portal
Publication:1698074
DOI10.1007/s10878-015-9945-zzbMath1394.90485OpenAlexW1157274590MaRDI QIDQ1698074
Raka Jovanovic, Stefan Voß, Abdelkader Bousselham
Publication date: 21 February 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9945-z
combinatorial optimizationGRASPgraph partitioningant colony optimizationmicrogriddemand vertexsupply vertex
Related Items (2)
Model and algorithm of routes planning for emergency relief distribution in disaster management with disaster information update ⋮ A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs
Cites Work
- A heuristic method for solving the problem of partitioning graphs with supply and demand
- Looking ahead with the pilot method
- Balanced graph partitioning
- Approximability of partitioning graphs with supply and demand
- Greedy randomized adaptive search procedures
- Semi-greedy heuristics: An empirical study
- Minimum cost partitions of trees with supply and demand
- Generating partitions of a graph into a fixed number of minimum weight cuts
- Computing finest mincut partitions of a graph and application to routing problems
- Ant colony optimization theory: a survey
- A New Heuristic for Partitioning the Nodes of a Graph
- Modelling the Power Supply Network – Hardness and Approximation
- Parametric Power Supply Networks
- PARTITIONING TREES OF SUPPLY AND DEMAND
This page was built for publication: Partitioning of supply/demand graphs with capacity limitations: an ant colony approach
