Heuristic Approaches to Integer Network Problems

SA32.1 Alternative Metaheuristic Approaches to the Multi-Resource Generalized Assignment Problem Mohammad M. Amini, Bahram Alidaee, Michael J. Racer --- Univ. of Memphis, Fogelman Coll., Memphis, TN 38152 , (mamini@cc.memphis.edu)

We present alternative metaheuristics to solve the MRGAP. These¨ metaheuristics include TS, the search space smoothing technique, the¨ noising method and a new hybrid metaheuristic, the dynamic search¨ space smoothing method. Computational results are discussed.

SA32.2 Interval-Pivoting Algorithms for the Interval-Flow Transportation Problem Aruna Apte, Richard S. Barr --- SMU, Dept. of Comp. Sci. & Eng., Dallas, TX 75275 , (aapte@seas.smu.edu)

The interval-flow version of the transportation model requires that¨ arc flows be either 0 or within a specified range. We present¨ interval-pivoting adjacent-extreme-point heuristics that employ a¨ nonstandard basis definition and TS to find near-optimal solutions¨ to large instances of these MIPs in seconds.

SA32.3 Destabilizing Target Systems: Probabilistic Network Optimization Models & Efficient Algorithms Richard S. Barr, Gregg Jernigan --- SMU, Dept. of Comp. Sci. & Eng., Dallas, TX 75275-0122, (barr@seas.smu.edu)

Target systems analysis evaluates the interconnected nature of¨ targets in making recommendations to achieve strategic objectives.¨ We present a probabilistic target systems analysis network model and¨ alternative heuristic algorithms for the nonlinear-integer¨ optimization problem of selecting the minimum-cost target set¨ required to meet system-level functional damage goals.