Abstract
In this paper, we incorporate shipment scheduling decisions into hub location problems. Our aim is to determine the optimal locations of hubs, hub network structure, and the number of dispatches to operate on the hub network as well as the time period of dispatching each vehicle from a hub. We develop three mixed-integer programming models for different versions of this problem, depending on whether holding costs are incorporated and whether the vehicles are of different types. We investigate the impact of shipment scheduling decisions and holding costs on hub network configurations, routing decisions, and total cost of the network. We solve the models on instances from a new dataset with real data.
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.
