Star p-hub median problem with modular arc capacities

Yaman, Hande

doi:10.1016/j.cor.2007.01.014

Cited by 61 publications

(34 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Then all three levels of the network have star structures. Variants of this problem where the root node is given a priori are studied in the literature (see e.g., Labbé and Yaman, 2008;Yaman, 2008).…”

Section: A Nonlinear 0-1 Model For Sa-h-hmmentioning

confidence: 99%

The hierarchical hub median problem with single assignment

Yaman

2009

Transportation Research Part B: Methodological

Self Cite

110

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

Section: A Nonlinear 0-1 Model For Sa-h-hmmentioning

confidence: 99%

The hierarchical hub median problem with single assignment

Yaman

2009

Transportation Research Part B: Methodological

Self Cite

110

View full text Add to dashboard Cite

show abstract

“…Aykin (1994Aykin ( , 1995 have considered HLPs with capacity constraints on the incoming flow at the hubs as well as on direct O/D links. Carello et al (2004), Yaman and Carello (2005) and Yaman (2008) have studied capacitated HLPs with modular link capacities. They considered capacity constraints on the incoming and outgoing flow at hubs.…”

Section: Capacitated Modelsmentioning

confidence: 99%

“…Kim and Tcha (1992), Contreras et al (2009bContreras et al ( , 2010 and Martins de Sá et al (2013), study the design of tree-star hub networks in which the hubs are connected by means of a tree and the O/D nodes are assigned to exactly one hub. Labbé and Yaman (2008) and Yaman (2008) (2007) focus on the design of global three-layer hub networks in which two types of hub facilities are considered, international gateways and regional hubs. The backbone network associated with each hub-layer is assumed to be complete.…”

Section: Hub Network Topologiesmentioning

confidence: 99%

Hub Location Problems

Contreras

2015

Location Science

View full text Add to dashboard Cite

Hub Location Problems (HLPs) lie at the heart of network design planning in transportation and telecommunication systems. They are a challenging class of optimization problems that focus on the location of hub facilities and on the design of hub networks. This chapter overviews the key distinguishing features, assumptions and properties commonly considered in HLPs. We highlight the role location and network design decisions play in the formulation and solution of HLPs. We also provide a concise overview of the main developments and most recent trends in hub location research. We cover various topics such as hub network topologies, flow dependent discounted costs, capacitated models, uncertainty, dynamic and multi-modal models, and competition and collaboration. We also include a summary of the most successful integer programming formulations and efficient algorithms that have been recently developed for the solution of HLPs.

show abstract

“…The taxonomy of HLP suggests four ramifications of the original problems including Capacitated p-Median Problem Shamsipour et al (2012), HLP with star network structure Yaman (2008), Yaman & Elloumi (2012), p-hub center problem Campbell et al (2005a,b), and p-hub covering problem Kara & Tansel (2003). For a more detailed review of the literature one may refer to Alumur & Kara (2008), Farahani et al (2013).…”

Section: Literature Reviewmentioning

confidence: 99%

Hub location under uncertainty: a minimax regret model for the capacitated problem with multiple allocations

Kazemian

Aref

2017

IJSCIM

View full text Add to dashboard Cite

Abstract:In this paper the capacitated hub location problem is formulated by a minimax regret model, which takes into account uncertain setup cost and demand. We focus on hub location with multiple allocations as a strategic problem requiring one definite solution.Investigating how deterministic models may lead to sub-optimal solutions, we provide an efficient formulation method for the problem.A computational analysis is performed to investigate the impact of uncertainty on the location of hubs. The suggested model is also compared with an alternative method, seasonal optimization, in terms of efficiency and practicability. The results indicate the importance of incorporating stochasticity and variability of parameters in solving practical hub location problems. Applying our method to a case study derived from an industrial food production company, we solve a logistical problem involving seasonal demand and uncertainty. The solution yields a definite hub network configuration to be implemented throughout the planning horizon.

show abstract

Star p-hub median problem with modular arc capacities

Cited by 61 publications

References 27 publications

The hierarchical hub median problem with single assignment

The hierarchical hub median problem with single assignment

Hub Location Problems

Hub location under uncertainty: a minimax regret model for the capacitated problem with multiple allocations

Contact Info

Product

Resources

About