检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李倩[1] 蒋丽[1] 梁昌勇[1] LI Qian;JIANG Li;LIANG Changyong(School of Management,Hefei University of Technology,Hefei 230009,China)
出 处:《计算机工程与应用》2021年第23期255-262,共8页Computer Engineering and Applications
基 金:教育部人文社科项目(17YJA630037)。
摘 要:随着生鲜冷链行业竞争逐渐白热化,成本高、时效性强、新鲜度难以保持等问题已成为制约冷链物流配送的瓶颈。为提高生鲜配送效率,考虑客户满意度,以货损成本、惩罚成本等综合配送成本最低为目标函数,构建了一个多目标配送路径优化模型。设计带精英策略的非支配排序遗传算法(Elitist Non-dominated Sorting Genetic Algorithm,NSGA-Ⅱ)求解该问题,利用Solomon标准数据集进行仿真模拟实验。实验结果对比分析表明,考虑满意度时冷链物流配送所需车辆更少,总路径长度更短,设计的算法可以在较短的时间内获取到帕累托最优解集,能够有效地解决模糊时间窗下的配送路径优化问题。With the increasingly fierce competition in the fresh cold chain industry, the problems such as high cost, strong timeliness and difficult to maintain freshness have become the bottleneck restricting the distribution of cold chain logistics.In order to improve the efficiency of fresh distribution, a multi-objective distribution path optimization model is established in this paper, which considers the customer satisfaction and takes the cargo damage cost, penalty cost and other comprehensive distribution costs as the lowest objective function. The Elitist Non-dominated Sorting Genetic Algorithm(NSGA-Ⅱ)is designed to solve this problems, and the simulation experiment is carried out by using the Solomon standard data set. The comparative analysis of the experimental results shows that considering the satisfaction, the cold chain logistics distribution needs fewer vehicles and the total path length is shorter, and the designed algorithm can obtain the Pareto optimal solution set in a short time. It can effectively solve the distribution route optimization problem under the fuzzy time window.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.117.228.247