نتایج جستجو برای: uncapacitated single allocation p hub center problem
تعداد نتایج: 3038919 فیلتر نتایج به سال:
The optimal locating of facilities has large effects on economic benefits, providing satisfactory service and levels of customer satisfaction. One of the new topics discussed in location problems is hub location and hub facilities are subject to unpredictable disruptions. This paper proposes a nonlinear integer model for reliable single allocation hub location problem that considers backup hub,...
We here propose an efficient tabu search (TS) for solving the uncapacitated single allocation hub location problem. To decrease the computational time, in the proposed tabu search, some new tabu rules are considered. Also, to compute the changes in the objective function’s value in each move, some new results are given. The performance of the proposed tabu search is compared with a recently pro...
We study the computational aspects of the single-assignment p-hub center problem on the basis of a basic model and a new model. The new model's performance is substantially better in CPU time than dierent linearizations of the basic model. We also prove the NP-Hardness of the problem. Ó 2000 Elsevier Science B.V. All rights reserved.
in this paper we present the problem of designing a three level hub center network. in our network, the top level consists of a complete network where a direct link is between all central hubs. the second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. we model this problem in an incomplete net...
In this paper we present the problem of designing a three level hub center network. In our network, the top level consists of a complete network where a direct link is between all central hubs. The second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. We model this problem in an incomplete net...
The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure's parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In t...
Hub location problems are widely studied in the area of location theory, where they involve locating the hub facilities and designing the hub networks. In this paper, we present a new and robust solution based on a genetic search framework for the uncapacitated single allocation hub location problem (USAHLP). To present its e8ectiveness, we compare the solutions of our GA-based method with the ...
In this paper we consider a capacitated single allocation p-hub median problem with multiple capacity levels (CSApHMPMC) in which the decisions are to determine the location of p hubs and their capacity levels, the single allocation of non-hub nodes to hubs in the logistics network. This problem is formulated as an integer programming model with the objective of minimizing the sum of total tran...
We examine the feasibility polyhedron of the uncapacitated hub location problem (UHL) with multiple allocation, which has applications in the elds of air passenger and cargo transportation, telecommunication and postal delivery services. In particular we determine the dimension and derive some classes of facets for this polyhedron. We develop a general rule about lifting facets from the uncapac...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید