نتایج جستجو برای: hub covering problem
تعداد نتایج: 938083 فیلتر نتایج به سال:
The use of graph databases for social networks, images, web links, pathways and so on, has been increasing at a fast pace and promotes the need for efficient graph query processing on such databases. In this study, we discuss graph query processing – referred to as graph matching – and an inherent optimization problem known as the minimum hub cover problem. This optimization problem is introduc...
the existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...
Energy hub is a concept relates various energy carriers which has been expanded in recent years. Operation of energy hub is often attended with uncertainties. Therefore, this paper presents a linear model based on information gap decision theory (IGDT) to solve the energy hub problem. This approach can consider plenty of uncertainties, simultaneously. Energy hub under study includes a combined ...
Reliable hub-and-spoke network design problems under uncertainty through multi-objective programming
HLP (hub location problem) tries to find locations of hub facilities and assignment of nodes to extended facilities. Hubs are facilities to collect, arrange, and distribute commodities in telecommunication networks, cargo delivery systems, etc. Hubs are very crucial and their inaccessibility impresses on network whole levels. In this paper, first, total reliability of the network is defined bas...
One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...
Hubs are centers for collection, rearrangement, and redistribution of commodities in transportation networks. In this paper, non-linear multi-objective formulations for single and multiple allocation hub maximal covering problems as well as the linearized versions are proposed. The formulations substantially mitigate complexity of the existing models due to the fewer number of constraints and v...
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 ...
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...
In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید