A Maximum Profit Incomplete Hub Location Routing Problem
Publish place: 13th International Industrial Engineering Conference
Publish Year: 1395
Type: Conference paper
Language: English
View: 535
This Paper With 7 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
IIEC13_097
Index date: 5 September 2017
A Maximum Profit Incomplete Hub Location Routing Problem abstract
Location area is one of the most important research areas indecision-making due to the widely used. Hub location as atype of location problem has many applications such astransportation and telecommunication systems. The hublocation problem (HLP) involves finding the location of hubsand allocates the other nodes to them. A significant issue thatmore should be noted that it is always minimizing cost is nota perfect solution for the survival. Therefore, otherparameters such as price play significant role in the survivalof the organization. Therefore, in this article, we considerprofit at incomplete hub location and routing problem overthe incomplete networks. We use two type datasets. First,Iranian Road Network (IRN) and second, Australia Post(AP). We run the model for different values of and on software CPLEX 12.5 and observe number of hubs,number of hub nodes, number of hub links and spoke links.The results show that the location of hubs is not usuallyaltered by changing in the price. Moreover, the number ofspoke links may be changed by increasing the price.
A Maximum Profit Incomplete Hub Location Routing Problem Keywords:
A Maximum Profit Incomplete Hub Location Routing Problem authors
Hossein Karimi
Department of Industrial Engineering, University of Bojnord, Bojnord, Iran
Mohaddese Mohammadi
Department of Industrial Engineering, University of Bojnord, Bojnord, Iran