
AbstractIn this paper, we present and compare formulations for the inventory routing problem (IRP) where the demand of customers has to be served, over a discrete time horizon, by capacitated vehicles starting and ending their routes at a depot. The objective of the IRP is the minimization of the sum of inventory and transportation costs. The formulations include known and new mathematical programming formulations. Valid inequalities are also presented. The formulations are tested on a large set of benchmark instances. One of the most significant conclusions is that the formulations that use vehicle‐indexed variables are superior to the more compact, aggregate formulations.
supply chain management, Routing problems; Integer programming; Branch-and-cut algorithm; Supply chain management, Routing problems, Transportation, logistics and supply chain management, routing problems, Branch-and-cut algorithm, Integer programming, Inventory, storage, reservoirs, Polyhedral combinatorics, branch-and-bound, branch-and-cut, branch-and-cut algorithm, Supply chain management, integer programming
supply chain management, Routing problems; Integer programming; Branch-and-cut algorithm; Supply chain management, Routing problems, Transportation, logistics and supply chain management, routing problems, Branch-and-cut algorithm, Integer programming, Inventory, storage, reservoirs, Polyhedral combinatorics, branch-and-bound, branch-and-cut, branch-and-cut algorithm, Supply chain management, integer programming
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 70 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
