Solving the Inventory Routing Problem with the Archimedes Optimization Algorithm

Abstract

The inventory routing problem (IRP) is an optimization problem many companies and organizations are confronted with in logistics processes. This optimization problem is about scenarios where a vendor must find an optimal solution to distribute goods to multiple customers. Finding a solution considering all costs and constraints is a difficult task. For this reason, many optimization algorithms have been applied to the problem.