The planar multifacility collection depots location problem

DOI10.1016/j.cor.2018.09.010zbMath1458.90427OpenAlexW2894264527WikidataQ129208959 ScholiaQ129208959MaRDI QIDQ1628125

Tammy Drezner, Zvi Drezner, Pawel Jan Kalczynski

Publication date: 3 December 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.09.010

zbMATH Keywords

facility locationcollection depotshub location

Mathematics Subject Classification ID

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

Related Items (2)

The obnoxious facilities planar \(p\)-median problem ⋮ Improved starting solutions for the planar p-median problem

Uses Software

• Mathematica
• SNOPT
• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New heuristic algorithms for solving the planar \(p\)-median problem
• A new heuristic for solving the \(p\)-median problem in the plane
• New local searches for solving the multi-source Weber problem
• Asymptotic behavior of the Weber location problem on the plane
• The transfer point location problem
• Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
• A quadratic integer program for the location of interacting hub facilities
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Integer programming formulations of discrete hub location problems
• Variable neighborhood search
• An efficient genetic algorithm for the \(p\)-median problem
• The Weber obnoxious facility location model: a big arc small arc approach
• Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
• Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
• A new local search for continuous location problems
• One-way and round-trip center location problems
• Generating good starting solutions for the p-median problem in the plane
• IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
• The facility and transfer points location problem
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• Location-Allocation Problems
• Two algorithms for constructing a Delaunay triangulation
• Variable neighborhood search for the p-median
• A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
• Heuristic Methods for Location-Allocation Problems
• The collection depots location problem on networks
• Minisum collection depots location problem with multiple facilities on a network
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• The fortified Weiszfeld algorithm for solving the Weber problem
• The multiple location of transfer points
• A Simplex Method for Function Minimization
• Exact and approximate solutions to the multisource weber problem
• On the collection depots location problem

This page was built for publication: The planar multifacility collection depots location problem