检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王楚阳 WANG Chuyang(Jiangsu Vocational College of Finance and Accounting,Lianyungang Jiangsu 222000,China)
出 处:《信息与电脑》2024年第1期43-45,共3页Information & Computer
摘 要:随着无人技术的不断发展,无人终端配送在物流领域的应用逐渐成为研究热点。配送路径优化是无人终端配送系统中的关键问题,目的是在满足特定约束条件的前提下,寻找最优的配送路径,以提高配送效率,降低配送成本。文章针对无人终端配送的路径优化问题,提出一种基于优化的禁忌搜索算法,通过实验验证了算法的有效性,并对实验结果进行分析。With the continuous development of unmanned technology,the application of unmanned terminal delivery in the logistics field has gradually become a research hotspot.Optimization of delivery paths is one of the key issues in unmanned terminal delivery systems.Its purpose is to find the optimal delivery path while meeting specific constraints,in order to improve delivery efficiency and reduce delivery costs.This article proposes an optimized tabu search algorithm for the path optimization problem of unmanned terminal delivery,and verifies its effectiveness through experiments.The experimental results are analyzed.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15