Solving the simple plant location problem by genetic algorithm
From MaRDI portal
Recommendations
Cites work
- 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?)
- 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
- 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
Cited in
(32)- Fast bounding procedures for large instances of the simple plant location problem
- A simple filter-and-fan approach to the facility location problem
- Metaheuristic applications on discrete facility location problems: a survey
- scientific article; zbMATH DE number 1737515 (Why is no real title available?)
- A simple and deterministic competitive algorithm for online facility location
- A simple tabu search for warehouse location
- A hybrid multistart heuristic for the uncapacitated facility location problem
- New valid inequalities and facets for the simple plant location problem
- Heuristics for the dynamic facility location problem with modular capacities
- MIP models for connected facility location: a theoretical and computational study
- A separation algorithm for the simple plant location problem
- Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
- Tactical network planning for food aid distribution in Kenya
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
- A genetic algorithm with greedy crossover and elitism for capacity planning
- A fuzzy queuing location model with a genetic algorithm for congested systems
- Solving the uncapacitated facility location problem using tabu search
- A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
- A memetic algorithm for multi-objective dynamic location problems
- Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example
- GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS
- Soft arc consistency revisited
- Branch-and-cut-and-price for capacitated connected facility location
- An exact cooperative method for the uncapacitated facility location problem
- A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem
- RAMP experiments in solving the uncapacitated facility location problem
- An algorithmic framework for the exact solution of tree-star problems
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
- An aggressive reduction scheme for the simple plant location problem
- The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity
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)
