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

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

S. Avakh Darestani, Z. Rajabi,

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

Eydi, Alireza , Mirakhorli, Abas ,

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

Journal: :Mathematical and Computer Modelling 2013

Journal: :international journal of industrial engineering and productional research- 0
a. ghodratnama tehran, iran r. tavakkoli-moghaddam tehran, iran a. ghodratnama baboli vahdani lyon, france b. vahdani tehran, iran

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

Journal: :international journal of industrial engineering and productional research- 0
m. mohammadi master student in department of industrial engineering, college of engineering, university of tehran, iran r. tavakkoli-moghaddam professor in department of industrial engineering, college of engineering, university of tehran, iran. a. ghodratnama ph.d. student in department of industrial engineering, college of engineering, university of tehran, iran. h. rostami student in department of industrial engineering, college of engineering, university of tabriz, iran

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

P-hub maximal covering location problem is one of the most commonly used location- allocation problems. In this problem, the goal is to determine the best location for the hubs such that the covered demand is maximized by considering the predefined coverage radius. In classical hub problems, if the distance between the origin and destination is less than this radius, coverage is possible; other...

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

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