Abstract

The study of logistics distribution network under e-commerce environment is conducive to the establishment of efficient logistics distribution system, but also to promote the further development of e-commerce and improve social benefits of great significance. This study considers multiple fuzzy factors and introduces a customer fuzzy time window with variable coefficients, establishes a multi-objective set allocation integrated multi-level location path planning model, and proposes an archive type multi-objective simulated annealing improvement algorithm based on master–slave parallel framework embedded taboo search to solve the model. Tabu search and large-scale neighborhood algorithm are used to solve the initial solutions of the first level network and the second level network respectively, and archival reception criterion is introduced to deal with the multi-objective problem. The results of the proposed algorithm for the two-level site-routing problem are less than 6% different from the internationally known optimal solution. The master–slave parallel computing framework improves the efficiency of the algorithm by about 6.38%. The experimental results prove the effectiveness and necessity of the improved optimization. In addition, this study simulates the site-routing problem model constructed by the study by extending the data of standard examples. The experimental results prove the correctness and reference significance of the multilevel site-routing problem model with multiple fuzzy factors.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.