Abstract
A highly efficient exact algorithm for the uncapacitated multiple allocation p-hub center problem
Highlights
This paper addresses the problem of uncapacitated multiple allocation p-hub center problem (UMApHCP) which is fundamental in proper functioning of time-sensitive transportation systems
Since the UMApHCP belongs to the class of NP-hard problems, proposing an exact solution algorithm which is able to solve large-scale instances of the problem in order of seconds is of utmost theoretical and practical importance
We considered the uncapacitated multiple allocation p-hub center problem (UMApHCP) and formulated the problem as linear mixed integer programming model
Summary
Hubs are key facilities that act as intermediate centers for switching, sorting, and consolidating the commodities in many-to-many transportation systems and telecommunication networks. Reducing cost is the primary concern in many practical problems in transportation, postal services, and telecommunication industries, it sometimes leads to unsatisfactory solutions in terms of service equitability as the distance between the O/D pairs might be excessively large in the worst case This is an undesirable outcome when we deal with the delivery of perishable or time-sensitive items or when the aim is to provide a socially equitable service for different O/D traffic which is essential for a sustainable transportation system. To remedy this drawback, one option is to use hub center problem in order to minimize the maximum distance (or cost) between the O/D pairs.
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 callDisclaimer: 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.
