Metaheuristic applications on discrete facility location problems: a survey
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1253050 (Why is no real title available?)
- scientific article; zbMATH DE number 1982184 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- A bi-objective reverse logistics network analysis for post-sale service
- A column generation approach to capacitated p-median problems
- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- A genetic algorithm for solving a capacitated \(p\)-median problem
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- A genetic algorithm for the set covering problem
- A hub covering model for cargo delivery systems
- A hybrid heuristic for the \(p\)-median problem
- A hybrid heuristic for the uncapacitated hub location problem
- A hybrid modified PSO approach to VaR-based facility location problems with variable capacity in fuzzy random uncertainty
- A hybrid multistart heuristic for the uncapacitated facility location problem
- A new hybrid heuristic approach for solving large traveling salesman problem
- A quadratic integer program for the location of interacting hub facilities
- A scatter search heuristic for the capacitated clustering problem
- A scatter search-based heuristic to locate capacitated transshipment points
- A simple tabu search for warehouse location
- A tabu search approach to the uncapacitated facility location problem
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- An algorithm for solving large capacitated warehouse location problems
- An efficient genetic algorithm for the \(p\)-median problem
- An efficient tabu search procedure for the p-median problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- Context-independent scatter and tabu search for permutation problems
- Defining tabu list size and aspiration criterion within tabu search methods
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Facility location and supply chain management. A review
- Facility location for large-scale emergencies
- Genetic algorithms for solving the discrete ordered median problem
- Heuristics for multiple facility location in a network using the variance criterion
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Lagrangean heuristics for location problems
- Location-routing: issues, models and methods
- Massively parallel analog tabu search using neural networks applied to simple plant location problems
- Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem
- Neighborhood search heuristics for the uncapacitated facility location problem
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- Obtaining test problems via Internet
- On the exact solution of large-scale simple plant location problems
- On the use of genetic algorithms to solve location problems
- Principles of scatter search
- Properties and Solution Methods for Large Location-Allocation Problems
- Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
- Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model
- Scatter search for the single source capacitated facility location problem
- Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study
- Solving the semi-desirable facility location problem using bi-objective particle swarm
- Solving the simple plant location problem by genetic algorithm
- Solving the uncapacitated facility location problem using tabu search
- Solving the uncapacitated hub location problem using genetic algorithms
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- TSPLIB—A Traveling Salesman Problem Library
- Tabu Search—Part I
- Tabu search for large location–allocation problems
- The Location of Emergency Service Facilities
- The \(p\)-median problem: a survey of metaheuristic approaches
- The reliable facility location problem: formulations, heuristics, and approximation algorithms
- Uncapacitated and capacitated facility location problems
- Variable neighborhood tabu search and its application to the median cycle problem.
Cited in
(9)- Optimizing fortification plan of capacitated facilities with maximum distance limits
- Developing effective meta-heuristics for a probabilistic location model via experimental design
- A survey of adaptive large neighborhood search algorithms and applications
- Good solutions to discrete noxious location problems via metaheuristics
- An efficient Benders decomposition for the \(p\)-median problem
- GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem
- An effective aggregation heuristic for capacitated facility location problems with many demand points
- Solution of stochastic facility location problems with combinatorially many decision-dependent distributions
- scientific article; zbMATH DE number 1866926 (Why is no real title available?)
This page was built for publication: Metaheuristic applications on discrete facility location problems: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q260627)
