نتایج جستجو برای: hub covering problem
تعداد نتایج: 938083 فیلتر نتایج به سال:
The hub median problem is to locate hub facilities in a network and to allocate non-hub nodes to hub nodes such that the total transportation cost is minimized. In the hub center problem, the main objective is one of minimizing the maximum distance/cost between origin destination pairs. In this paper, we study uncapacitated hub center problems with either single or multiple allocation. Both pro...
We consider the hub location problem, where p hubs are chosen from a given set of nodes, each nonhub node is connected to exactly one hub and each hub is connected to a central hub. Links are installed on the arcs of the resulting network to route the traffic. The aim is to find the hub locations and the connections to minimize the link installation cost. We propose two formulations and a heuri...
This paper deals with a capacitated hub location problem arising in the design of telecommunications networks. The problem is different from the classical hub location problem in two ways: the cost of using an edge is not linear but stepwise and the capacity of a hub restricts the amount of traffic transiting through the hub rather than the incoming traffic. In this paper both an exact and a he...
In this paper we propose several heuristics for the Uncapacitated -Allocation -Hub Median Problem. In the classical -hub problem, given a set of nodes with pairwise traffic demands, we must select of them as hub locations and route all traffics through them at a minimum cost. We target here an extension, called the -allocation -hub median problem, recently proposed by Yaman (2011), in which eve...
We o er a formulation that locates hubs on a network in a competitive environment; that is, customer capture is sought, which happens whenever the location of a new hub results in a reduction of the current cost (time, distance) needed by the tra c that goes from the speci ed origin to the speci ed destination. The formulation presented here reduces the number of variables and constraints as co...
0377-2217/$ see front matter 2011 Elsevier B.V. A doi:10.1016/j.ejor.2011.01.014 ⇑ Tel.: +90 312 290 27 68; fax: +90 312 266 40 54. E-mail address: [email protected] In this paper, we study allocation strategies and their effects on total routing costs in hub networks. Given a set of nodes with pairwise traffic demands, the p-hub median problem is the problem of choosing p nodes as hub loca...
Maritime cabotage is a legislation published by a particular coastal country, which is used to conduct the cargo transportation between its two domestic ports. This paper proposes a two-phase mathematical programming model to formulate the liner hub-and-spoke shipping network design problem subject to the maritime cabotage legislations, i.e., the hub location and feeder allocation problem for p...
Given a graph ( , ) G N E , the Covering Salesman Problem (CSP) is to identify the minimum length tour “covering” all the nodes. More specifically, it seeks the minimum length tour visiting a subset of the nodes in N such that each node i not on the tour is within a predetermined distance di of a node on the tour. In this paper, we define and develop a generalized version of the CSP, and refe...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید