| Article ID: | iaor1995294 |
| Country: | United States |
| Volume: | 42 |
| Issue: | 4 |
| Start Page Number: | 677 |
| End Page Number: | 687 |
| Publication Date: | Jul 1994 |
| Journal: | Operations Research |
| Authors: | Feo Thomas A., Laguna Manuel, Elrod Hal C. |
| Keywords: | Randomized adaptive search |
The authors 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.