نتایج جستجو برای: uncapacitated single allocation p hub center problem
تعداد نتایج: 3038919 فیلتر نتایج به سال:
The problem of staff scheduling at a truck hub for loading and stripping of the trucks is an important and difficult problem to optimize the labor efficiency and cost. The trucks enter the hub at different hours a day, in different known time schedules and operating hours. In this paper, we propose a goal programming to maximize the labor efficiency via minimizing the allocation cost. The propo...
Abstract. We consider a single allocation hub-and-spoke network design problem which allocates each non-hub node to exactly one of given hub nodes so as to minimize the total transportation cost. This paper deals with a case in which the hubs are located in a cycle, which is called a cycle-star hub network design problem. The problem is essentially equivalent to a cycle-metric labeling problem....
This paper considers the discrete two-hub location problem. We need to choose two hubs from a set of nodes. The remaining nodes are to be connected to one of the two hubs which act as switching points for intemodal flows. A configuration which minimizes the total flow cost needs to be found. We show that the problem can be solved in polynomial dme when the hub locations are fixed. Since there a...
the problem of staff scheduling at a truck hub for loading and stripping of the trucks is an important and difficult problem to optimize the labor efficiency and cost. the trucks enter the hub at different hours a day, in different known time schedules and operating hours. in this paper, we propose a goal programming to maximize the labor efficiency via minimizing the allocation cost. the propo...
In this paper, we propose an extension of the uncapacitated hub location problem where potential positions hubs are not fixed in advance. Instead, they allowed to belong a region around initial discrete set nodes. We give general framework which collection, transportation, and distribution costs based on norm-based distances hub-activation setup depend only that opened but also size placed. Two...
We present two heuristic methods for solving the Discrete Ordered Median Problem (DOMP), for which no such approaches have been developed so far. The DOMP generalizes classical discrete facility location problems, such as the p-median, p-center and Uncapacitated Facility Location problems. The first procedure proposed in this paper is based on a genetic algorithm developed by Moreno Vega [MV96]...
The hierarchical hub location problem is encountered three-level network that is applied in production-distribution system, education system, emergency medical services, telecommunication network, etc. This paper addresses the hierarchical hub covering problem with single assignment accounting for mandatory dispersion of central hubs restriction as a special case. This formulation with incorpor...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید