Solving the simple plant location problem by genetic algorithm
The authors have tried to explore limits of genetic algorithm employed for solving hard integer programming problem. The suggested algorithm belongs to family of metaheuristics working with a set of feasible solutions considered as a population of individuals. The algorithm simulates development of a population in the nature by resembling of selection, crossover and mutation. Algorithms of this family can avoid a local minimum trap but it is commonly known that their convergence is very slow. To study properties of the algorithm, the well known simple plant location problem was chosen. This problem constituted object of researchers interest in the past twenty years and this way the previous studies provide not only considerable set of benchmarks but even methods producing exact solution of the problems, making use of these preliminaries the authors investigated behaviour of their algorithm. They compared it with Erlenkotters exact approach and showed that their metaheuristic employed for very large instances of the problem yields an optimal solution with the same frequency as the exact approach, but in a fraction of the associated time.
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Lagrangean dual ascent algorithm for simple plant location problems
- A projection method for the uncapacitated facility location problem
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- Facility location models for distribution planning
- scientific article; zbMATH DE number 4202014 (Why is no real title available?)
- scientific article; zbMATH DE number 634020 (Why is no real title available?)
- scientific article; zbMATH DE number 1737515 (Why is no real title available?)
- Lagrangean heuristics for location problems
- Location problems
- Locational analysis
- Obtaining test problems via Internet
- On the exact solution of large-scale simple plant location problems
- The simple plant location problem: Survey and synthesis
- Uncapacitated facility location: General solution procedure and computational experience
- New valid inequalities and facets for the simple plant location problem
- An algorithmic framework for the exact solution of tree-star problems
- Fast bounding procedures for large instances of the simple plant location problem
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- Heuristics for the dynamic facility location problem with modular capacities
- A separation algorithm for the simple plant location problem
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
- Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- Solving the uncapacitated facility location problem using tabu search
- A simple filter-and-fan approach to the facility location problem
- An aggressive reduction scheme for the simple plant location problem
- Metaheuristic applications on discrete facility location problems: a survey
- A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem
- Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
- Tactical network planning for food aid distribution in Kenya
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
- The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity
- GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS
- scientific article; zbMATH DE number 1737515 (Why is no real title available?)
- An exact cooperative method for the uncapacitated facility location problem
- A genetic algorithm with greedy crossover and elitism for capacity planning
- RAMP experiments in solving the uncapacitated facility location problem
- A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
- Branch-and-cut-and-price for capacitated connected facility location
- A simple and deterministic competitive algorithm for online facility location
- A simple tabu search for warehouse location
- MIP models for connected facility location: a theoretical and computational study
- A hybrid multistart heuristic for the uncapacitated facility location problem
- A fuzzy queuing location model with a genetic algorithm for congested systems
- A memetic algorithm for multi-objective dynamic location problems
- Soft arc consistency revisited
This page was built for publication: Solving the simple plant location problem by genetic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2765605)
