A PROBE-Based Heuristic for Graph Partitioning

Author

Chardaire, Pierre ; Barake, Musbah ; McKeown, Geoff P.

Author_Institution

Univ. of East Anglia, Norwich

Volume

56

Issue

12

fYear

2007

Firstpage

1707

Lastpage

1720

Abstract

A new heuristic algorithm, PROBE_BA, which is based on the recently introduced metaheuristic paradigm population- reinforced optimization-based exploration (PROBE), is proposed for solving the Graph Partitioning Problem. The "exploration" part of PROBE_BA is implemented by using the differential-greedy algorithm of Battiti and Bertossi and a modification of the Kernighan-Lin algorithm at the heart of Bui and Moon\´s genetic algorithm BFS _GBA. Experiments are used to investigate properties of PROBE and show that PROBE_BA compares favorably with other solution methods based on genetic algorithms, randomized reactive tabu search, or more specialized multilevel partitioning techniques. In addition, PROBE_BA finds new best cut values for 10 of the 34 instances in Walshaw\´s graph partitioning archive.

Keywords

genetic algorithms; graph theory; greedy algorithms; search problems; differential-greedy algorithm; genetic algorithm; graph partitioning problem; metaheuristic algorithm; population- reinforced optimization-based exploration; randomized reactive tabu search; Computer science; Genetic algorithms; Heart; Heuristic algorithms; Joining processes; Parallel processing; Partitioning algorithms; Probes; Sparse matrices; Very large scale integration; Evolutionary computing; graph algorithms; graph bisection; graph partitioning.; heuristic methods;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/TC.2007.70760

Filename

4358219