Solving multiple facilities location problems with separated clusters

DOI10.1016/J.ORL.2019.07.007MaRDI QIDQ2294344zbMATH OpenOpenAlexWikidataFDO

Authors Zvi Drezner, Jack Brimberg

Publication date 10 February 2020

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2019.07.007

zbMATH Keywords

heuristicsclustersdynamic programming\(p\)-center\(p\)-median

Mathematics Subject Classification ID

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

Recommendations

• Heuristic cluster algorithm for multiple facility location-allocation problem
• A heuristic method for large-scale multi-facility location problems
• Note—Multi-Activity Facility Design and Location Problems
• Heuristic methods for large centroid clustering problems
• scientific article; zbMATH DE number 4128638

Cites work

• scientific article; zbMATH DE number 5501651 (Why is no real title available?)
• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An efficient genetic algorithm for the \(p\)-median problem
• Exact and approximate solutions to the multisource weber problem
• Heuristic Methods for Location-Allocation Problems
• Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
• Location Theory, Dominance, and Convexity
• Location-Allocation Problems
• New local searches for solving the multi-source Weber problem
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
• Note—One-Dimensional Facility Location-Allocation using Dynamic Programming
• Solving a class of two-dimensional uncapacitated location-allocation problems by dynamic programming
• The \(p\)-median problem: a survey of metaheuristic approaches
• The gravity p-median model
• The multiple markets competitive location problem
• The p-Centre Problem-Heuristic and Optimal Algorithms

Cited in

(4)

• Competitive location models: a review
• The Weber problem with demand uniformly generated in discs
• Heuristic cluster algorithm for multiple facility location-allocation problem
• A trajectory based heuristic for the planar \(p\)-median problem

Describes a project that uses

Uses Software

• MENU-OKF
• MOD-DIST
• SITATION

This page was built for publication: Solving multiple facilities location problems with separated clusters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294344)