Expectation-Maximization Algorithm of Gaussian Mixture Model for Vehicle-Commodity Matching in Logistics Supply Chain

Qi Sun, Liwen Jiang, Haitao Xu and Harish Garg

Complexity, 2021, vol. 2021, 1-11

Abstract: A vehicle-commodity matching problem (VCMP) is presented for service providers to reduce the cost of the logistics system. The vehicle classification model is built as a Gaussian mixture model (GMM), and the expectation-maximization (EM) algorithm is designed to solve the parameter estimation of GMM. A nonlinear mixed-integer programming model is constructed to minimize the total cost of VCMP. The matching process between vehicle and commodity is realized by GMM-EM, as a preprocessing of the solution. The design of the vehicle-commodity matching platform for VCMP is designed to reduce and eliminate the information asymmetry between supply and demand so that the order allocation can work at the right time and the right place and use the optimal solution of vehicle-commodity matching. Furthermore, the numerical experiment of an e-commerce supply chain proves that a hybrid evolutionary algorithm (HEA) is superior to the traditional method, which provides a decision-making reference for e-commerce VCMP.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/9305890.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/9305890.xml (application/xml)

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:hin:complx:9305890

DOI: 10.1155/2021/9305890

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().