نتایج جستجو برای: covering location allocation problem

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

A. Ghodratnama , H. Rostami , M. Mohammadi, R. Tavakkoli-Moghaddam,

    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....

Journal: :Math. Meth. of OR 2011
Xueping Li Zhaoxia Zhao Xiaoyan Zhu Tami Wyatt

With emergencies being, unfortunately, part of our lives, it is crucial to efficiently plan and allocate emergency response facilities that deliver effective and timely relief to people most in need. Emergency Medical Services (EMS) allocation problems deal with locating EMS facilities among potential sites to provide efficient and effective services over a wide area with spatially distributed ...

The hierarchical hub covering facility location problems are applied to distribution systems, transportation, waste disposal, treatment services, emergency services and remote communication. The problems attempt to determine the location of service providers' facilities at different levels and specify their linking directions in order to reduce costs and to establish an appropriate condition in...

Journal: :journal of optimization in industrial engineering 2011
esmaeil mehdizadeh mohammad reza tavarroth vahid hajipour

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. ...

Journal: :international journal of industrial engineering and productional research- 0
k. shahanaghi v.r. ghezavati

in this paper, we present the stochastic version of maximal covering location problem which optimizes both location and allocation decisions, concurrently. it’s assumed that traveling time between customers and distribution centers (dcs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to dc. in classical model...

2011
Mehrdad Mohammadi Reza Tavakkoli-Moghadam Hazhir Tolouei Maria Yousefi

The hub location problem appears in a variety of applications including airline systems, cargo delivery systems, and telecommunication network design. When we analyze an application separately, we observe that each area has its own characteristics. Hub location problems deal with finding the location of hub facilities and with the allocation of demand nodes to these located hub facilities. This...

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...

Journal: :Research in Computing Science 2016

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

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