E-Commerce Logistics Path Optimization Based on a Hybrid Genetic Algorithm

Complexity 2021:1-10 (2021)
  Copy   BIBTEX

Abstract

Based on the problem of e-commerce logistics and distribution network optimization, this paper summarizes the solution ideas and solutions proposed by domestic and foreign scholars and designs a method to optimize the B2C e-commerce logistics and distribution network by taking into account the special traffic conditions in the city. The logistics network optimization model is established and solved by combining various methods. Taking into account the new target requirements constantly proposed in the modern logistics environment, the vehicle path problem under the generalized objective function is studied, and the multidimensional impact maximization problem in this type of problem is proposed and modeled. The problem follows from the path planning for emergency material delivery. Given locations, roads, and multiple classes of supplies in a map, each road allows vehicles to deliver each class of supplies with a certain probability. The goal of the problem is how to select a finite number of locations in the map as centers of supplies so that the number of locations that can be effectively covered by vehicle paths from them is maximized with the desired probability. For the first time, we used a hybrid genetic algorithm to optimize the e-commerce logistics path, and the optimized results are more reasonable than other algorithms.

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

Analytics

Added to PP
2021-03-23

Downloads
8 (#1,287,956)

6 months
5 (#629,136)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dong Yang
Purdue University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references