This paper concerns the Inventory Routing Problem (IRP) which is an optimization problem addressing the optimization of transportation routes and the inventory levels at the same time. The IRP is notable for its difficulty - even finding feasible initial solutions poses a significant problem.
In this paper an evolutionary algorithm is proposed that uses approaches to solution construction and modification utilized by practitioners in the field. The population for the EA is initialized starting from a base solution which in this paper is generated by a heuristic, but can as well be a solution provided by a domain expert. Subsequently, feasibility-preserving moves are used to generate the initial population. In the paper dedicated recombination and mutation operators are proposed which aim at generating new solutions without loosing feasibility. In order to reduce the search space, solutions in the presented EA are encoded as lists of routes with the quantities to be delivered determined by a supplying policy.
The presented work is a step towards utilizing domain knowledge in evolutionary computation. The EA presented in this paper employs mechanisms of solution initialization capable of generating a set of feasible initial solutions of the IRP in a reasonable time. Presented operators generate new feasible solutions effectively without requiring a repair mechanism.
Inventory Routing Problem Dedicated genetic operators Knowledge-based optimization Constrained optimization
This is a preview of subscription content, log in to check access.
This work was supported by the Polish National Science Centre (NCN) under grant no. 2015/19/D/HS4/02574. Calculations have been carried out using resources provided by Wroclaw Centre for Networking and Supercomputing (http://wcss.pl), grant no. 405.
Aghezzaf, E.H., Raa, B., Van Landeghem, H.: Modeling inventory routing problems in supply chains of high consumption products. Eur. J. Oper. Res. 169(3), 1048–1063 (2006)MathSciNetCrossRefGoogle Scholar
Coelho, L.C., Cordeau, J.F., Laporte, G.: The inventory-routing problem with transshipment. Comput. Oper. Res. 39(11), 2537–2548 (2012)MathSciNetCrossRefGoogle Scholar
Nolz, P.C., Absi, N., Feillet, D.: A stochastic inventory routing problem for infectious medical waste collection. Networks 63(1), 82–95 (2014)MathSciNetCrossRefGoogle Scholar
Hiassat, A., Diabat, A., Rahwan, I.: A genetic algorithm approach for location-inventory-routing problem with perishable products. J. Manuf. Syst. 42, 93–103 (2017)CrossRefGoogle Scholar
Archetti, C., Bertazzi, L., Laporte, G., Speranza, M.G.: A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transp. Sci. 41(3), 382–391 (2007)CrossRefGoogle Scholar
Bard, J.F., Nananukul, N.: Heuristics for a multiperiod inventory routing problem with production decisions. Comput. Ind. Eng. 57(3), 713–723 (2009)CrossRefGoogle Scholar
Diabat, A., Dehghani, E., Jabbarzadeh, A.: Incorporating location and inventory decisions into a supply chain design problem with uncertain demands and lead times. J. Manuf. Syst. 43, 139–149 (2017)CrossRefGoogle Scholar
Liu, S.C., Chen, J.R.: A heuristic method for the inventory routing and pricing problem in a supply chain. Expert Syst. Appl. 38(3), 1447–1456 (2011)CrossRefGoogle Scholar
Juan, A.A., et al.: A review of simheuristics: extending metaheuristics to deal with stochastic combinatorial optimization problems. Oper. Res. Perspect. 2, 62–72 (2015)MathSciNetCrossRefGoogle Scholar
Juan, A.A., Grasman, S.E., Caceres-Cruz, J., Bekta, T.: A simheuristic algorithm for the single-period stochastic inventory-routing problem with stock-outs. Simul. Model. Pract. Theor. 46, 40–52 (2014)CrossRefGoogle Scholar