Abstract
The Inventory-Routing Problem (IRP) deals with the joint optimisation of inventory and the associated routing decisions. The IRP with time windows (IRPTW) considers time windows for the deliveries to the customers. Due to its importance and several real-world applications, in this paper, we develop an intricate solution algorithm for this problem. A combination of tools ranging from established groups of valid inequalities, pre-processing techniques, local search procedures, and a local branching algorithm is utilised to solve the IRPTW efficiently. We compare the performance of our algorithm on a benchmark set of instances and show how our solution algorithm provides promising results against a competing algorithm from the literature. Moreover, the results of our study provide an overview of the performance of several already proposed techniques and their integration in the literature.
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.
