New formulations for the uncapacitated multiple allocation hub location problem

Marı́n, Alfredo; Cánovas, Lázaro; Landete, Mercedes

doi:10.1016/j.ejor.2004.09.047

Cited by 90 publications

(50 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…He solved the problem by a relax-and-cut algorithm. Marín et al (2006) presented a new formulation which is a generalization of the earlier formulations and relaxes the assumption of having a cost structure satisfying triangle inequality. By using some polyhedral results they were able to tighten and reduce the number of constraints.…”

Section: The Hub Location Problem With Fixed Costsmentioning

confidence: 99%

Network hub location problems: The state of the art

Alumur

Kara

2008

European Journal of Operational Research

749

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: The Hub Location Problem With Fixed Costsmentioning

confidence: 99%

Network hub location problems: The state of the art

Alumur

Kara

2008

European Journal of Operational Research

749

338

View full text Add to dashboard Cite

show abstract

“…Let be the variable that is used to indicate whether node is a hub, and the route variable is still used. The formulation for the CMA problem is shown as follows [45,60].…”

Section: Classical Multiple Allocation Problemmentioning

confidence: 99%

“…An enhanced Benders decomposition (EBD) algorithm was used to solve multiple allocation uncapacitated hub location problem for large-scale networks by [29]. The algorithm was evaluated in computational experiments on different instances with up to 500 nodes, compared with Benders decomposition [43], adjustment procedure [44], relax-and-cut algorithm (RCA) [45], and CPLEX. Reference [46] proposed two formulations for capacitated ordered median hub location problems.…”

Section: Introductionmentioning

confidence: 99%

Finding p-Hub Median Locations: An Empirical Study on Problems and Solution Techniques

Sun

Dai

Zhang

et al. 2017

Journal of Advanced Transportation

View full text Add to dashboard Cite

Hub location problems have been studied by many researchers for almost 30 years, and, accordingly, various solution methods have been proposed. In this paper, we implement and evaluate several widely used methods for solving five standard hub location problems. To assess the scalability and solution qualities of these methods, three well-known datasets are used as case studies: Turkish Postal System, Australia Post, and Civil Aeronautics Board. Classical problems in small networks can be solved efficiently using CPLEX because of their low complexity. Genetic algorithms perform well for solving three types of single allocation problems, since the problem formulations can be neatly encoded with chromosomes of reasonable size. Lagrangian relaxation is the only technique that solves reliable multiple allocation problems in large networks. We believe that our work helps other researchers to get an overview on the best solution techniques for the problems investigated in our study and also stipulates further interest on cross-comparing solution techniques for more expressive problem formulations.

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

New formulations for the uncapacitated multiple allocation hub location problem

Cited by 90 publications

References 13 publications

Network hub location problems: The state of the art

Network hub location problems: The state of the art

Finding p-Hub Median Locations: An Empirical Study on Problems and Solution Techniques

Release Time Scheduling and Hub Location for Next-Day Delivery

Contact Info

Product

Resources

About