نتایج جستجو برای: covering location allocation problem
تعداد نتایج: 1187700 فیلتر نتایج به سال:
Abstract In this article, we present the process and results of using quantum computing (QC) to solve maximal covering location problem proposed by Church ReVelle. With contribution, seek lay foundations for other urban regional scientists begin consider technologies. We obtained promising results, but it is clear that there a need more capable devices with qubits less susceptibility electronic...
Facility location-allocation models are used in a widespread variety of applications to determine the number of required facility along with the relevant allocation process. In this paper, a new mathematical model for the capacitated multi-facility location-allocation problem with probabilistic customer's locations and fuzzy customer’s demands under the Hurwicz criterion is proposed. Thi...
the paper discusses the location-allocation model for logistic networks and distribution centers through considering uncertain parameters. in real-world cases, demands and transshipment costs change over the period of the time. this may lead to large cost deviation in total cost. scenario based robust optimization approaches are proposed where occurrence probability of each scenario is not know...
There exist various service systems that have hierarchical structure. In hierarchical service networks, facilities at different levels provide different types of services. For example, in health care systems, general centers provide low-level services such as primary health care services, while the specialized hospitals provide high-level services. Because of demand congestion in service networ...
Hub location-allocation problems are currently a subject of keen interest in the research community. However, when this issue is considered in practice, significant difficulties such as traffic, commodity transportation and telecommunication tend to be overlooked. In this paper, a novel robust mathematical model for a p-hub covering problem, which tackles the intrinsic uncertainty of some param...
this paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. by this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. this is resulted from dividing area into discrete and continuous dimensions. also defining decision var...
in this study, a hierarchical hub location problem by considering different modes of transportation and maximum allowed delay is investigated. this study is done on iran’s express postal service with 2 days maximum delay in delivery considering ground and airport hubs. the problem is of the type of location and single allocation for collection, transfer and distribution of the shipments. all th...
recently the concept of facility efficiency, which defined by data envelopment analysis (dea), introduced as a location modeling objective, that provides facilities location’s effect on their performance in serving demands. by combining the dea models with the location problem, two types of “efficiencies” are optimized: spatial efficiency which measured by finding the least cost location and al...
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 ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید