Multiple Allocation Hub Location Model with Fixed Arc Costs

2014 ◽  
Vol 47 (1) ◽  
pp. 73-96 ◽  
Author(s):  
Morton E. O'Kelly ◽  
James F. Campbell ◽  
Ricardo S. de Camargo ◽  
Gilberto de Miranda
Keyword(s):  
Location Model ◽  
Hub Location ◽  
Multiple Allocation

scholarly journals Bi-objective load balancing multiple allocation hub location: a compromise programming approach

2020 ◽  
Vol 296 (1-2) ◽  
pp. 363-406 ◽  
Author(s):  
Rahimeh Neamatian Monemi ◽  
Shahin Gelareh ◽  
Anass Nagih ◽  
Dylan Jones
Keyword(s):  
Spatial Distribution ◽  
Transportation Cost ◽  
Compromise Programming ◽  
Mixed Integer ◽  
Programming Approach ◽  
Hub Location ◽  
Hub And Spoke ◽  
Classical Models ◽  
Linear Programming Formulation ◽  
Multiple Allocation

AbstractIn this paper we address unbalanced spatial distribution of hub-level flows in an optimal hub-and-spoke network structure of median-type models. Our study is based on a rather general variant of the multiple allocation hub location problems with fixed setup costs for hub nodes and hub edges in both capacitated and uncapacitated variants wherein the number of hub nodes traversed along origin-destination pairs is not constrained to one or two as in the classical models.. From the perspective of an infrastructure owner, we want to make sure that there exists a choice of design for the hub-level sub-network (hubs and hub edges) that considers both objectives of minimizing cost of transportation and balancing spatial distribution of flow across the hub-level network. We propose a bi-objective (transportation cost and hub-level flow variance) mixed integer non-linear programming formulation and handle the bi-objective model via a compromise programming framework. We exploit the structure of the problem and propose a second-order conic reformulation of the model along with a very efficient matheuristics algorithm for larger size instances.

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

Network Planning Location Model for China Railway Express

2019 ◽  
Vol 2673 (2) ◽  
pp. 263-274 ◽  
Author(s):  
Yuehui Wu ◽  
Chang Lin ◽  
Jingyu Huang
Keyword(s):  
Network Planning ◽  
Location Model ◽  
Hub Location ◽  
Transportation Mode ◽  
Hub And Spoke ◽  
Organization Mode ◽  
China Railway ◽  
Transportation Organization ◽  
Further Development

With the gradual implementation of the Belt & Road Initiative, China Railway Express (CRExpress) has gradually gained support as an important transportation mode between China and Europe. However, the high cost of operation, caused by the unscientific organization mode and the small quantity of returning cargo, hinders the further development of CRExpress. Prior studies have shown that applying the hub-and-spoke transportation organization mode to the CRExpress system could decrease operational cost effectively. To carry out network planning for CRExpress, based on its present situation and properties, a conventional hub location model is adjusted. The network planning location model for CRExpress which minimizes total operation cost and allows direct transportation mode is proposed as well as an algorithm based on the genetic algorithm (GA) approach. The reasonableness and feasibility of the model and algorithm are investigated and verified through a case study based on the CRExpress system. The result indicates that Chengdu, Yingkow, and Zhengzhou are selected as consolidation centers whereas Urumqi and Xining adopt direct transportation mode.

Sign in / Sign up

Export Citation Format

Share Document