نتایج جستجو برای: hub location allocation
تعداد نتایج: 315391 فیلتر نتایج به سال:
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...
In contrast to p-hub problems with a summation objective (p-hub median), minmax hub problems (p-hub center) have not attained much attention in the literature. In this paper, we give a polyhedral analysis of the uncapacitated single allocation p-hub center problem (USApHCP). The analysis will be based on a radius formulation which currently yields the most efficient solution procedures. We show...
this paper proposes a new mathematical model for designing and planning postal parcels carriage and postal networks. the objective of postal network designing is to determine the location, size and connection between the postal stations in a city, province or country. in this paper, a kind of multiple locations-allocations hub problem with limited capacity in collecting, distributing and broadc...
This paper presents a new mathematical model, in which the location of hubs is fixed and their capacity is determined based on facilities and factories allocated to it. In order to feed the client's nodes, different types of vehicles of different capacities are considered, in which the clients are allocated to hubs, and types and numbers of vehicles are allocated to the factory's facilities. To...
In this paper, we present an effective solution using the genetic algorithm for the uncapacitated single allocation hub location problem (USAHLP). This solution was published before, but today it still gives the really effective results, although there are many studies have been done after it. We also make an application using this method and present the performance results of this method.
In this paper, we present a capacitated multiple allocation hub location problem, which arose from a network design problem in German wagonload traffic. We develop heuristic solution approaches based on local improvements. We solve the problem with the heuristics and CPLEX on test data sets provided by our partner Deutsche Bahn AG. The computational results are presented and compared.
Transport networks with hub structure organise the exchange of shipments between many sources and sinks. All sources and sinks are connected to a small number of hubs which serve as transhipment points, so that only few, strongly consolidated transport relations exist. While hubs and detours lead to additional costs, the savings from bundling shipments, i.e. economies of scale, usually outweigh...
Article history: Received 10 August 2012 Received in revised format 14 September 2012 Accepted September 27 2012 Available online 28 September 2012 The hub location problem involves a network of origins and destinations over which transportation takes place. There are many studies associated with finding the location of hub nodes and the allocation of demand nodes to these located hub nodes to ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید