نتایج جستجو برای: Continuous covering location problem (CCLP)

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

Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...

mohammad Jabalameli Seyed Javad Hosseininezhad,

This paper presents a multiobjective continuous covering location problem in fuzzy environment. Because of uncertain covering radius, possibility of covering concept is introduced.Since, the uncertainty may cause risk of uncovering customers; the problemis formulated as a risk management model. The presented model is an extension of the discrete covering location models tocontinuous space. Two ...

Journal: :international journal of industrial engineering and productional research- 0
yahia zare mehrjerdi department of industrial engineering, yazd university yazd iran amir ebrahimi zade hassan hosseininasab department of industrial engineering, yazd university yazd iran

abstract one of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. change in problem parameters during the pl...

2012
Bernat Gacias Frédéric Meunier

Centrale OO is a pioneering project aiming to deploy in Paris a fleet of 100 % electric taxis. The significant initial investment and the current restricted vehicle autonomy give a high relevancy to the charging terminal location task. This task can be seen as a variant of the well-known capacitated covering location problem (CCLP). A mixed integer programming model suiting the features of the ...

Journal: :Computers & Operations Research 2016

Journal: :Papers in Regional Science 1996

Hamideh Nikzad Jafar Bagherinejad Mahdi Bashiri

Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...

Journal: :ژورنال بین المللی پژوهش عملیاتی 0
z. rajabi s. avakh darestani

the hierarchical hub location problem is encountered three-level network that is applied in production-distribution system, education system, emergency medical services, telecommunication network, etc. this paper addresses the hierarchical hub covering problem with single assignment accounting for mandatory dispersion of central hubs restriction as a special case. this formulation with incorpor...

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

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