نتایج جستجو برای: capacitated hub covering
تعداد نتایج: 68467 فیلتر نتایج به سال:
In this study, buffalo spermatozoa were in-vitro capacitated and acrosome reacted using modified Tyrode’s bicarbonatebuffered medium (sp-TALP media). Lipids were extracted from freshly ejaculated, in-vitro capacitated and acrosome reacted buffalo spermatozoa. The total lipid content of freshly ejaculated spermatozoa (171.5±2.90 μg/108 cells), capacitated spermatozoa (128.2±3.29 μg/108 cells) an...
This paper seeks to evaluate the performance of genetic algorithms (GA) as an alternative procedure for generating optimal or near-optimal solutions for location problems. The specific problems considered are the uncapacitated and capacitated fixed charge problems, the maximum covering problem, and competitive location models. We compare the performance of the GA-based heuristics developed agai...
In the event of a catastrophic bio-terror attack, major urban centers need to efficiently distribute large amounts of medicine to the population. In this paper, we consider a facility location problem to determine the points in a large city where medicine should be handed out to the population. We consider locating capacitated facilities in order to maximize coverage, taking into account a dist...
This article concerns the location of satellite distribution centers (SDCs) to supply humanitarian aid to the affected people throughout a disaster area. In such situations, it is not possible for the relief teams to visit every single home. Instead, the people are required to go to a satellite distribution center in order to obtain survival goods, provided that these centers are not too far fr...
The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, considering distances and capacities for the service to be given by each median. In this paper we present a column generation approach to CPMP. The identified restricted master problem optimizes the covering of 1-median clusters satisfying the capacity constraints, and new columns are generated consider...
This paper investigates a capacitated planar location-allocation problem with facility fixed cost. A zonebased fixed cost which consists of production and installation costs is considered. A nonlinear and mixed integer formulation is first presented. A powerful three stage Cross Entropy meta-heuristic with novel density functions is proposed. In the first stage a covering location problem provi...
Centrale OO is a pioneering project aiming to deploy in Paris a fleet of 100 % electric taxis. The significant initial investment and the current restricted vehicle autonomy give a high relevancy to the charging terminal location task. This task can be seen as a variant of the well-known capacitated covering location problem (CCLP). A mixed integer programming model suiting the features of the ...
We are interested in the design of survivable capacitated rooted Steiner networks. Given a graph G = (V,E), capacity and cost functions on E, a root r, a subset T of V of terminals and an integer k, we search for a minimum cost subset E′ ⊂ E, covering T and r, such that the network induced by E′ is k-survivable: after the removal of any k edges, there still exists a feasible flow from r to T . ...
In this work, we present an algorithmic framework based on Benders decomposition for the Capacitated p-Cable Trench Problem with Covering. We show that our approach can be applied to most variants of the Cable Trench Problem (CTP) that have been considered in the literature. The proposed algorithm is augmented with a stabilization procedure to accelerate the convergence of the cut loop and with...
We performed a large-scale mapping observation toward the W33 complex and its surroundings, covering an area of $1.3^\circ \times 1.0^\circ$ , in $^{12}$CO (1-0), $^{13}$CO C$^{18}$O (1-0) lines from Purple Mountain Observatory (PMO). found new hub--filament system ranging 30 to 38.5 \kms located at complex. Three supercritical filaments are directly converging into central hub W33. Velocity gr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید