...
首页> 外文期刊>Neural computing & applications >Research on location selection model of distribution network with constrained line constraints based on genetic algorithm
【24h】

Research on location selection model of distribution network with constrained line constraints based on genetic algorithm

机译:Research on location selection model of distribution network with constrained line constraints based on genetic algorithm

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

With the rapid rise of the Internet, China’s e-commerce has also flourished. The development of e-commerce has led to an increase in the volume of logistics and distribution. The further development of e-commerce has also placed higher demands on the timeliness of logistics and distribution. The competition of e-commerce companies has shifted from the competition between business models to the competition between logistics services. The scientific and rational distribution site selection planning is the prerequisite and guarantee for the efficient operation of logistics distribution network. To balance the contradiction between logistics distribution speed and distribution cost has become the key to competition among e-commerce companies. This paper analyzes the current network structure and distribution mode of e-commerce logistics city distribution, and analyzes and discusses the problems existing in current e-commerce logistics city distribution. Furthermore, the bi-level programming is studied. According to the characteristics of the bi-level programming problem, the genetic algorithm flow suitable for bi-level programming is proposed. The bi-level programming model of urban distribution service network site selection with limited lines is proposed. Through the verification of the genetic algorithm in this paper, the proposed method can plan a reasonable service site location layout and distribution models and path selection. The results show that the average daily fuel cost can be reduced by 37.6%, and the transportation distance and fuel cost can be optimized best.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号