Hub network design with single and multiple allocation: A computational study

O’Kelly, Morton E.; Bryan, Deborah; Skorin-Kapov, Darko; Skorin-Kapov, Jadranka

doi:10.1016/s0966-8349(96)00015-0

Cited by 130 publications

(49 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This reduced formulation still finds integer solutions to the LP relaxation most of the time. An important aspect of O'Kelly et al (1996) is its discussion of the sensitivity of the solutions to the inter-hub discount factor a. Sohn and Park (1998) formulation presents a further reduction in the number of variables and constraints for the case when the unit flow cost is symmetric and proportional to the distance.…”

Section: ðSkorin-kapov Et Al:; 1996þ Minmentioning

confidence: 99%

Network hub location problems: The state of the art

Alumur

Kara

2008

European Journal of Operational Research

755

338

View full text Add to dashboard Cite

Hubs are special facilities that serve as switching, transshipment and sorting points in many-to-many distribution systems. The hub location problem is concerned with locating hub facilities and allocating demand nodes to hubs in order to route the traffic between origin-destination pairs. In this paper we classify and survey network hub location models. We also include some recent trends on hub location and provide a synthesis of the literature.

show abstract

Section: ðSkorin-kapov Et Al:; 1996þ Minmentioning

confidence: 99%

Network hub location problems: The state of the art

Alumur

Kara

2008

European Journal of Operational Research

755

338

View full text Add to dashboard Cite

show abstract

“…Campbell (1994) formulated this problem as a mixed integer linear programming problem. Refinements were further proposed by Campbell (1996), Skorin-Kapov and O'Kelly (1996) and O'Kelly et al (1996). This problem is hard to solve, opening the way to heuristics (see for instance O'Kelly (1987), Aykin (1990), Klincewicz (1991), Campbell (1996) and metaheuristics (Smith et al, 1996;Ernst et Krishnamoorthy, 1996;Klincewicz, 1992;Skorin-Kapov and Skorin-Kapov, 1994).…”

Section: The P-hub Location Problemmentioning

confidence: 99%

Optimal rail-road container terminal locations on the European network

Limbourg¹,

Jourquin²

2009

Transportation Research Part E: Logistics and Transportation Re

168

View full text Add to dashboard Cite

a b s t r a c tThe European transport policy has focused on sustainable transport solutions, among which intermodal transport is a key player. However, its efficiency is strongly dependent on the location of the container terminals. In this paper, a set of estimated potential locations is used as input for an iterative procedure based on the p-hub median problem that takes the variation in trans-shipment costs according to the number of trans-shipped containers into account. The final results are the optimal locations for European transfer terminals embedded in a hub-and-spoke network.

show abstract

“…Campbell (1994), Ebery (2001), Ernst and Krishnamoorthy (1996), O'Kelly et al (1996), Skorin-Kapov et al (1996), and Park (1997, 1998) present formulations for the problem. Various heuristic algorithms have been developed by AbdinnourHelm (2001), Campbell (1996), Ernst and Krishnamoorthy (1996), Klincewicz (1991Klincewicz ( , 1992, O'Kelly (1987), Pirkul and Schilling (1998), Skorin-Kapov and Skorin-Kapov (1994), and Smith et al (1996).…”

Section: Introductionmentioning

confidence: 99%

The hierarchical hub median problem with single assignment

Yaman

2009

Transportation Research Part B: Methodological

111

View full text Add to dashboard Cite

a b s t r a c tWe study the problem of designing a three level hub network where the top level consists of a complete network connecting the so-called central hubs and the second and third levels are unions of star networks connecting the remaining hubs to central hubs and the demand centers to hubs and central hubs, respectively. The problem is to decide on the locations of a predetermined number of hubs and central hubs and the connections in order to minimize the total routing cost in the resulting network. This problem includes the classical p-hub median problem as a special case. We also consider a version of this problem where service quality considerations are incorporated through delivery time restrictions. We propose mixed integer programming models for these two problems and report the outcomes of a computational study using the CAB data and the Turkey data.

show abstract

Hub network design with single and multiple allocation: A computational study

Cited by 130 publications

References 9 publications

Network hub location problems: The state of the art

Network hub location problems: The state of the art

Optimal rail-road container terminal locations on the European network

The hierarchical hub median problem with single assignment

Contact Info

Product

Resources

About