A BSSS algorithm for the location problem with minimum square error

DOI10.1155/2009/212040MaRDI QIDQ606175zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jafar Fathali, Mehdi Zaferanieh, Ahmad Nezakati

Publication date 16 November 2010

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://eudml.org/doc/222971

Mathematics Subject Classification ID

Continuous location (90B85) Nonconvex programming, global optimization (90C26)

Review text

Summary: Let \(n\) weighted points be given in the plane \(R^{2}\). For each point a radius is given which is the expected ideal distance from this point to a new facility. We want to find the location of a new facility such that the sum of the weighted errors between the existing points and this new facility is minimized. This is in fact a nonconvex optimization problem. We show that the optimal solution lies in an extended rectangular hull of the existing points. Based on this finding then an efficient big square small square (BSSS) procedure is proposed.

Recommendations

• Efficient methods for goal square Weber location problem
• A BSSS algorithm for the single facility location problem in two regions with different norms
• GBSSS: The generalized big square small square method for planar single- facility location
• An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem
• The big cube small cube solution method for multidimensional facility location problems

Cites work

• A BSSS algorithm for the single facility location problem in two regions with different norms
• Constrained location of competitive facilities in the plane
• GBSSS: The generalized big square small square method for planar single- facility location
• scientific article; zbMATH DE number 44281 (Why is no real title available?)
• scientific article; zbMATH DE number 4123493 (Why is no real title available?)
• Locating a minisum circle in the plane
• On the circle closest to a set of points
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• The Minisum and Minimax Location Problems Revisited

Cited in

(5)

• GBSSS: The generalized big square small square method for planar single- facility location
• The bicriterion semi-obnoxious location (BSL) problem solved by an -approximation
• A BSSS algorithm for the single facility location problem in two regions with different norms
• Backup multifacility location problem with \(l_p\) norm
• Efficient methods for goal square Weber location problem

This page was built for publication: A BSSS algorithm for the location problem with minimum square error

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