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

Complexity 2021:1-11 (2021)
  Copy   BIBTEX

Abstract

A vehicle-commodity matching problem is presented for service providers to reduce the cost of the logistics system. The vehicle classification model is built as a Gaussian mixture model, and the expectation-maximization 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 is superior to the traditional method, which provides a decision-making reference for e-commerce VCMP.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Night Time Vehicle Detection.Iman A. Mohammed & Hasan Fleyeh - 2012 - Journal of Intelligent Systems 21 (2):143-165.

Analytics

Added to PP
2021-01-14

Downloads
66 (#241,176)

6 months
62 (#69,287)

Historical graph of downloads
How can I increase my downloads?