نتایج جستجو برای: location allocation problem
تعداد نتایج: 1143696 فیلتر نتایج به سال:
The general facility location problem and its variants, including most location-allocation and P-median problems, are known to be NP-hard combinatorial optimization problems. Consequently , there is now a substantial body of literature on heuristic algorithms for a variety of location problems, among which can be found several versions of the well-known simulated annealing algorithm. This paper...
in this paper the conditional location problem is discussed. conditional location problems have a wide range of applications in location science. a new meta-heuristic algorithm for solving conditional p-median problems is proposed and results are compared to those of the previous studies. this algorithm produces much better results than the previous formulations.
مقدمه و هدف پژوهش: در این مقاله مسئله Location–Allocation چندهدفه در محیطGIS برای تعیین موقعیت و تخصیص ظرفیت بهینه به ایستگاههای آتش-نشانی منطقه 11 شهر تهران مورد نظر میباشد. اهداف این تحقیق شامل: 1- کمینه کردن فاصله بین ایستگاه آتشنشانی و تقاضاها 2- کمینه کردن زمان رسیدن به تقاضا از ایستگاههای آتشنشانی 3- بیشینه کردن پوشش ایستگاههای آتشنشانی میباشد. روش پژوهش: مسئله Location–Allocati...
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. This model...
The main objective of facilities location and service system design is covering of potential customers’ demand. Many location models are extended with the covering objective and considered constraints, details of problem and its different aspects. In this paper the maximal covering location-allocation model for congested system is extended in the competitive environment. In the proposed model, ...
Location problems have been the focus of considerable attention both in research and practice for many years. Numerous extensions have been described to broaden its appeal and enhance its applicability. This study proposes a spreadsheet approach for three well-known facility location problems, the p-median problem (PMP), capacitated p-median (CPMP), and maximal covering location problem (MCLP)....
of the Dissertation Combining Stack Location Allocation with Register Allocation
This paper addresses the berth allocation problem in a multi-user container terminal. There are two typical schemes for berth allocation: one in discrete locations and the other in continuous locations. The former has the advantage of easiness in scheduling but it has a weakness in that terminal usage is not fully efficient. The latter exhibits the complete opposite characteristics. In previous...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید