Premium
Hub Location Problem with Allowed Routing between Nonhub Nodes
Author(s) -
Mahmutoğulları Ali İrfan,
Kara Bahar Yetis
Publication year - 2015
Publication title -
geographical analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.773
H-Index - 65
eISSN - 1538-4632
pISSN - 0016-7363
DOI - 10.1111/gean.12075
Subject(s) - closeness , transshipment (information security) , computer science , bounded function , mathematical optimization , routing (electronic design automation) , mathematics , computer network , mathematical analysis , computer security
In this study, we relax one of the general assumptions in the hub location literature by allowing routed flows between nonhub nodes. In hub networks, different flows are consolidated and routed via collection, interhub, and distribution arcs. Due to consolidation, some flows travel long paths despite closeness of their origin and destination. In this study, we allow direct flows by penalizing by a scalar factor of original cost of transshipment between these arcs. We present mathematical models for median, center, and set covering versions of the problem for single‐ and multi‐allocation cases. We test the models with the CAB and TR data sets. We discuss the properties of established direct connections for different models by using another mathematical model where the number of direct flows is bounded and interpret the effect of changes in problem parameters.