Neighborhood search heuristics for the uncapacitated facility location problem

DOI10.1016/S0377-2217(02)00504-0zbMath1023.90524OpenAlexW2081029938MaRDI QIDQ1400664

Diptesh Ghosh

Publication date: 13 August 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00504-0

zbMATH Keywords

heuristicstabu searchlocal searchgreedyuncapacitated facility locationcomplete local search with memory

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

A study on the budget constrained facility location model considering inventory management cost, A novel differential evolution algorithm for binary optimization, AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS, Emergency facility location under random network damage: insights from the Istanbul case, A hybrid multistart heuristic for the uncapacitated facility location problem, The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic, Agile optimization for a real‐time facility location problem in Internet of Vehicles networks, Approximation algorithm for squared metric facility location problem with nonuniform capacities, Semi-Lagrangian relaxation applied to the uncapacitated facility location problem, An exact cooperative method for the uncapacitated facility location problem, New valid inequalities and facets for the simple plant location problem, A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand, Solving the uncapacitated facility location problem using tabu search, 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, An improved Lagrangian relaxation and dual ascent approach to facility location problems, An aggressive reduction scheme for the simple plant location problem, Pharmacy duty scheduling problem, A separation algorithm for the simple plant location problem, Metaheuristic applications on discrete facility location problems: a survey

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the exact solution of large-scale simple plant location problems
• An efficient tabu search procedure for the \(p\)-median problem
• A competitive local search heuristic for the subset sum problem
• A two-phase tabu search approach to the location routing problem
• Methods of finding all minimum coverings of a graph by cliques
• The Discrete Two-Dimensional Assortment Problem
• A Dual-Based Procedure for Uncapacitated Facility Location
• The Assortment Problem with Nonlinear Cost Functions
• The Plant Location Problem: New Models and Research Prospects