Abstract
Hub covering location problem focuses on the construction of the hub network. The importance of this problem has been addressed in many fields including freight transportation and telecommunication network. As a long-term strategic decision problem, the construction of the hub network has large scale environmental influences especially the emissions of greenhouse gas. In the meanwhile, the precise information of the parameters cannot be obtained. Therefore, this work investigates the sustainable hub covering location problem with uncertain parameters. The purpose is to minimize the overall cost and impose restrictions on the total CO2 emissions, simultaneously. The travel times are depicted by uncertain variables to portray inherent indeterminacy within this problem. The incomplete network is adopted to decrease the total investment cost considerably. Accordingly, two uncertain programming models are constructed and transformed into their equivalent forms. A modified genetic algorithm is proposed to solve the proposed models. Several experiments are performed to interpret the efficiency of the proposed algorithm and the validity of the proposed models. The experimental results show that accounting for the emission restriction and the adoption of incomplete hub network will significantly affect the overall investment cost and the construction of the hub network.
Highlights
Hub covering location problem is a vital category regarding logistic transportation systems with a couple of nodes shipping flows between each pair of them
1) In traditional hub location problem, the researchers only focused on the optimization of the economic aspects, i.e., the total costs for constructing the hub network
With the concept of sustainability has drawn increasing attention in recent years, it is a challenge for decision makers to design the sustainable hub network with emission restriction
Summary
Hub covering location problem is a vital category regarding logistic transportation systems with a couple of nodes shipping flows (such as commodities, passengers or messages) between each pair of them. Hubs hold the post of gathering, transmitting and dispensing centers to get the utmost out of the scale economy effect on connections between hubs. The objective of this problem is to minimize the overall cost for constructing hub network in order to guarantee that the travel times between origins and destinations are not beyond predetermined time radius. Campbell first modeled this problem as an integer programming formulation [1]. On the aspect of application, this problem has arisen in lots of fields including freightage [10], [11], The associate editor coordinating the review of this manuscript and approving it for publication was Engang Tian
Sign-in/Register to view highlights & summary 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.
