[PDF] Top 20 Modeling of the Capacitated Single Allocation Hub Location Problem with a Hierarchical Approch (TECHNICAL NOTE)

... median problem that took the variation in trans-shipment costs according to the number of trans-shipped containers into account ...optimal hub combinations used a shortest path based branch and ...the ... See full document

... solving hub location ...sub- problem solution which uses good Benders cuts in reasonable computing ...of hub traffic with varying service levels, as well as price equilibrium in competitive ... See full document

... uncapacitated single allocation p-hub median problem (US- ...in hub location problems because a tar- get for these problems is to respond to requests by demand ...uncapacitated ... See full document

... For further analysis of the results, we targeted the Turkish Network dataset, with the same assumptions as in Yaman [5]. It has been assumed that there are 81 potential cities in Turkey to establish hub nodes. Two ... See full document

... multi-modal single allocation capacitated p-hub covering problem, to solve realistically sized problems, we provide a tabu search-based heuristic ...the hub nodes under the ... See full document

... for capacitated single- allocation with precise cover radius in case n= 10 and ∝ = ...the problem. the problem is solved on a personal computer pentium 4 CPU ...the hub links is ... See full document

... a hierarchical hub median location problem with single allocation and fuzzy flows between nodes in three levels of ...a single objective, three-layered model in a discrete ... See full document

... arrival hub covering to the cargo delivery sector in ...considered hub covering problem over incomplete network allowing at most four hub stops on a route from any origin to destination, while ... See full document

... the hub location problem, entitled the hub covering ...The hub covering problem nds the location of a hub and allocates demand nodes to opening hub ... See full document

... In this paper, we have studied different conflicting objectives for the capacitated single-allocation hub location problem, in which the flow has been transported non-contiguous. ... See full document

... center problem. They proposed the first heuristic for the single allocation p-hub center problem as a means of generating location-allocation strategies in a reasonable ... See full document

... a hub. Eq. (7) together with constraint (14) enforces single allocation for each ...a location unless a hub is opened at that ... See full document

... un-capacitated hub location ...the location of hubs, and the assignment of spokes to the hubs but they did not consider stepwise functions in the ...similar hub location ... See full document

... in location-allocation problems, ranging from the single product multi location problem to uncapacitated facility location problem and capacitated facility ... See full document

... facility location takes on an even greater importance when applied to problems in determining healthcare ...(location problem) and calculating the allocation of resources to each service point ... See full document

... of location problems is two ...house location problems, or to the problems of different domains that are modeled in a manner similar to ...other problem, CPLP_L, we provide different relaxation and ... See full document

... solve location-allocation models based on Geographic Information ...design problem is a hard combinatorial optimization problem, the use of metaheuristics allows obtaining a solution in areas ... See full document

... a single facility and capacity expansion via a finite set of projects, each holding a certain ...a location and increases or decreases of the available capacity along ...same location, each specified ... See full document

... Generally, as before, the capability order of these algorithms can be the GA first, SA second, and PSO last, regarding the objective function measure. But when it comes to the computational time criteria, the SA ... See full document

... the hub for the first period is randomly generated from the interval ...the hub for the first period is randomly generated from the interval (200,300) and for following periods, it is obtained from the ... See full document