Research on IRP of Perishable Products Based on Mobile Data Sharing Environment

Zelin Wang, Xiaoning Wei and Jiansheng Pan
Additional contact information
Zelin Wang: School of Information Science and Technology, Nantong University, Nantong, China
Xiaoning Wei: School of Information Science and Technology, Nantong University, Nantong, China
Jiansheng Pan: School of Information Science and Technology, Nantong University, Nantong, China

International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), 2021, vol. 15, issue 2, 139-157

Abstract: Inventory routing problem (IRP) has always been a hot issue. Due to its particularity, perishable products have high requirements for inventory and transportation. In order to reduce the losses of perishable goods and improve the storage efficiency of perishable goods, based on the general inventory path problem, this paper further has studied the IRP of perishable goods. In addition, in the process of product distribution and transportation, there are a lot of real-time product information generated dynamically. These real-time mobile data must be shared by the whole distribution network, which will also dynamically affect the efficiency of IRP research. On the basis of some assumptions, the mathematical model has been established with inventory and vehicle as constraints and the total cost of the system as the objective. In view of the particularity of perishable inventory path problem, this paper proposed an improved differential evolution algorithm (IDE) to improve the differential evolution algorithm from two aspects. Firstly, the population has been initialized by gridding and the greedy local optimization algorithm has been used to assist the differential evolution algorithm, with these measures to improve the convergence speed of the algorithm. Then, the accuracy of the algorithm is improved by the adaptive scaling factor, two evolution modes and changing the constraints of the problem. Then the improved algorithm has been used to solve the inventory path problem. The results of numerical experiments show that the algorithm is effective and feasible and can improve the accuracy and speed up the convergence of the algorithm.

Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... IJCINI.20210401.oa10 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jcini0:v:15:y:2021:i:2:p:139-157

Access Statistics for this article

International Journal of Cognitive Informatics and Natural Intelligence (IJCINI) is currently edited by Kangshun Li

More articles in International Journal of Cognitive Informatics and Natural Intelligence (IJCINI) from IGI Global
Bibliographic data for series maintained by Journal Editor ().