Issue No.12 - December (2007 vol.56)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2007.70760
A new heuristic algorithm, PROBE BA, based onthe recently introduced metaheuristic paradigm PROBE (PopulationReinforced Optimization Based Exploration) is proposedfor solving the Graph Partitioning Problem. The "exploration"part of PROBE BA is implemented using the Differential-Greedyalgorithm of Battiti and Bertossi and a modification of theKernighan and Lin algorithm at the heart of Bui and Moon'sGenetic Algorithm, BFS GBA. Experiments are used to investigateproperties of PROBE and show that PROBE BA comparesfavourably with other solution methods based on Genetic Algorithms,Randomized Reactive Tabu Search, or more specializedmultilevel partitioning techniques. In addition, PROBE BA findsnew best cut values for 10 of the 34 instances in Walshaw's GraphPartitioning Archive.
Evolutionary computing, heuristic methods, graph algorithms, graph bisection, graph partitioning.
Pierre Chardaire, Musbah Barake, Geoff P. McKeown, "A PROBE-Based Heuristic for Graph Partitioning", IEEE Transactions on Computers, vol.56, no. 12, pp. 1707-1720, December 2007, doi:10.1109/TC.2007.70760