Abstract

Many transport service providers operate on hub-and-spoke network structures. Major operators may have several dedicated hub facilities that are leased for a time horizon rather than being owned or constructed. For a given discrete planning horizon, service providers must decide on the location of the hub ports (i.e. terminals), the period when the lease contract starts, the period when the existing contracts must be terminated and the flow routing over the entire planning horizon so as to minimize the total operational cost. Thus, we propose a mathematical model for a Multi-period Uncapacitated Multiple Allocation Hub Location Problem with Budget Constraint. The proposed model incorporates several features of practice, particularly from maritime and land transport practices. We also propose a meta-heuristic solution algorithm that produces high-quality solutions in a reasonable amount of time. By exploiting the decomposable structure of the model, we extended a Benders decomposition approach by proposing several improvements. Extensive computational experiments confirm the efficiency of the proposed methods and also show its limitations.

Full Text
Paper version not known

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 call

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.