نتایج جستجو برای: p median hub
تعداد نتایج: 1366070 فیلتر نتایج به سال:
This paper advocates the use of the bionomic algorithm, a recently proposed metaheuristic technique, as an effective method to solve capacitated p-median problems (CPMP). Bionomic algorithms already proved to be an effective framework for finding good solutions to combinatorial optimization problems, when good local optimization algorithms are available. The paper also presents an effective loc...
In this paper three recurrent neural network algorithms are proposed for the p-median problem according to different techniques. The competitive recurrent neural network, based on two types of decision variables (location variables and allocation variables), consists of a single layer of 2Np process units (neurons), where N is the number of demand points or customers and p is the number of faci...
Given an edge-weighted graph G = (V, E), the Hamiltonian p-median problem (HpMP) asks for determining p cycles in G whose total length is minimized such that each node is contained in exactly one cycle. As the travelling salesman problem (TSP) corresponds to the choice p = 1, the HpMP can be interpreted as a generalization of the TSP. In this paper, we study the polytope associated with the HpM...
Capacitated p-median problem (CPMP) is an important variation of facility location problem in which p capacitated medians are economically selected to serve a set of demand vertices so that the total assigned demand to each of the candidate medians must not exceed its capacity. The classical CPMP uses a network in a Euclidean plane such that distance between any two points in the network is the...
Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the pl...
چکیده شبکه های هاب یکی از انواع مهم شبکه های حمل ونقل هستند که در زمینه های مختلفی مانند حمل ونقل هوایی، پست و مخابرات کاربرد دارند. از ویژگی های مهم این شبکه ها، امکان وقوع اختلال در عملکرد آن ها به دلایلی ازقبیل ازکار افتادن تسهیل های هاب یا عدم دسترسی به یال های ارتباطی است. در این مطالعه، مسئله مکان یابی یال هاب پوششی با تخصیص چندگانه، تحت شرایط اختلال یال های هاب بررسی می شود. برای ای...
Facility-location problems have several applications in telecommunications, industrial transportation and distribution, etc. One of the most well-known facility-location problems is the p-median problem. This work addresses an application of the capacitated p-median problem to a real-world problem. We propose a genetic algorithm (GA) to solve the capacitated pmedian problem. The proposed GA use...
We further study the effect of odd cycle inequalities in the description of the polytopes associated with the p-median and uncapacitated facility location problems. We show that the obvious integer linear programming formulation together with the odd cycle inequalities completely describe these polytopes for the class of restricted Y-graphs. This extends our results for the class of Y-free grap...
The Obnoxious p-Median problem consists in selecting a subset of p facilities from a given set of possible locations, in such a way that the sum of the distances between each customer and its nearest facility is maximized. The problem is NP-hard and can be formulated as an integer linear program. It was introduced in the 1990s, and a branch and cut method coupled with a tabu search has been rec...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید