Modeling inventory routing problems in supply chains of high consumption products

Aghezzaf, El‐Houssaine; Raa, Birger; Landeghem, Hendrik Van

doi:10.1016/j.ejor.2005.02.008

Cited by 114 publications

(85 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For this study, the IRP model proposed by Aghezzaf et al (2006) is adopted. This model is a variant of the general IRP problem, where distribution is planned in a cyclical way from multiple distribution centres, denoted by rk (k=I, ... ,p) to a set of sales-points S(i=l, ... , n).…”

Section: The Distribution Problemmentioning

confidence: 99%

“…In case of single depot, the formal mix integer formulation for the problem as is proposed in (Aghezzaf et al 2006) is based on the following assumptions:…”

Section: The Mixed Integer Formulation Of the Problemmentioning

confidence: 99%

“…In the following we summarise the approximation algorithm proposed in (Aghezzaf et al, 2006). This algorithm is based on a column generation process in which the subproblem generating multi-tours is solved heuristically.…”

Section: An Approximation Algorithmmentioning

confidence: 99%

“…To determine the feasible multi-tour with the least reduced cost, a multi-tour-generator subproblem IRPsp is solved with an extended savings-based heuristics (for more details see Aghezzaf et al, 2006 A multi-tour v is defined by the binary matrix Xv, the matrix ZJ and the parameter T J such that x~/=l if multi-tour v contains a trip that visits the sales-point j immediately after the sales-point i. The cost rate of the multi-tour can be computed as follows:…”

Section: An Approximation Algorithmmentioning

confidence: 99%

See 3 more Smart Citations

A combined inventory routing and game theory approach for a real-world distribution problem

Mateo

Aghezzaf

Vinyes

2009

2009 International Conference on Computers &Amp; Industrial Engineering

Self Cite

View full text Add to dashboard Cite

In this paper, we develop a solution approach combining inventory routing and game theory and discuss it application to solve a real-world distribution and logistics problem. The problem consists of developing a distribution plan to replenish inventory at the involved sales-points and then clustering these sales-points into groups willing to cooperate and share a part of their stocks. The distribution and clustering strategies should be developed in such a way so as to minimize distribution and inventory costs of the system. The cooperation inside each cluster increases the potential inventory to which each member of this cluster has access. This enhances, in tum, the service level of each sales-point. The approach is implemented for a real-life case and the obtained results are reported and discussed in this paper.

show abstract

Section: The Distribution Problemmentioning

confidence: 99%

“…In case of single depot, the formal mix integer formulation for the problem as is proposed in (Aghezzaf et al 2006) is based on the following assumptions:…”

Section: The Mixed Integer Formulation Of the Problemmentioning

confidence: 99%

Section: An Approximation Algorithmmentioning

confidence: 99%

Section: An Approximation Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

A combined inventory routing and game theory approach for a real-world distribution problem

Mateo

Aghezzaf

Vinyes

2009

2009 International Conference on Computers &Amp; Industrial Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…We can observe that most of the earlier works concentrate on an infinite planning horizon (see for example Aghezzaf et al [9], Anily and Bramel [10] and Campbell and Savelsbergh [11]). …”

Section: Introductionmentioning

confidence: 97%

Ant Colony Optimization For Split Delivery Inventory Routing Problem

Wong

Moin

2017

MJCS

View full text Add to dashboard Cite

A one-to-many inventory routing problem (IRP) network comprising of a warehouse and geographically dispersed customers is studied in this paper. A fleet of a homogeneous vehicle located at the warehouse transports multi products from the warehouse to meet customer's demand on time in a finite planning horizon. We allow the customers to be visited more than once in a given period (split delivery) and the demand for each product is deterministic and time varying. Backordering is not allowed. The problem is formulated as a mixed integer programming problem and is solved using CPLEX 12.4 to get the lower and upper bound (the best integer solution) for each problem considered. We propose a modified ant colony optimization (ACO) which takes into account not only the distance but also the inventory that is vital in the IRP. We also carried the sensitivity analysis on important parameters that influence decision policy in ACO in order to choose the appropriate parameter settings. The computational results show that ACO performs better on large instances compared to the upper bound and performs equally well for small and medium instances. The modified ACO requires relatively short computational time.Keywords: Ant Colony Optimization, Inventory, Routing INTRODUCTIONSupply chain management is the control of supply chain to manage the flow of commodity both within and among the companies. Inventory routing problem (IRP) is a challenging NP hard problem in supply chain management which combines the vehicle routing problem where the route to visit the customers is decided and inventory management which concerns on the amount to be delivered to the customers. The main objective of IRP is to minimize both the total transportation and inventory cost over the planning horizon.Generally, IRP can be divided by different criteria such as the type of demand, single or multi period, planning horizon, and inventory policy (order-up-to level or maximum level Coelho and Laporte [1] recently proposed a branch-and-cut algorithm to solve the multi-product multi-vehicle IRP with deterministic demand and stock out cost is not allowed. In their paper, Coelho and Laporte [1] implemented a solution improvement algorithm after branch-and-cut identifies a new best solution. The purpose of solution improvement algorithm is to approximate the cost of a new solution resulting from the vertex removal and reinsertions. In this paper, the authors also considered additional two features: the driver partial consistency and the visiting space consistency. The results show that the visiting space helps in reducing the search space while providing a meaningful solution. This is the first paper that solves the problem with heterogeneous vehicles.The planning horizon of the problem also can be categorized into finite or infinite horizon. We can observe that most of the earlier works concentrate on an infinite planning horizon (see for example Aghezzaf et al. IRP with finite planning horizon can be categorized as a single or multi-period scenario. Feder...

show abstract

Bibliography

2016

Metaheuristics for Vehicle Routing Problems

View full text Add to dashboard Cite

Modeling inventory routing problems in supply chains of high consumption products

Cited by 114 publications

References 12 publications

A combined inventory routing and game theory approach for a real-world distribution problem

A combined inventory routing and game theory approach for a real-world distribution problem

Ant Colony Optimization For Split Delivery Inventory Routing Problem

Bibliography

Contact Info

Product

Resources

About