An efficient tabu search procedure for the \(p\)-median problem

DOI10.1016/S0377-2217(96)00141-5zbMath0924.90102OpenAlexW2013634794WikidataQ58615072 ScholiaQ58615072MaRDI QIDQ1278496

Erik Rolland, John R. Current, David A. Schilling

Publication date: 22 February 1999

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00141-5

zbMATH Keywords

tabu search\(p\)-median problemfacility locationheuristic

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

Problems of discrete optimization: challenges and main approaches to solve them, The minimum weighted covering location problem with distance constraints, A neural model for the \(p\)-median problem, BEAMR: an exact and approximate model for the \(p\)-median problem, Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem, Emergency facility location under random network damage: insights from the Istanbul case, A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation, The \(p\)-median problem: a survey of metaheuristic approaches, A branch-and-price algorithm for the capacitated facility location problem, A genetic algorithm for the \(p\)-median problem with pos/neg weights, Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model, Computational study of large-scale \(p\)-median problems, The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic, A scatter search-based heuristic to locate capacitated transshipment points, A Lagrangian search method for the \(P\)-median problem, Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem, A Fast Tabu Search Algorithm for the Reliable P-Median Problem, Designing humanitarian supply chains by incorporating actual post-disaster decisions, A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights, Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution, Neighborhood search heuristics for the uncapacitated facility location problem, A Branch Decomposition Algorithm for the p-Median Problem, Variations in the flow approach to CFCLP-TC for multiobjective supply chain design, A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices, Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles, An ant colony algorithm for the pos/neg weighted \(p\)-median problem, A hybrid firefly-genetic algorithm for the capacitated facility location problem, The multi-facility location-allocation problem with polyhedral barriers, On solving unreliable planar location problems, A fast swap-based local search procedure for location problems, A bilevel fixed charge location model for facilities under imminent attack, Variable neighborhood search: Principles and applications, Bounds for the single source modular capacitated plant location problem, Solving the uncapacitated facility location problem using tabu search, A Lagrangean heuristic for the plant location problem with multiple facilities in the same site, Defining tabu list size and aspiration criterion within tabu search methods, Affinity propagation and uncapacitated facility location problems, Pharmacy duty scheduling problem, A gamma heuristic for the \(p\)-median problem, Optimal location with equitable loads, Exemplar-based clustering via simulated annealing, Heuristic concentration and tabu search: A head to head comparison, Network distance characteristics that affect computational effort in \(p\)-median location problems, Heuristics for Location Models, Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases, Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works, Metaheuristic applications on discrete facility location problems: a survey

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using tabu search techniques for graph coloring
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• Tabu search techniques. A tutorial and an application to neural networks
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• The median tour and maximal covering tour problems: Formulations and heuristics
• Extensions of a tabu search adaptation to the quadratic assignment problem
• The depth and width of local minima in discrete solution spaces
• Future paths for integer programming and links to artificial intelligence
• State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
• An Overview of Representative Problems in Location Research
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• A Dual-Bounded Algorithm for the p-Median Problem
• Tabu Search—Part I
• Tabu Search—Part II
• Tabu Search Applied to the Quadratic Assignment Problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Technical Note—An Algorithm for the p-Median Problem
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph