Two metaheuristics for solving the connected multidimensional maximum bisection problem
- 113 Downloads
In this paper, a connected multidimensional maximum bisection problem is considered. This problem is a generalization of a standard NP-hard maximum bisection problem, where each graph edge has a vector of weights and induced subgraphs must be connected. We propose two metaheuristic approaches, a genetic algorithm (GA) and an electromagnetism-like metaheuristic (EM). The GA uses modified integer encoding of individuals, which enhances the search process and enables usage of standard genetic operators. The EM, besides standard attraction–repulsion mechanism, is extended with a scaling procedure, which additionally moves EM points closer to local optima. A specially constructed penalty function, used for both approaches, is performed as a practical technique for temporarily including infeasible solutions into the search process. Both GA and EM use the same local search procedure based on 1-swap improvements. Computational results were obtained on instances from literature with up to 500 vertices and 60,000 edges. EM reaches all known optimal solutions on small-size instances, while GA reaches all known optimal solutions except for one case. Both proposed methods give results on medium-size and large-scale instances, which are out of reach for exact methods.
KeywordsGenetic algorithms Electromagnetism-like approach Evolutionary computation Graph bisection Combinatorial optimization
Compliance with ethical standards
Conflict of interest
Z. Maksimović, J. Kratica and A. Savić state that there are no conflicts of interest.
This article does not contain any studies with human subjects.
Research involving human participants and/or animals
This article does not contain any studies with human or animal subjects.
- Filipović V (2011) An electromagnetism metaheuristic for the uncapacitated multiple allocation hub location problem. Serd J Comput 5(3):261–272Google Scholar
- Maksimović Z (2015a) A connected multidimensional maximum bisection problem. Preprint. arXiv:1512.00614
- Maksimović Z (2015b) A multidimensional maximum bisection problem. Preprint. arXiv:1506.07731
- Słowik A, Białko M (2006) Partitioning of vlsi circuits on subcircuits with minimal number of connections using evolutionary algorithm. In: Rutkowski L, Tadeusiewicz R, Zadeh LA, Zurada J (eds) Artificial intelligence and soft computing—ICAISC 2006, Springer, Berlin, Heidelberg pp 470–478Google Scholar