• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

针对随机路由学习具有不同表示形式的启发式方法。

Learning Heuristics With Different Representations for Stochastic Routing.

作者信息

Jia Ya-Hui, Mei Yi, Zhang Mengjie

出版信息

IEEE Trans Cybern. 2023 May;53(5):3205-3219. doi: 10.1109/TCYB.2022.3169210. Epub 2023 Apr 21.

DOI:10.1109/TCYB.2022.3169210
PMID:35533153
Abstract

Uncertainty is ubiquitous in real-world routing applications. The automated design of the routing policy by hyperheuristic methods is an effective technique to handle the uncertainty and to achieve online routing for dynamic or stochastic routing problems. Currently, the tree representation routing policy evolved by genetic programming is commonly adopted because of the remarkable flexibility. However, numeric representations have never been used. Considering the practicability of the numeric representations and the capability of the numeric optimization methods, in this article, we investigate two numeric representations on a representative stochastic routing problem and uncertain capacitated arc routing problem. Specifically, a linear representation and an artificial neural-network (ANN) representation are implemented and compared with the tree representation to reveal the potential of the numeric representations and the characteristics of their optimization. Experimental results show that the tree representation is the best choice, but on a majority of the test instances, the numeric representations, especially the ANN representation, can provide competitive performance. Further analyses also show that training a good ANN representation policy requires more training data than the tree representation. Finally, a guideline of representation selection is given.

摘要

不确定性在现实世界的路由应用中无处不在。通过超启发式方法自动设计路由策略是处理不确定性以及实现动态或随机路由问题在线路由的有效技术。目前,由于具有显著的灵活性,遗传编程演化出的树形表示路由策略被广泛采用。然而,数值表示从未被使用过。考虑到数值表示的实用性和数值优化方法的能力,在本文中,我们针对一个具有代表性的随机路由问题和不确定容量弧路由问题研究了两种数值表示。具体而言,实现了线性表示和人工神经网络(ANN)表示,并将其与树形表示进行比较,以揭示数值表示的潜力及其优化特性。实验结果表明,树形表示是最佳选择,但在大多数测试实例上,数值表示,尤其是ANN表示,可以提供具有竞争力的性能。进一步分析还表明,训练一个良好的ANN表示策略比树形表示需要更多的训练数据。最后,给出了表示选择的指导原则。

相似文献

1
Learning Heuristics With Different Representations for Stochastic Routing.针对随机路由学习具有不同表示形式的启发式方法。
IEEE Trans Cybern. 2023 May;53(5):3205-3219. doi: 10.1109/TCYB.2022.3169210. Epub 2023 Apr 21.
2
Genetic Programming Hyper-Heuristics with Vehicle Collaboration for Uncertain Capacitated Arc Routing Problems.遗传编程超启发式算法与车辆协作求解不确定容量弧路由问题。
Evol Comput. 2020 Winter;28(4):563-593. doi: 10.1162/evco_a_00267. Epub 2019 Nov 15.
3
A Predictive-Reactive Approach with Genetic Programming and Cooperative Coevolution for the Uncertain Capacitated Arc Routing Problem.基于遗传编程和协同进化的不确定带容量约束弧路由问题的预测-反应式方法。
Evol Comput. 2020 Summer;28(2):289-316. doi: 10.1162/evco_a_00256. Epub 2019 Apr 23.
4
Hyper-heuristic Evolution of Dispatching Rules: A Comparison of Rule Representations.启发式规则的超启发式进化:规则表示方法的比较。
Evol Comput. 2015 Summer;23(2):249-77. doi: 10.1162/EVCO_a_00131. Epub 2014 Nov 24.
5
A multiobjective model for the green capacitated location-routing problem considering drivers' satisfaction and time window with uncertain demand.考虑驾驶员满意度和不确定需求的时间窗的绿色有能力的定位-路径问题的多目标模型。
Environ Sci Pollut Res Int. 2022 Jan;29(4):5052-5071. doi: 10.1007/s11356-021-15907-x. Epub 2021 Aug 20.
6
Learning Improvement Heuristics for Solving Routing Problems.用于解决路由问题的学习改进启发式算法
IEEE Trans Neural Netw Learn Syst. 2022 Sep;33(9):5057-5069. doi: 10.1109/TNNLS.2021.3068828. Epub 2022 Aug 31.
7
A Hybrid Ant Colony Optimization Algorithm for the Extended Capacitated Arc Routing Problem.一种用于扩展容量弧路由问题的混合蚁群优化算法
IEEE Trans Syst Man Cybern B Cybern. 2011 Aug;41(4):1110-23. doi: 10.1109/TSMCB.2011.2107899. Epub 2011 Feb 14.
8
Benchmark dataset for undirected and Mixed Capacitated Arc Routing Problems under Time restrictions with Intermediate Facilities.具有中间设施的时间限制下无向和混合容量弧路由问题的基准数据集
Data Brief. 2016 Jul 6;8:972-7. doi: 10.1016/j.dib.2016.06.067. eCollection 2016 Sep.
9
A global repair operator for capacitated arc routing problem.一种用于容量受限弧路由问题的全局修复算子。
IEEE Trans Syst Man Cybern B Cybern. 2009 Jun;39(3):723-34. doi: 10.1109/TSMCB.2008.2008906. Epub 2009 Feb 10.
10
A modified coronavirus herd immunity optimizer for capacitated vehicle routing problem.一种用于容量受限车辆路径问题的改进型冠状病毒群体免疫优化器。
J King Saud Univ Comput Inf Sci. 2022 Sep;34(8):4782-4795. doi: 10.1016/j.jksuci.2021.06.013. Epub 2021 Jun 24.