نتایج جستجو برای: covering location allocation problem
تعداد نتایج: 1187700 فیلتر نتایج به سال:
This article presents a column generation algorithm to calculate new improved lower bounds to the solution of maximal covering location problems formulated as a p-median problem. This reformulation leads to instances that are difficult for column generation methods. The traditional column generation method is compared with the new approach, where the reduced cost criterion used at the column se...
http://dx.doi.org/10.1016/j.tre.2014.01.01
Province X in Indonesia has a significant problem with trash that been challenging to address. The Environment Agency therefore desires construct an inorganic Trash Management System. four potential locations various capacities. purpose of this research is locate treatment system's best possible site and allocate each TPS less than 30 km more over from the chosen system, respectively, ensure ov...
goal programming approach to the bi-objective competitive flow-capturing location-allocation problem
majority of models in location literature are based on assumptions such as point demand, absence of competitors, as well as monopoly in location, products, and services. however in real-world applications, these assumptions are not well-matched with reality. in this study, a new mixed integer nonlinear programming model based on weighted goal programming approach is proposed to maximize the cap...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید