نتایج جستجو برای: facility location selection problem

تعداد نتایج: 1404069  

2005
Robert Benkoczi Binay K. Bhattacharya Sandip Das Jeff Sember

In this paper we consider an extension of the classical facility location problem where besides n customers, a set of p collection depots are also given. In this setting the service of a customer consists of the travel of a server to the customer and return back to the center via a collection depot. We have analyzed the problem and showed that the collection depots problem can be transformed to...

2006
Peng Zhang

The k-facility location problem is a common generalization of the facility location and the k-median problems. For the metric uncapacitated k-facility location problem, we propose a polynomial-time 2 + √ 3 + ǫ-approximation algorithm using the local search approach, which significantly improves the previously known approximation ratio 4, given by Jain et al. using the greedy method (J. ACM 50 (...

Location theory is one of the most important topics in optimization and operations research. In location problems, the goal is to find the location of one or more facilities in a way such that some criteria such as transportation costs, customer traveling distance, total service time, and cost of servicing are optimized. In this paper, we investigate the goal Weber location problem in which the...

2015
Golam Kabir

Evaluation and selection of a concrete production facility location is an important strategic decision making problems for both the public and private sector. The multi-dimensional, multi-criteria nature of the concrete production facility location problem limits the usefulness of any particular single objective model. In this study, social, economical, technological, environmental, and transpo...

2008
Chandrashekhar Nagarajan David P. Williamson

We study the problem of leasing facilities over time, following the general infrastructure leasing problem framework introduced by Anthony and Gupta [1]. If there are K different lease types, Anthony and Gupta give an O(K)-approximation algorithm for the problem. We are able to improve this to a 3-approximation algorithm by using a variant of the primal-dual facility location algorithm of Jain ...

Journal: :IEEJ Transactions on Electronics, Information and Systems 2008

Journal: :Electronic Notes in Discrete Mathematics 2012

Journal: :Uluslararası Muhendislik Arastirma ve Gelistirme Dergisi 2020

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید