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

被引:45
作者
Guo, Kai [1 ,2 ]
机构
[1] Henan Univ Sci, Sch Management, Technol, Luoyang, Peoples R China
[2] Henan Prov Collaborat Innovat Ctr Nonferrous Meta, Luoyang, Peoples R China
关键词
Facility location problem; Restricted line constraint; Vehicle path; Bi-level programming; OPTIMIZATION ALGORITHM;
D O I
10.1007/s00521-019-04257-y
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:1679 / 1689
页数:11
相关论文
共 25 条
[1]   Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm [J].
Alba, Enrique ;
Dorronsoro, Bernabe .
INFORMATION PROCESSING LETTERS, 2006, 98 (06) :225-230
[2]   Metaheuristics with disposal facility positioning for the waste collection VRP with time windows [J].
Benjamin, A. M. ;
Beasley, J. E. .
OPTIMIZATION LETTERS, 2013, 7 (07) :1433-1449
[3]   A Simheuristic for the Heterogeneous Site-Dependent Asymmetric VRP with Stochastic Demands [J].
Calvet, Laura ;
Pages-Bernaus, Adela ;
Travesset-Baro, Oriol ;
Juan, Angel A. .
ADVANCES IN ARTIFICIAL INTELLIGENCE, CAEPIA 2016, 2016, 9868 :408-417
[4]  
Ceria S., 1998, Annotated Bibliographies in Combinatorial Optimization, P415
[5]   Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem [J].
Crawford, Broderick ;
Soto, Ricardo ;
Cuesta, Rodrigo ;
Paredes, Fernando .
SCIENTIFIC WORLD JOURNAL, 2014,
[6]  
Daskin M.S., 2015, Location Science, P21, DOI [10.1007/978-3-319-13111-52, DOI 10.1007/978-3-319-13111-52]
[7]   A differential evolution algorithm for the capacitated VRP with flexibility of mixing pickup and delivery services and the maximum duration of a route in poultry industry [J].
Dechampai, Darat ;
Tanwanichkul, Ladda ;
Sethanan, Kanchana ;
Pitakaso, Rapeepan .
JOURNAL OF INTELLIGENT MANUFACTURING, 2017, 28 (06) :1357-1376
[8]  
Ebrahimi Zade Amir, 2014, Journal of Industrial Engineering International, V10, P185, DOI 10.1007/s40092-014-0076-4
[9]  
Exposito A, 2018, COMPUTER AIDED SYSTE
[10]   A New Local Search for the p-Center Problem Based on the Critical Vertex Concept [J].
Ferone, Daniele ;
Festa, Paola ;
Napoletano, Antonio ;
Resende, Mauricio G. C. .
LEARNING AND INTELLIGENT OPTIMIZATION (LION 11 2017), 2017, 10556 :79-92