Solucoes Aproximadas para o Problema de Localizacao Simples. Algorithmo SimulatedAnnealing (Approximative Solutions for the Simple Plant Location Problem. Simulated Annealing Algorithm)

摘要

The Simple Plant Location (SPL) is a NP-hard problem that arises in a greatvariety of real world situations. Given a finite set of possible locations for establishing new facilities, SPL deals with the supply of a single commodity from a subset of these to a set of clients with a prescribed demand for the commodity. The authors seek a minimum cost production/transportation plan satisfying all demands. They begin giving a review of locational models. They present the SPL formulation, complexity and some of its principal solving methods. Simulated Annealing is a new approach to the approximative solution of difficult combinatorial optimization problems. They introduce the algorithm and physical analogy on which annealing is based. Finally, they present computational results of our experiments on choosing the various annealing parameters and they compare the results of two implementations with starting random solutions and starting heuristic solutions and also with local optimization algorithms.