Stochastic single allocation hub location problems with balanced utilization of hub capacities

In this paper the problems of locating urban logistic terminals are studied as hub location problems that due to a large number of potential nodes in big cities belong to hard non-polynomial problems, the so-called NP-problems. The hub location problems have found wide application in physical planning of transport and telecommunication systems, especially systems of fast delivery, networks of logistic and distribution centres and cargo traffic terminals of the big cities, etc. The paper defines single and multiple allocations and studies the numerical examples. The capacitated single allocation hub location problems have been studied, with the provision of a mathematical model of selecting the location for the hubs on the network. The paper also presents the differences in the possibilities of implementing the exact and heuristic methods to solve the actual location problems of big dimensions i.e. hub problems of the big cities.

Download Full-text

Dynamic Hub Location Problems with Single Allocation and Multiple Capacity Levels

2014 47th Hawaii International Conference on System Sciences ◽

10.1109/hicss.2014.131 ◽

2014 ◽

Cited By ~ 3

Author(s):

Astrid M. C. Horhammer

Keyword(s):

Location Problems ◽

Hub Location ◽

Single Allocation

Download Full-text

Single-allocation ordered median hub location problems

Computers & Operations Research ◽

10.1016/j.cor.2010.07.018 ◽

2011 ◽

Vol 38 (2) ◽

pp. 559-570 ◽

Cited By ~ 32

Author(s):

J. Puerto ◽

A.B. Ramos ◽

A.M. Rodríguez-Chía

Keyword(s):

Location Problems ◽

Hub Location ◽

Ordered Median ◽

Single Allocation

Download Full-text

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

Journal of Advanced Transportation ◽

10.1155/2017/9387302 ◽

2017 ◽

Vol 2017 ◽

pp. 1-23 ◽

Cited By ~ 13

Author(s):

Xiaoqian Sun ◽

Weibin Dai ◽

Yu Zhang ◽

Sebastian Wandelt

Keyword(s):

Genetic Algorithms ◽

Empirical Study ◽

Low Complexity ◽

Location Problems ◽

Hub Location ◽

Allocation Problems ◽

Solution Methods ◽

Problem Formulations ◽

Single Allocation ◽

Solution Techniques

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.

Download Full-text