A hybrid heuristic for the uncapacitated single allocation hub location problem

Chen, Jeng-Fung

doi:10.1016/j.omega.2005.05.004

Cited by 108 publications

(67 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…O'Kelly [33] and Campell [4] study a few formulas of fixed cost HLP. There also exist many literatures in search of effective solution algorithms for these problems, see [10], [7] and [5] for examples. We mention that [20] explore the polyhedral aspect of HLP and [21] develop a method of lifting facets from facility location problems(FLPs) to HLPs and derive a tighter formulation for MA fixed cost HLP.…”

Section: Literature Reviewmentioning

confidence: 99%

The reliable hub-and-spoke design problem: Models and algorithms

An¹,

Zhang²,

Zeng³

2015

Transportation Research Part B: Methodological

108

View full text Add to dashboard Cite

This paper presents a study on reliable single and multiple allocation hub-and-spoke network design problems where disruptions at hubs and the resulting hub unavailability can be mitigated by backup hubs and alternative routes. It builds nonlinear mixed integer programming models and presents linearized formulas. To solve those difficult problems, Lagrangian relaxation and Branch-and-Bound methods are developed to efficiently obtain optimal solutions. Numerical studies of proposed solution methods on practical instances are reported, along with a few insights of system design.Key words: reliable network design; hub-and-spoke; Lagrangian Relaxation; Branch-and- Bound Background and MotivationThe hub-and-spoke system has been widely employed in various industrial applications.It is a fully connected network with material/information flow between any two nodes being processed at a small number of critical nodes (i.e. hubs) and moved through interhub links. Compared with the one built with the point-to-point structure, it has a much smaller number of links. Also, because traffic flows are consolidated by hubs and interhub links, significantly less operating cost can be achieved because of economies of scale.Given such advantages, industry companies including airlines, logistics companies, and telecommunications firms extensively utilize the hub-and-spoke architecture to reduce the construction and operating costs.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

The reliable hub-and-spoke design problem: Models and algorithms

An¹,

Zhang²,

Zeng³

2015

Transportation Research Part B: Methodological

108

View full text Add to dashboard Cite

show abstract

“…O'Kelly (1992) introduces the hub location problem with fixed costs, which is first linearized by Campbell (1994). Hamacher et al (2004), Labbé and Yaman (2004), Labbé et al (2005), and Marin et al (2006) Canovas et al (2007), Cunha and Silva (2007), Chen (2007), and Silva and Cunha (2009). Kara and Tansel (2000) and Ernst et al (2009) give integer programming formulations for the p-hub center problem.…”

Section: Literature Reviewmentioning

confidence: 99%

Release Time Scheduling and Hub Location for Next-Day Delivery

Yaman

Karaşan

Kara

2012

Operations Research

View full text Add to dashboard Cite

Inspired by a real-life problem faced by one of the largest ground-based cargo companies of Turkey, the current study introduces a new facet to the hub location literature. The release time scheduling and hub location problem aims to select a specified number of hubs from a fixed set of demand centers, to allocate each demand center to a hub, and to decide on the release times of trucks from each demand center in such a way that the total amount of cargo guaranteed to be delivered to every potential destination by the next day is not below a threshold and the total routing cost is minimized. The paper introduces integer programming models to solve this problem in the special cases when the cargo uniformly arrives to each demand center during the day and the more realistic pattern of when the cargo arrivals exhibit a piecewise linear form. Several classes of valid inequalities are proposed to strengthen the formulations. Extensions with multiple service levels and discrete sets for release times are also discussed. Computational results show the computational viability of the models under realistic scenarios as well as the validity of the proposed problems in answering several interesting questions from the cargo sector's perspective.

show abstract

“…Both single (O'Kelly, 1992;Ernst and Krishnamoorthy, 1999;Labbé et al, 2005;Cunha and Silva, 2007;Chen, 2007) and multiple allocation versions (Campbell, 1994;Mayer and Wagner, 2002;Marin et al, 2006;Cánovas et al, 2007) have been well studied. The reader may refer to Campbell et al (2002) and Alumur and Kara (2008) for recent reviews on hub location problems.…”

Section: Introductionmentioning

confidence: 99%

A hub covering network design problem for cargo applications in Turkey

Alumur

Kara

2009

Journal of the Operational Research Society

View full text Add to dashboard Cite

Hub location problems involve locating hub facilities and allocating demand nodes to hubs in order to provide service between origin-destination pairs. In this study, we focus on cargo applications of the hub location problem. Through observations from the Turkish cargo sector, we propose a new mathematical model for the hub location problem that relaxes the complete hub network assumption. Our model minimizes the cost of establishing hubs and hub links, while designing a network that services each origin-destination pair within a time bound. We formulate a single-allocation hub covering model that permits visiting at most three hubs on a route. The model is then applied to the realistic instances of the Turkish network and to the Civil Aeronautics Board data set.

show abstract

A hybrid heuristic for the uncapacitated single allocation hub location problem

Cited by 108 publications

References 27 publications

The reliable hub-and-spoke design problem: Models and algorithms

The reliable hub-and-spoke design problem: Models and algorithms

Release Time Scheduling and Hub Location for Next-Day Delivery

A hub covering network design problem for cargo applications in Turkey

Contact Info

Product

Resources

About