相似文献/References:
[1]黄红.基于GIS的物流配送系统路径优化的算法[J].计算机技术与发展,2006,(08):46.
HUANG Hong.Algorithm for Optimizing Route in Logistics Delivering System Based on GIS[J].,2006,(11):46.
[2]方伟华.基于A*算法和图遍历的烟草物流VRP的研究[J].计算机技术与发展,2011,(12):63.
FANG Wei-hua.Research on Tobacco Logistics VRP Based on A * Algorithm and Graph Traversal[J].,2011,(11):63.
[3]段爱民 陈泽琳 陈海波.基于改进蚁群算法的物流配送路径优化[J].计算机技术与发展,2011,(12):178.
DUAN Ai-min,CHEN Ze-lin,CHEN Hai-bo.Path Optimization for Logistics Distribution Based on Improved Ant Colony Algorithm[J].,2011,(11):178.
[4]程芳,徐华.三维巷道场景中虚拟漫游路径优化研究[J].计算机技术与发展,2018,28(02):140.[doi:10.3969/j.issn.1673-629X.2018.02.030]
CHENG Fang,XU Hua.Research on Optimization of Virtual Roaming Route in 3D Tunnel Scene[J].,2018,28(11):140.[doi:10.3969/j.issn.1673-629X.2018.02.030]
[5]王莉. 面向QoE驱动的软件定义网络业务流控制模型[J].计算机技术与发展,2015,25(11):125.
WANG Li. Model of Software Defined Network Service-flow Control to QoE-driven[J].,2015,25(11):125.
[6]申艳光,张玲玉,刘永红.基于混合遗传算法的物流路径优化方法研究[J].计算机技术与发展,2018,28(03):192.[doi:10.3969/j.issn.1673-629X.2018.03.041]
SHEN Yan-guang,ZHANG Ling-yu,LIU Yong-hong.Study on Optimizing of Physical Routing Method Based on Hybrid Genetic Algorithm[J].,2018,28(11):192.[doi:10.3969/j.issn.1673-629X.2018.03.041]
[7]汤文兵,陈亚楠,张牧.一种引入单纯形法的能量均衡路由算法[J].计算机技术与发展,2019,29(03):55.[doi:10.3969/ j. issn.1673-629X.2019.03.011]
TANG Wen-bing,CHEN Ya-nan,ZHANG Mu.An Energy Balanced Routing Algorithm with Simplex Method[J].,2019,29(11):55.[doi:10.3969/ j. issn.1673-629X.2019.03.011]
[8]运杰伦,郭元术,林欣欣.基于 ACO-SVM 的交通状态分类精度研究[J].计算机技术与发展,2020,30(07):17.[doi:10. 3969 / j. issn. 1673-629X. 2020. 07. 004]
YUN Jie-lun,GUO Yuan-shu,LIN Xin-xin.Research on Traffic State Classification Accuracy Based on ACO-SVM[J].,2020,30(11):17.[doi:10. 3969 / j. issn. 1673-629X. 2020. 07. 004]
[9]邵可南,吕成瑶,张帅帅,等.一种基于冷链低碳物流路径的混合优化算法[J].计算机技术与发展,2021,31(02):27.[doi:10. 3969 / j. issn. 1673-629X. 2021. 02. 005]
SHAO Ke-nan,LYU Cheng-yao,ZHANG Shuai-shuai,et al.A Hybrid Optimization Algorithm Based on Low-carbon Cold Chain Logistic Route[J].,2021,31(11):27.[doi:10. 3969 / j. issn. 1673-629X. 2021. 02. 005]