Abstract
This article formulates an inventory routing problem in which backorders are allowed, each vehicle is used at most once, a central depot distributes a single product to a set of customers with an incremental delivery, each customer is served at most once over a finite planning period and the objective is minimizing transportation and inventory costs. Since the proposed model is an Np-Hard problem, for solving large scale problems two meta-heuristics, discrete invasive weed optimization and Genetic algorithm are presented. Tuning the parameters of the algorithms are performed by regression approach. In this approach, equation of fitness is found in terms of the parameters and the best value of the parameters is found in a way that the equation is minimized. Performance of the algorithms for solving the IRP is compared with statistical and multi-attribute decision making approach in terms of computational time and quality of solutions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.