Abstract
The problem of vehicle failure is introduced to the field of inventory-routing problems and formulated. Since the model is NP-hard, we have designed an adapted social-based algorithm with four scenarios to solve it. We have embedded the “global war” procedure into the algorithm to reduce the chance of being trapped in local optimum and premature convergence. For validation, the following benchmarking methods are enlisted: (i) comparing with four other metaheuristic algorithms which are all calibrated and their effectiveness and efficiency evaluated; (ii) comparing with a suggested lower-bound. Sensitivity analyses of the algorithm provide insights for academics and practitioners.
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.
