The inventory-routing problem subject to vehicle failure

The problem of vehicle failure is introduced to the field of inventory-routing problems and formulated. Since the model is NP-hard, the authors have designed an adapted social-based algorithm with four scenarios to solve it. They 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.


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01709568
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jun 28 2019 11:40AM