Metaheuristic applications on discrete facility location problems: a survey
From MaRDI portal
Publication:260627
DOI10.1007/s12597-014-0190-5zbMath1332.90135OpenAlexW2086000131MaRDI QIDQ260627
Megha Sharma, Partha Sarathi Ghosh, Sumanta Basu
Publication date: 22 March 2016
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-014-0190-5
Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (3)
GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem ⋮ An efficient Benders decomposition for the \(p\)-median problem ⋮ Optimizing fortification plan of capacitated facilities with maximum distance limits
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A genetic algorithm for solving a capacitated \(p\)-median problem
- A simple tabu search for warehouse location
- Solving the uncapacitated hub location problem using genetic algorithms
- A hybrid modified PSO approach to VaR-based facility location problems with variable capacity in fuzzy random uncertainty
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- Location-routing: issues, models and methods
- Solving the semi-desirable facility location problem using bi-objective particle swarm
- A hybrid multistart heuristic for the uncapacitated facility location problem
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- The \(p\)-median problem: a survey of metaheuristic approaches
- A scatter search-based heuristic to locate capacitated transshipment points
- Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem
- Genetic algorithms for solving the discrete ordered median problem
- Scatter search for the single source capacitated facility location problem
- Facility location and supply chain management. A review
- A quadratic integer program for the location of interacting hub facilities
- An algorithm for solving large capacitated warehouse location problems
- On the exact solution of large-scale simple plant location problems
- An exact algorithm for the capacitated facility location problems with single sourcing
- Massively parallel analog tabu search using neural networks applied to simple plant location problems
- A genetic algorithm for the set covering problem
- An efficient tabu search procedure for the \(p\)-median problem
- A tabu search approach to the uncapacitated facility location problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Neighborhood search heuristics for the uncapacitated facility location problem
- Variable neighborhood tabu search and its application to the median cycle problem.
- An efficient genetic algorithm for the \(p\)-median problem
- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- A column generation approach to capacitated \(p\)-median problems
- A hybrid heuristic for the uncapacitated hub location problem
- Lagrangean heuristics for location problems
- A hybrid heuristic for the \(p\)-median problem
- Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study
- A new hybrid heuristic approach for solving large traveling salesman problem
- Obtaining test problems via Internet
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
- Facility location for large-scale emergencies
- A bi-objective reverse logistics network analysis for post-sale service
- Solving the uncapacitated facility location problem using tabu search
- Principles of scatter search
- A scatter search heuristic for the capacitated clustering problem
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Solving the simple plant location problem by genetic algorithm
- Context-Independent Scatter and Tabu Search for Permutation Problems
- The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- Heuristics for multiple facility location in a network using the variance criterion
- A hub covering model for cargo delivery systems
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model
- Properties and Solution Methods for Large Location-Allocation Problems
- TSPLIB—A Traveling Salesman Problem Library
- Tabu Search—Part I
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Tabu search for large location–allocation problems
- Uncapacitated and Capacitated Facility Location Problems
- The Location of Emergency Service Facilities
- Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
- Defining tabu list size and aspiration criterion within tabu search methods
- On the use of genetic algorithms to solve location problems
This page was built for publication: Metaheuristic applications on discrete facility location problems: a survey
