The hub location and routing problem

Aykin, Turgut

doi:10.1016/0377-2217(93)e0173-u

Cited by 115 publications

(46 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…One of the first papers on a transportation system in which both direct shipping and shipping via one or more hubs is allowed, was written by Aykin (1995). The problem consisted of determining the best hub locations and the best delivery modes for clients.…”

Section: Routing With a Consolidation Hubmentioning

confidence: 99%

Factory gate pricing: An analysis of the Dutch retail distribution

Blanc

Cruijssen

Fleuren

et al. 2006

European Journal of Operational Research

View full text Add to dashboard Cite

Factory Gate Pricing (FGP) is a relatively new phenomenon in retail distribution. Under FGP, products are no longer delivered at the retailer distribution center, but collected by the retailer at the factory gates of the suppliers. Owing to both the asymmetry in the distribution networks (the supplier sites greatly outnumber the retailer distribution centers) and the better inventory and transport coordination mechanisms, this is likely to result in high savings. A mathematical model was used to analyze the benefits of FGP for a case study in the Dutch retail sector. Extensive numerical results are presented to show the effect of the orchestration shift from supplier to retailer, the improved coordination mechanisms, and sector-wide cooperation.

show abstract

Section: Routing With a Consolidation Hubmentioning

confidence: 99%

Factory gate pricing: An analysis of the Dutch retail distribution

Blanc

Cruijssen

Fleuren

et al. 2006

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…LetX X be a feasible solution to HC. Since constraints (2), (3), and (4) are common to both HC and HCLin, it suffices to show thatX X is feasible to (6). Consider the constraint (6) associated with the quadruplet i; j; k; r. There are four cases to consider depending on the values ofX X ir andX X jk .…”

Section: Theorem 1 Any Feasible Solution To Hc Is a Feasible Solutionmentioning

confidence: 99%

“…The primary focus so far has been on the total cost criterion. [4][5][6][7][8][9][10] The first deviation from the total cost criterion seems to be due to O'Kelly and Miller, 11 where the focus is shifted from the total cost to the minimax criterion for p ¼ 1. The minimax criterion for general p is studied by Kara and Tansel, 12 and a new minimax model, called the latest arrival hub location problem, is formulated and analysed by Kara and Tansel.…”

Section: Introductionmentioning

confidence: 99%

The single-assignment hub covering problem: Models and linearizations

Kara

Tansel

2003

Journal of the Operational Research Society

106

View full text Add to dashboard Cite

We study the hub covering problem which, so far, has remained one of the unstudied hub location problems in the literature. We give a combinatorial and a new integer programming formulation of the hub covering problem that is different from earlier integer programming formulations. Both new and old formulations are nonlinear binary integer programs. We give three linearizations for the old model and one linearization for the new one and test their computational performances based on 80 instances of the CAB data set. Computational results indicate that the linear version of the new model performs significantly better than the most successful linearization of the old model both in terms of average and maximum CPU times as well as in core storage requirements.

show abstract

“…Planar hub location problems, in which demand is concentrated at discrete points and hubs can be located anywhere on the plane, and network hub location problems, in which both demand and hubs are located at discrete points on a plane. Planar problems have been studied by O'Kelly, 1986a;Aykin, 1988;Aykin, 1995. In the case of airline networks, these models are not realistic, because they would result in airports being built anywhere. Consequently, we will refer to the second type, that is, network problems.…”

Section: Hubsmentioning

confidence: 99%

Location models for airline hubs behaving as M/D/c queues

Marianov

Serra

2003

Computers & Operations Research

184

View full text Add to dashboard Cite

Models are presented for the optimal location of hubs in airline networks, that take into consideration the congestion effects. Hubs, which are the most congested airports, are modeled as M/D/c queuing systems, that is, Poisson arrivals, deterministic service time, and c servers. A formula is derived for the probability of a number of customers in the system, which is later used to propose a probabilistic constraint. This constraint limits the probability of b airplanes in queue, to be lesser than a value α. Due to the computational complexity of the formulation, The model is solved using a meta-heuristic based on tabu search. Computational experience is presented.

show abstract

The hub location and routing problem

Cited by 115 publications

References 16 publications

Factory gate pricing: An analysis of the Dutch retail distribution

Factory gate pricing: An analysis of the Dutch retail distribution

The single-assignment hub covering problem: Models and linearizations

Location models for airline hubs behaving as M/D/c queues

Contact Info

Product

Resources

About