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

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

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

Seyed-Hosseini , S.M., Heydari, R. , Heydari, T. ,

Bus network design is an important problem in public transportation. The main step to this design, is determining the number of required terminals and their locations. This is an especial type of facility location problem, a large scale combinatorial optimization problem that requires a long time to be solved. Branch & bound and simulated annealing methods have already been used for solving Urb...

Journal: :مدیریت صنعتی 0
فهیمه روحی کارشناس ارشد مهندسی صنایع، دانشکدة صنایع، دانشگاه علم وصنعت، تهران، ایران سید بابک ابراهیمی استادیار مهندسی صنایع، دانشکدة صنایع، دانشگاه صنعتی خواجه نصیرالدین طوسی، تهران، ایران حمید کتابیان کارشناس ارشد مهندسی صنایع، دانشکدة صنایع، دانشگاه صنعتی خواجه نصیرالدین طوسی، تهران، ایران

different decisions, including location decisions of companies which are operating in international dynamic environment are subject to significant uncertainty.so in this research an international facility location problem under uncertainty is considered and an integrated model for strategic and operational planning is presented. in strategic level countries are assessed according to internation...

Journal: :Electronic Notes in Discrete Mathematics 2010
Virginie Gabrel Cécile Murat Nabila Remli Mathieu Lacroix

In this paper, we are interested in the recourse problem of the 2-stage robust location transportation problem. We propose a solution process using a mixed-integer formulation with an appropriate tight bound.

E. Najafi H. Shams N. Ghasemi

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

Aleksejs Lozkins Mikhail Krasilnikov Vladimir Bure

The hub location–allocation problem under uncertainty is a real-world task arising in the areas such as public and freight transportation and telecommunication systems. In many applications, the demand is considered as inexact because of the forecasting inaccuracies or human’s unpredictability. This study addresses the robust uncapacitated multiple allocation hub location problem with a set of ...

Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده برق و الکترونیک 1390

there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...

Journal: :international journal of industrial engineering and productional research- 0
amin vahidi tehran, iran, tel: +989183161027 alireza aliahmadi tehran, iran, tel: +989183161027 mohammad reza hamidi tehran, iran, tel: +989183161027 ehsan jahani tehran, iran, tel: +989183161027

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

Location-Routing Problem (LRP) emerges as one of the hybrid optimization problems in distribution networks in which, total cost of the system would be reduced significantly by simultaneous optimization of locating a set of facilities among candidate locations and routing vehicles. In this paper, a mixed integer linear programming model is presented for a two-echelon location-routing problem wit...

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

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