Abstract
This paper addresses flow shipment scheduling in the hub location-routing problem in which the hub network is not fully interconnected. The aim is to allocate each node to the located hub(s) and to schedule the departure time from the nodes. The proposed integer programming model in this paper, which is inspired by a real-life problem such as postal delivery systems, ensures that the predetermined flow is delivered at the given service time. Moreover, the model solves the problem when the flow arrival demonstrates a piecewise linear pattern. Several classes of preprocessing steps are introduced to solve the model. Computational results obtained from CAB, AP, and a new dataset for Iranian road network (IRN) confirm the efficiency of the proposed preprocessing. In fact, averagely, the run times for CAB, AP, and IRN are reduced by 75.57, 80.41, and 82.96 %, respectively, when the model is solved by preprocessing. Moreover, on average, the number of nodes in the branch and cut tree is decreased by 90.87, 95.67, and 95.86 % for CAB, AP, and IRN, respectively, using the presented preprocessing.
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.
