A simple and effective genetic algorithm for the two-stage capacitated facility location problem
Authors:
- Diogo R.M. FernandesDFDiogo R.M. Fernandes
- Caroline RochaCRCaroline Rocha
- Daniel AloiseDADaniel Aloise
- Glaydston M. RibeiroGRGlaydston M. Ribeiro
- Enilson M. SantosESEnilson M. Santos
- Allyson SilvaASAllyson Silva
- 1 September 2014
- journal article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 75, 200-208
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Design and analysis of hybrid metaheuristics for the Reliability p-Median ProblemEuropean Journal of Operational Research, 2012
- Integrated Model for Refinery Planning, Oil Procuring, and Product DistributionIndustrial & Engineering Chemistry Research, 2008
- A scatter search-based heuristic to locate capacitated transshipment pointsComputers & Operations Research, 2007
- On the use of genetic algorithms to solve location problemsComputers & Operations Research, 2002
- Variable neighborhood search: Principles and applicationsEuropean Journal of Operational Research, 2001
- A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problemEuropean Journal of Operational Research, 2000
- An Efficient Implementation of a Scaling Minimum-Cost Flow AlgorithmJournal of Algorithms, 1997
- Discrete space location-allocation solutions from genetic algorithmsAnnals of Operations Research, 1986
- The Lagrangian Relaxation Method for Solving Integer Programming ProblemsManagement Science, 1981
- Lagrangean Relaxation Applied to Capacitated Facility Location ProblemsA I I E Transactions, 1978