MODELO DE LOCALIZAÇÃO INDUSTRIAL PARA O PLANEJAMENTO DE UM PÓLO DE ALTA TECNOLOGIA

This paper introduces a new location model, which the main difference from mostalready presented in the literature is the explicit modeling of the synergy amongactivities of an industrial cluster. This model is introduced to study a real problem ofcompany allocation in a region located between Brasilia and Goiânia. As mostlocation models, this model is formulated as a problem of binary programming withthe same computational difficulties presented in usual combinatory optimizationproblems. It is a NP-Hard problem and, actually, very difficult to be solved by exactalgorithms. Moreover, this model presents an explicit nonlinearity inside the costfunction and also a set of dynamic constraints (constraints that change depending onthe chosen test solution) not allowing that the recent developments in binary linearprogramming can be used. Thus, we propose a heuristic solution based onevolutionary computation to deal with this problem. Finally, a careful analysis showsthe practical appealing of the found solution.

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

[2]  J. Beasley,et al.  A genetic algorithm for the set covering problem , 1996 .

[3]  M. Goodchild,et al.  Discrete space location-allocation solutions from genetic algorithms , 1986 .

[4]  Mark S. Daskin,et al.  Network and Discrete Location: Models, Algorithms and Applications , 1995 .

[5]  Manfred W. Padberg,et al.  Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut , 1991, INFORMS J. Comput..

[6]  Ellis L. Johnson,et al.  Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..

[7]  M. O'Kelly,et al.  A quadratic integer program for the location of interacting hub facilities , 1987 .

[8]  L A N Lorena,et al.  Genetic algorithms applied to computationally difficult set covering problems , 1997 .

[9]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[10]  Ignacio J. Ramirez-Rosado,et al.  Genetic algorithms applied to the design of large power distribution systems , 1998 .

[11]  Laurence A. Wolsey,et al.  Solving Mixed Integer Programming Problems Using Automatic Reformulation , 1987, Oper. Res..

[12]  A. Venables,et al.  Economic Integration and the Location of Firms , 1995 .

[13]  Rajan Batta,et al.  On the use of genetic algorithms to solve location problems , 2002, Comput. Oper. Res..

[14]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[15]  Alice E. Smith,et al.  Locating input and output points in facilities design - a comparison of constructive, evolutionary, and exact methods , 2001, IEEE Trans. Evol. Comput..

[16]  F. E. Maranzana,et al.  On the Location of Supply Points to Minimize Transport Costs , 1964 .

[17]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .

[18]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[19]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[20]  Haluk Topcuoglu,et al.  Solving the uncapacitated hub location problem using genetic algorithms , 2005, Comput. Oper. Res..

[21]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[22]  John F. Brotchie,et al.  Communication to the Editor—A General Planning Model , 1969 .

[23]  Erhan Kozan,et al.  An approach to determine storage locations of containers at seaport terminals , 2001, Comput. Oper. Res..

[24]  M. Brandeau,et al.  An overview of representative problems in location research , 1989 .