IDEAS home Printed from https://ideas.repec.org/a/hin/complx/5591811.html
   My bibliography  Save this article

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

Author

Listed:
  • Dong Yang
  • Peijian Wu
  • Wei Wang

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.

Suggested Citation

  • Dong Yang & Peijian Wu & Wei Wang, 2021. "E-Commerce Logistics Path Optimization Based on a Hybrid Genetic Algorithm," Complexity, Hindawi, vol. 2021, pages 1-10, March.
  • Handle: RePEc:hin:complx:5591811
    DOI: 10.1155/2021/5591811
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/5591811.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/5591811.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/5591811?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:complx:5591811. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.