Approximation algorithms for hub location problems

2018 ◽  
Author(s):  
Marcelo Pinheiro Leite Benedito
Keyword(s):  
Approximation Algorithms ◽  
Location Problems ◽  
Hub Location

Approximation algorithms for Median Hub Location Problems

2019 ◽  
Vol 38 (2) ◽  
pp. 375-401
Author(s):  
Marcelo P. L. Benedito ◽  
Lehilton L. C. Pedrosa
Keyword(s):  
Approximation Algorithms ◽  
Location Problems ◽  
Hub Location

An efficient and scalable approach to hub location problems based on contraction

2020 ◽  
pp. 106955
Author(s):  
Sebastian Wandelt ◽  
Weibin Dai ◽  
Jun Zhang ◽  
Qiuhong Zhao ◽  
Xiaoqian Sun
Keyword(s):  
Location Problems ◽  
Hub Location

scholarly journals Location of Urban Logistic Terminals as Hub Location Problem

1970 ◽  
Vol 24 (5) ◽  
pp. 433-440 ◽  
Author(s):  
Jasmina Pašagić Škrinjar ◽  
Kristijan Rogić ◽  
Ratko Stanković
Keyword(s):  
Location Problem ◽  
Location Problems ◽  
Heuristic Methods ◽  
Hub Location ◽  
Hub Location Problem ◽  
Telecommunication Systems ◽  
Big Cities ◽  
Np Problems ◽  
Delivery Networks ◽  
Single Allocation

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.

scholarly journals Multimodal Capacitated Hub Location Problems with Multi-Commodities: An Application in Freight Transport

2020 ◽  
Vol 2020 ◽  
pp. 1-9 ◽  
Author(s):  
Alan Osorio-Mora ◽  
Francisco Núñez-Cerda ◽  
Gustavo Gatica ◽  
Rodrigo Linfati
Keyword(s):  
Latin American ◽  
Location Problems ◽  
Transport Cost ◽  
Mixed Integer ◽  
Hub Location ◽  
Proposed Model ◽  
Multimodal Transport ◽  
Two Factors ◽  
Commercial Solver

Hub location problems (HLPs) support decision making on multimodal transport strategic planning. It is related to the location of hubs and the allocation of origin/destination (O/D) flow in a system. Classical formulations assume that these flows are predefined paths and direct delivery is not available. This applied research presents a mixed integer linear programming (MILP) model for a capacitated multimodal, multi-commodity HLP. Furthermore, an application on the export process in a Latin American country is detailed. The new proposed model, unlike the traditional HLP, allows direct shipment, and its O/D flows are part of the decision model. Situations with up to 100 nodes, six products, and two transport modes are used, working with initial and projected flows. All instances can be solved optimally using the commercial solver, Gurobi 7.5.0, in computational times less than a minute. Results indicate that only one hub is profitable for the case study, both for the initial and projected scenarios. The installation of a hub generates transport savings over 1% per year. Two factors affect the location decision: low concentration and distance between the hubs and destinations. Long distances involve an exhaustive use of trains instead of trucks, which leads to lower transport cost per unit.

The reliable design of a hierarchical multi-modes transportation hub location problems (HMMTHLP) under dynamic network disruption (DND)

2018 ◽  
Vol 122 ◽  
pp. 39-86 ◽  
Author(s):  
Sara Sadat Torkestani ◽  
Seyed Mohammad Seyedhosseini ◽  
Ahmad Makui ◽  
Kamran Shahanaghi
Keyword(s):  
Dynamic Network ◽  
Location Problems ◽  
Hub Location ◽  
Reliable Design ◽  
Network Disruption

Robust optimization approach to capacitated single and multiple allocation hub location problems

2014 ◽  
Vol 35 (1) ◽  
pp. 45-60 ◽  
Author(s):  
Fereidoon Habibzadeh Boukani ◽  
Babak Farhang Moghaddam ◽  
Mir Saman Pishvaee
Keyword(s):  
Robust Optimization ◽  
Location Problems ◽  
Optimization Approach ◽  
Hub Location ◽  
Multiple Allocation

Novel Reliable Uncapacitated P-Hub Location Problems Under Uncertainty

2018 ◽  
Vol 7 (4) ◽  
pp. 115-155
Author(s):  
Javad Nematian
Keyword(s):  
Possibility Theory ◽  
Telecommunication Networks ◽  
Location Problems ◽  
Benchmark Problems ◽  
Chance Constrained Programming ◽  
Hub Location ◽  
Fuzzy Variables ◽  
Cargo Delivery ◽  
Decision Variables ◽  
Constrained Programming

Hubs are facilities to collect, arrange and distribute commodities in telecommunication networks, cargo delivery systems, etc. In this article, it will study two popular hub location problems (p-hub center and p-hub maximal covering problems) under uncertainty. First, novel reliable uncapacitated p-hub location problems are introduced based on considering the failure probability of hubs, in which the parameters are random fuzzy variables, but the decision variables are real variables. Then, the proposed hub location problems under uncertainty are solved by new methods using random fuzzy chance-constrained programming based on the idea of possibility theory. These methods can satisfy optimistic and pessimistic decision makers under uncertain framework. Finally, some benchmark problems are solved as numerical examples to clarify the described methods and show their efficiency.

Sign in / Sign up

Export Citation Format

Share Document