Research minimax and minisum Weber problems on a plane with forbidden zones

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On-line scheduling with forbidden zones

In various manufacturing and computing contexts there may be a certain period in each time interval, during which processing may continue but may not be initiated. We examine the problem of on-line scheduling in the presence of such forbidden zones, whose complements are starting time windows. We show that no on-line algorithm is better than 9 7 competitive, when minimizing the number of interv...

متن کامل

A Generalization of the Minisum and Minimax Voting Methods

In this paper, we propose a family of approval voting-schemes for electing committees based on the preferences of voters. In our schemes, we calculate the vector of distances of the possible committees from each of the ballots and, for a given p-norm, choose the one that minimizes the magnitude of the distance vector under that norm. The minisum and minimax methods suggested by previous authors...

متن کامل

A note on center problems with forbidden polyhedra

The problem of nding an optimal location X minimizing the maximum Euc-lidean distance to existing facilities is well solved by e.g.the Elzinga-Hearn algorithm. In practical situations X will however often not be feasible. We therefore suggest in this note a polynomial algorithm which will nd an optimal location X F in a feasible subset F IR 2 of the plane.

متن کامل

Minisum and Minimax Location Models for Helicopter Emergency Medical Service Systems

This paper presents minisum and minimax location problems for helicopter emergency medical service (HEMS) systems. Given demand points (origins) and hospitals (destinations), the locations of rendezvous points and helicopter stations are selected to minimize the total demand-weighted transport time (minisum objective) and the maximum transport time (minimax objective) to a hospital. Rendezvous ...

متن کامل

About Local Optimum of the Weber Problem on Line with Forbidden Gaps

The location problem of interconnected facilities on the line with forbidden gaps is considered. The located facilities are connected among themselves and with gaps. Location in forbidden gaps is not allowed. It is need to minimize the total cost of connections between facilities and between facilities and gaps. It is known that the initial continuous problem is reduced to series discrete subpr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics: Conference Series

سال: 2021

ISSN: 1742-6588,1742-6596

DOI: 10.1088/1742-6596/1901/1/012054