A hybrid multistart heuristic for the uncapacitated facility location problem

DOI10.1016/j.ejor.2005.02.046zbMath1116.90074OpenAlexW1998208600MaRDI QIDQ858329

Renato F. Werneck, Mauricio G. C. Resende

Publication date: 9 January 2007

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.02.046

zbMATH Keywords

GRASPlocal search\(p\)-median problemfacility locationheuristicpath-relinking

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

Some heuristic methods for solving \(p\)-median problems with a coverage constraint, An exact method for the discrete \((r|p)\)-centroid problem, 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, On a class of subadditive duals for the uncapacitated facility location problem, Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem, Semi-Lagrangian relaxation applied to the uncapacitated facility location problem, Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands, An exact cooperative method for the uncapacitated facility location problem, An application of a Lagrangian-type relaxation for the uncapacitated facility location problem, 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, Parallel and distributed local search in COMET, Metaheuristic applications on discrete facility location problems: a survey

Uses Software

• OR-Library
• Scatter Search
• MersenneTwister

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple tabu search for warehouse location
• A Lagrangean dual ascent algorithm for simple plant location problems
• A projection method for the uncapacitated facility location problem
• A method for solving to optimality uncapacitated location problems
• On the exact solution of large-scale simple plant location problems
• Neighborhood search heuristics for the uncapacitated facility location problem
• Near-optimal solutions to large-scale facility location problems
• Lagrangean heuristics for location problems
• A hybrid heuristic for the \(p\)-median problem
• A fast swap-based local search procedure for location problems
• Solving the uncapacitated facility location problem using tabu search
• Solving the simple plant location problem by genetic algorithm
• Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
• A new greedy approach for facility location problems
• Probabilistic Analysis of a Relaxation for the k-Median Problem
• A Dual-Based Procedure for Uncapacitated Facility Location
• Mersenne twister
• Greedy Strikes Back: Improved Facility Location Algorithms
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization