Comparison of Algorithms for Nonlinear Integer Optimization: Application to Monitoring Network Design

Abstract

This paper presents an empirical comparison of eight heuristic algorithms for solving nonlinear integer optimization problems. The algorithms are first applied to a simple network location problem to assess their relative performance. The best performing algorithms are then applied to a more complex test problem involving an irregular correlation surface and partitioned spatial domain, typical of a ground-water monitoring network design application. Simulated annealing and TABU search exhibit superior performance among the six heuristic methods and two supplemental nonlinear integer optimization solvers that were tested.