APPROXIMATIVE SOLUTION FOR OPTIMAL STATION LOCATION PROBLEM
نویسندگان
چکیده
منابع مشابه
An approximative solution to the Zookeeper's Problem
Consider a simple polygon P containing disjoint convex polygons each of which shares an edge with P . The Zookeeper’s Problem then asks for the shortest route in P that visits all convex polygons without entering their interiors. Existing algorithms that solve this problem run in time super-linear in the size of P and the convex polygons. They also suffer from numerical problems. In this paper,...
متن کاملOn an approximative solution to the marginal problem
With the aid of the Maximum Entropy principle, a solution to the marginal problem is obtained in a form of parametric exponential (GibbsMarkov) distribution. The unknown parameters can be calculated by an optimization procedure that agrees with the maximum likelihood estimate but it is numerically hardly feasible for highly dimensional systems. A numerically easily feasible solution can be obta...
متن کاملTabu Search Heuristic for Competitive Base Station Location Problem
We consider the following location problem. New 5G networks are deployed by two competitive operators (called resp. O1 and O2), which we refer to as a leader and a follower due to their sequential entering the market. They compete to serve clients by installing and configuring base stations (BS). We assume that the leader had already made a decision and operating a 5G network. Follower arrives ...
متن کاملA taxonomy for emergency service station location problem
The emergency service station (ESS) location problem has been widely studied in the literature since 1970s. There has been a growing interest in the subject especially after 1990s. Various models with different objective functions and constraints have been proposed in the academic literature and efficient solution techniques have been developed to provide good solutions in reasonable times. How...
متن کاملError bounds for the approximative solution of restricted planar location problems
Facility location problems in the plane play an important role in mathematical programming. When looking for new locations in modeling real-world problems, we are often confronted with forbidden regions, that are not feasible for the placement of new locations. Furthermore these forbidden regions may have complicated shapes. It may be more useful or even necessary to use approximations of such ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Doboku Gakkai Ronbunshu
سال: 1986
ISSN: 0289-7806,1882-7187
DOI: 10.2208/jscej.1986.61