نتایج جستجو برای: covering location allocation problem
تعداد نتایج: 1187700 فیلتر نتایج به سال:
Hub location problem is one of the new issues in location problems. This kind of location problem is widely used in many transportation and telecommunication networks. Hubs are facilities that serve as transshipment and switching point to consolidate flows at certain locations for transportation,airline and postal systems so they are vital elements of such these networks. The location and numb...
hub covering location problem, network design, single machine scheduling, genetic algorithm, shuffled frog leaping algorithm hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...
• A location-allocation problem under uncertainty is investigated. two-stage stochastic programming model proposed. The mode solved by sample average approximation. Emergencies, especially those considered routine (i.e., occurring on a daily basis), pose great threats to health, life, and property. Immediate response treatment can greatly mitigate these threats. This research conducted optimize...
in this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. we also consider flexibility on distance standard for covering demand nodes by the servers. we use the satisfaction degree to represent the constraint of service capacity. the proposed model belongs to the class of mixed integer programming models. our model can be redu...
A fuzzy queuing coherent hierarchical location-allocation model is developed for congested systems. The parameters of the model are approximately evaluated and stated as fuzzy-numbers. The coverage of demand nodes is also considered in an approximate manner and is stated by the degree of membership. Using the queuing theory and fuzzy conditions, a coherent hierarchical model is developed for th...
This paper presents a hybrid algorithm that combines a metaheuristic and an exact method to solve the Probabilistic Maximal Covering Location-Allocation Problem. A linear programming formulation for the problem presents variables that can be partitioned into location and allocation decisions. This model is solved to optimality for small and medium-size instances. To tackle larger instances, a f...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید