A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
- 1 August 1994
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 42 (4) , 677-687
- https://doi.org/10.1287/opre.42.4.677
Abstract
We present a greedy randomized adaptive search procedure (GRASP) for the network 2-partition problem. The heuristic is empirically compared with the Kernighan-Lin (K&L) method on a wide range of instances. The GRASP approach dominates K&L with respect to solution value on a large percentage of the instances tested. The ability of GRASP to find optimal solutions is assessed by comparing its performance with a general purpose mixed integer programming package.Keywords
This publication has 0 references indexed in Scilit: