Abstract
Inventory routing problem is a NP-hard problem, and its research has always been a hot issue. The special operation of perishable goods puts forward higher requirements for inventory and transportation. In order to reduce the quantity of deteriorated goods, improve the storage efficiency of perishable goods, and further reduce the operating cost of enterprises, the inventory path problem is studied on the basis of inventory path problem. In order to rationally arrange the distribution time, quantity and route of each customer point, a mathematical model is established on the basis of some assumptions, taking inventory and vehicles as constraints, and aiming at optimizing the total cost of the system. In view of the particularity of perishable goods inventory routing problem, the proposed algorithm (IDE) improves the differential evolution algorithm from two perspectives. The grid is used to initialize the population and the greedy local optimization algorithm is combined with the differential evolution algorithm to improve the convergence speed of the algorithm. The accuracy of the algorithm is improved by adaptive scaling factor, two evolutionary modes and changing the constraints of the problem. Then the improved algorithm is used to solve the inventory routing problem. The numerical results show that the algorithm is effective and feasible, and can improve the accuracy of the algorithm and accelerate the convergence speed of the algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Li, Y., Zhang, S., Han, J.: Dynamic pricing and periodic ordering for a stochastic inventory system with deteriorating items. Automatica 5, 200–213 (2017)
Mirzaei, S., Seifi, A.: Considering lost sale in inventory routing problems for perishable goods. Comput. Ind. Eng. 47, 213–227 (2015)
Bhattacharjee, S., Ramesh, R.: A multi-period profit maximizing model for retail supply chain management: an integration of demand and supply-side mechanisms. Eur. J. Oper. Res. 122(3), 584–601 (2007)
Levin, Y., McGill, J., Nediak, M.: Risk in revenue management and dynamic pricing. Oper. Res. 56(2), 326–343 (2008)
Goyal, S.M., Giri, B.C.: Recent trends in modeling deteriorating inventory. Eur. J. Oper. Res. 134, 1–16 (2001)
Donselaar, M.V., Woensel, T.V., Broekmeulen, R.: Inventory control of perishables in supermarkets. Int. J. Prod. Econ. 104(2), 462–472 (2006)
Anily, S., Bramel, J.: An asymptotic 98.5% effective lower bound on fixed partition policies for the inventory-routing problem. Discret. Appl. Math. 145(1), 22–39 (2004)
Anily, S., Federgruen, A.: One warehouse multiple retailer systems with vehicle routing costs. Manag. Sci. 36(1), 92–114 (1990)
Chan, L., Federgruen, A., Simchi-Levi, D.: Probabilistic analyses and practical algorithms for inventory-routing models. Oper. Res. Int. J. 46(1), 96–106 (1998)
Rafie-Majd, Z., Pasandideh, S.H.R., Naderi, B.: Modelling and solving the integrated inventory-location-routing problem in a multi-period and multi-perishable product supply chain with uncertainty: lagrangian relaxation algorithm. Comput. Chem. Eng. 109, 9–22 (2017)
Mjirda, A., Jarboui, B., Macedo, R., Hanafi, S., Mladenovic, N.: A two phase variable neighborhood search for the multi-product inventory routing problem. Comput. Oper. Res. 52, 291–299 (2014)
Li, K., Chen, B., Sivakumar, A.I., Wu, Y.: An inventory routing problem with the objective of travel time minimization. Eur. J. Oper. Res. 236, 936–945 (2014)
Tang, R.: Decentralizing and coevolving differential evolution for large-scale global optimization problems. Appl. Intell. 4, 1–16 (2017)
GhasemishabanMareh, B., Li, X., Ozlen, M.: Cooperative coevolutionary differential evolution with improved augmented Lagrangian to solve constrained optimisation problems. Inf. Sci. 369, 441–456 (2016)
Salman, A.A., Ahmad, I., Omran, M.G.H.: A metaheuristic algorithm to solve satellite broadcast scheduling problem. Inf. Sci. 322(C), 72–91 (2015)
Wang, Z., Wu, Z., Zhang, B.: Packet matching algorithm based on improving differential evolution. Wuhan Univ. J. Nat. Sci. 17(5), 447–453 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Wang, Z., Pan, J. (2020). Research on IRP of Perishable Products Based on Improved Differential Evolution Algorithm. In: Li, K., Li, W., Wang, H., Liu, Y. (eds) Artificial Intelligence Algorithms and Applications. ISICA 2019. Communications in Computer and Information Science, vol 1205. Springer, Singapore. https://doi.org/10.1007/978-981-15-5577-0_39
Download citation
DOI: https://doi.org/10.1007/978-981-15-5577-0_39
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-5576-3
Online ISBN: 978-981-15-5577-0
eBook Packages: Computer ScienceComputer Science (R0)