Abstract
Solving uncapacitated multiple allocation p-hub center problem by Dijkstra’s algorithm-based genetic algorithm and simulated annealing
Highlights
In some networks, for example, telecommunication or transportations systems, there exist many nodes whose flows should depart from one origin node and arrive in a destination node
Having the information obtained from running Dijkstra’s algorithm once for each node, one can minimize the maximum length between any origin/destination nodes which is exactly equivalent with solving an uncapacitated multiple allocation p-hub center problem (UMApHCP)
The first set of test problem instances belong to Civil Aeronautics Board (CAB) data set based on airline passenger flow between cities of the United States
Summary
For example, telecommunication or transportations systems, there exist many nodes whose flows should depart from one origin node and arrive in a destination node. There are two basic types of hub networks: single allocation and multiple allocations. Their difference is in the way of allocating non-hub nodes to hub centers. According to Alumur and Kara (2008) “In single allocation, all the incoming and outgoing traffic of every demand center is routed through a single hub; in multiple allocation, each demand center can receive and send flow through more than one hub.”.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Industrial Engineering Computations
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
