The single-assignment hub covering problem: Models and linearizations

Kara, Bahar Y.; Tansel, Barbaros Ç.

doi:10.1057/palgrave.jors.2601473

Cited by 106 publications

(50 citation statements)

References 14 publications

(17 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This result can also be derived from the NP-completeness proof in Kara and Tansel (2000). The following theorem is an immediate consequence of this result.…”

Section: Notation and Backgroundmentioning

confidence: 58%

Regenerator Location Problem and survivable extensions: A hub covering location perspective

Yıldız

Karaşan

2015

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

Survivable network design Branch and cut a b s t r a c tIn a telecommunications network the reach of an optical signal is the maximum distance it can traverse before its quality degrades. Regenerators are devices to extend the optical reach. The regenerator placement problem seeks to place the minimum number of regenerators in an optical network so as to facilitate the communication of a signal between any node pair. In this study, the Regenerator Location Problem is revisited from the hub location perspective directing our focus to applications arising in transportation settings. Two new dimensions involving the challenges of survivability are introduced to the problem. Under partial survivability, our designs hedge against failures in the regeneration equipment only, whereas under full survivability failures on any of the network nodes are accounted for by the utilization of extra regeneration equipment. All three variations of the problem are studied in a unifying framework involving the introduction of individual flow-based compact formulations as well as cut formulations and the implementation of branch and cut algorithms based on the cut formulations. Extensive computational experiments are conducted in order to evaluate the performance of the proposed solution methodologies and to gain insights from realistic instances.

show abstract

“…This result can also be derived from the NP-completeness proof in Kara and Tansel (2000). The following theorem is an immediate consequence of this result.…”

Section: Notation and Backgroundmentioning

confidence: 58%

Regenerator Location Problem and survivable extensions: A hub covering location perspective

Yıldız

Karaşan

2015

Transportation Research Part B: Methodological

View full text Add to dashboard Cite

show abstract

“…Pamuk and Sepil (2001) and Meyer et al (2009) propose heuristic algorithms, and Baumgartner (2003) derives valid inequalities and gives a branch-and-cut algorithm. For the hub covering problem, Kara and Tansel (2003) and Wagner (2008) provide integer programming formulations and computational studies. The interested reader is referred to Campbell et al (2002), Alumur and Kara (2008), and Kara and Taner (2011) for surveys.…”

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

“…For α we again used 0.8, 0.9, and 1. For the parameter β we used the values calculated for the CAB data set by Kara and Tansel [13]. The results are given in Table 4.…”

Section: Computational Analysismentioning

confidence: 99%

“…The author defines the p-hub center and hub covering problems and presents mathematical models. Later, Kara and Tansel [11,13] analyze the p-hub center and hub covering problems in more detail.…”

Section: Introductionmentioning

confidence: 99%

A hub covering model for cargo delivery systems

2006

View full text Add to dashboard Cite

The hub location problem appears in a variety of applications including airline systems, cargo delivery systems, and telecommunication network design. When we analyze the application areas separately, we observe that each area has its own characteristics. In this research we focus on cargo delivery systems. Our interviews with various cargo delivery firms operating in Turkey enabled us to determine the constraints, requirements, and criteria of the hub location problem specific to the cargo delivery sector. We present integer programming formulations and large-scale implementations of the models within Turkey. The results are compared with the current structure of a cargo delivery firm operating in Turkey.

show abstract

The single-assignment hub covering problem: Models and linearizations

Cited by 106 publications

References 14 publications

Regenerator Location Problem and survivable extensions: A hub covering location perspective

Regenerator Location Problem and survivable extensions: A hub covering location perspective

Release Time Scheduling and Hub Location for Next-Day Delivery

A hub covering model for cargo delivery systems

Contact Info

Product

Resources

About