Solving the simple plant location problem by genetic algorithm
From MaRDI portal
Publication:2765605
DOI10.1051/ro:2001107zbMath0995.90055OpenAlexW2126424258MaRDI QIDQ2765605
Ivana Ljubić, Vladimir Filipović, Jozef Kratica, Dušan Tošić
Publication date: 17 October 2002
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2001__35_1_127_0
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (29)
Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example ⋮ Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem ⋮ The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity ⋮ Tactical network planning for food aid distribution in Kenya ⋮ A hybrid multistart heuristic for the uncapacitated facility location problem ⋮ Multi-language evaluation of exact solvers in graphical model discrete optimization ⋮ 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 ⋮ An exact cooperative method for the uncapacitated facility location problem ⋮ A fuzzy queuing location model with a genetic algorithm for congested systems ⋮ New valid inequalities and facets for the simple plant location problem ⋮ An algorithmic framework for the exact solution of tree-star problems ⋮ A memetic algorithm for multi-objective dynamic location problems ⋮ Fast bounding procedures for large instances of the simple plant location problem ⋮ Soft arc consistency revisited ⋮ Solving the uncapacitated facility location problem using tabu search ⋮ A simple filter-and-fan approach to the facility location problem ⋮ 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 ⋮ An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem ⋮ Heuristics for the dynamic facility location problem with modular capacities ⋮ A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem ⋮ An improved Lagrangian relaxation and dual ascent approach to facility location problems ⋮ An aggressive reduction scheme for the simple plant location problem ⋮ GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS ⋮ A separation algorithm for the simple plant location problem ⋮ Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing ⋮ Metaheuristic applications on discrete facility location problems: a survey
Cites Work
- A Lagrangean dual ascent algorithm for simple plant location problems
- A projection method for the uncapacitated facility location problem
- Location problems
- Facility location models for distribution planning
- On the exact solution of large-scale simple plant location problems
- Locational analysis
- Uncapacitated facility location: General solution procedure and computational experience
- Lagrangean heuristics for location problems
- The simple plant location problem: Survey and synthesis
- Obtaining test problems via Internet
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- A Dual-Based Procedure for Uncapacitated Facility Location
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving the simple plant location problem by genetic algorithm
