نتایج جستجو برای: objective hub covering problem
تعداد نتایج: 1435347 فیلتر نتایج به سال:
Hubs, or central trans-shipment facilities, allow the construction of a network where large numbers of direct connections can be replaced with fewer, indirect connections. Hub-andspoke configurations reduce and simplify network construction costs, centralize commodity handling and sorting, and allow carriers to take advantage of scale economies through consolidation of flows. Such networks have...
In this paper we study a hub location problem in which the hubs to be located must form a set of interconnecting lines. The objective is to minimize the total weighted travel time between all pairs of nodes while taking into account a budget constraint on the total set-up cost of the hub network. A mathematical programming formulation, a Benders-branch-and-cut algorithm and several heuristic al...
Transportation costs are a significant part of capital and operating costs of large open pit mines. Cost efficiency and high reliability of in pit crushing and conveying systems compared to conventional truck-shovel system makes it more appealing to be utilized in modern mining activities. In this paper the suitable location of an in pit crusher is investigated as a single hub location problem....
In this paper, we present an effective solution using the genetic algorithm for the uncapacitated single allocation hub location problem (USAHLP). This solution was published before, but today it still gives the really effective results, although there are many studies have been done after it. We also make an application using this method and present the performance results of this method.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید