%0 Journal Article
%T Algorithms for Location Problems Based on Angular Distances
%A Lev A. Kazakovtsev
%A Predrag S. Stanimirovi£¿
%A Idowu A. Osinuga
%A Mikhail N. Gudyma
%A Alexander N. Antamoshkin
%J Advances in Operations Research
%D 2014
%I Hindawi Publishing Corporation
%R 10.1155/2014/701267
%X 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. 1. Introduction Generally, the purpose of a location problem is to determine locations of one or several new facilities on a plane or in a space where some objects (facilities) have been already placed [1]. Usually, the number of possible arrangements for new facilities is infinite [2]. Location problems occur frequently in real life. Some of them include the distribution systems such as locating warehouses within supply chain to minimize average transportation time to market, locating hazardous material so as to minimize its exposure to the public, determining bank account and lockboxes location to maximize clearing time or float, and problems of locating a computer, telecommunication equipment, and wireless base stations [3]. Many of such practical problems of this kind involve emergency facilities such as hospitals, fire stations, accident rescue, or civil defense. The usual objective here is to minimize the maximum among weighted distances between facilities to be located and all demand points. Details of other useful applications can be found in [4, 5]. Similar problems are formulated in approximation theory, problems of estimation in statistics [6], signal and image processing, and so forth [7¨C9]. Distance is the length of the shortest path between two points. However, the path depends on properties of space and a way of movement in it. In continuous spaces, the most commonly used metrics are rectangular or Manhattan (), Euclidean (), and Tchebychev (). Indeed, many results have been generalized for -dimensional space; however, practical applications usually occur within the context of two-dimensional and three-dimensional spaces. Therefore, in the subsequent sections, DPF is used for modeling distances in 2-dimensional space (unless it is otherwise stated). The Euclidean distance between two points does not reflect the cost of moving between them in the systems which use rotating mechanisms (telescopic boom, etc.) as transportation means. These systems include automated lifting cranes and manipulators. This kind of problems lies behind many important applications. Unfortunately, there exist only a few
%U http://www.hindawi.com/journals/aor/2014/701267/