Algorithms for location problems based on angular distances

DOI10.1155/2014/701267MaRDI QIDQ471721zbMATH OpenOpenAlexWikidataFDO

Authors Lev A. Kazakovtsev, Mikhail N. Gudyma, Alexander N. Antamoshkin, Predrag S. Stanimirović, Idowu Ademola Osinuga

Publication date 17 November 2014

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://doi.org/10.1155/2014/701267

Mathematics Subject Classification ID

Continuous location (90B85)

Review text

Summary: This paper describes four mathematical models for the single-facility location problems based on four special distance metrics and algorithms for solving such problems. In this study, algorithms of solving Weber problems using four distance predicting functions (DPFs) are proposed in accordance with four strategies for manipulator control. A numerical example is presented in this proposal as an analytical proof of the optimality of their results.

Recommendations

• A fast algorithm for the rectilinear distance location problem
• Algorithms for location referencing
• A discretizing algorithm for location problems
• An efficient algorithm for the Euclidean \(r\)-centrum location problem
• scientific article; zbMATH DE number 3856820
• Approximation of solutions for location problems
• scientific article; zbMATH DE number 2243637
• Models, algorithms and applications for location problems
• An algorithm for generalized point location and its applications
• Some new algorithms for location problems on networks

Cites work

• A computation procedure for the exact solution of location-allocation problems with rectangular distances
• A SINGLE FACILITY MINISUM LOCATION PROBLEM UNDER THE A-DISTANCE
• A unified model for Weber problems with continuous and network distances
• Adaptation of the probability changing method for Weber problem with an arbitrary metric
• An Algorithm for the Single Facility Location Problem Using the Jaccard Metric
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Discrete location problem on arbitrary surface in R^3
• Effective algorithm for the weber problem with a rectangular metric
• Encyclopedia of Distances
• Extension of the Weiszfeld procedure to a single facility minisum location model with mixed \(\ell_{p}\) norms
• Finding the Jaccard median
• scientific article; zbMATH DE number 1253040 (Why is no real title available?)
• Inverse p-median problems with variable edge lengths
• Location science research: a review
• Mathematical Models of Road Travel Distances
• Noniterative solution of some Fermat-Weber location problems
• Single-facility Weber location problem based on the lift metric
• Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
• The existence and uniqueness of the minimum norm solution to certain linear and nonlinear problems
• The impact of distance on location problems
• The minisum location problem for the Jaccard metric
• The Plant Location Problem: New Models and Research Prospects
• The three-dimensional Fermat-Weber problem with Tchebychev distances
• Weber problems with mixed distances and regional demand

Cited in

(1)

• The Fermat-Weber location problem in single integrator dynamics using only local bearing angles

This page was built for publication: Algorithms for location problems based on angular distances

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