On solving complex multi-period location models using simulated annealing

This paper describes a study aimed at evaluating the capabilities of simulated annealing in dealing with complex, real-world multi-period location problems raised by school network planning in Portugal. The problems were formulated as mixed-integer linear optimization models. The models allow for facility closure or size reduction besides facility opening and size expansion, with sizes possibly limited to a set of pre-defined standards. They assume facility costs to be divided into a fix component and two variable components, respectively dependent on facility size and facility attendance. Results obtained through the study indicate that simulated annealing can be a useful tool for solving these kinds of models.

[1]  J. Krarup,et al.  The impact of distance on location problems , 1980 .

[2]  Alfred A. Kuehn,et al.  A Heuristic Program for Locating Warehouses , 1963 .

[3]  Gary M. Roodman,et al.  Optimal and Heuristic Facility Phase-out Strategies , 1975 .

[4]  George L. Nemhauser,et al.  The uncapacitated facility location problem , 1990 .

[5]  Alexander Shulman,et al.  An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes , 1991, Oper. Res..

[6]  Martin W. P. Savelsbergh,et al.  MINTO, a mixed INTeger optimizer , 1994, Oper. Res. Lett..

[7]  António Pais Antunes,et al.  ON SOLVING PUBLIC FACILITY PLANNING PROBLEMS USING GENERAL MIXED-INTEGER PROGRAMMING METHODS , 2000 .

[8]  J. Krarup,et al.  The simple plant location problem: Survey and synthesis , 1983 .

[9]  V. Srinivasan,et al.  The Multiregion Dynamic Capacity Expansion Problem, Part II , 1981, Oper. Res..

[10]  António Pais Antunes,et al.  A dynamic optimization model for school network planning , 2000 .

[11]  Tony J. Van Roy,et al.  A Dual-Based Procedure for Dynamic Facility Location , 1982 .

[12]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[13]  Søren Kruse Jacobsen,et al.  On the use of tree-indexing methods in transportation algorithms , 1978 .

[14]  John Dinwoodie.  Network and discrete location: Models, algorithms and applications: Mark S. Daskin Wiley New York (1995) £58 ISBN 0 47101 897 , 1996 .

[15]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[16]  Jeremy F. Shapiro,et al.  A Dynamic Optimization Model of Depletable Resources , 1980 .

[17]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[18]  Gary M. Roodman,et al.  Extensions of the Multi-Period Facility Phase-Out Model: New Procedures and Application to a Phase-In/Phase-Out Problem , 1977 .

[19]  Terry P. Harrison,et al.  A mathematical programming approach to elementary school facility decisions , 1987 .

[20]  Martine Labbé,et al.  Facility location analysis: theory and applications , 1989 .

[21]  Kathryn A. Dowsland,et al.  Using Simulated Annealing for Efficient Allocation of Students to Practical Classes , 1993 .

[22]  T. L. Ray,et al.  Warehouse Location Under Continuous Economies of Scale , 1966 .