A time-dependent hierarchical Chinese postman problem
Author:
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research
Link
http://link.springer.com/content/pdf/10.1007/s10100-018-0598-8.pdf
Reference55 articles.
1. Albiach J, Sanchis J, Soler D (2008) An asymetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation. Eur J Oper Res 189:789–802
2. Alfa AS, Liu DQ (1988) Postman routing problem in a hierarchical network. Eng Optim 14:127–138
3. Arakaki RK, Usberti FL (2018) Hybrid genetic algorithm for the open capacitated arc routing problem. Comput Oper Res 90:221–231
4. Black D, Eglese R, Wøhlk S (2013) The time-dependent prize-collection arc routing problem. Comput Oper Res 40:526–535
5. Cabral EA, Gendreau M, Ghiani G, Laporte G (2004) Solving the hierarchical Chinese postman problem as a rural postman problem. Eur J Oper Res 155:44–50
Cited by 17 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Uncertain Chinese postman problem with budget constraint: a robust optimization approach;Soft Computing;2024-07-31
2. A hybrid approach for Capacitated Vehicle Routing Problem with Time Windows based on Conflict-Driven Clause Learning and Reinforcement Learning;2024 5th International Conference on Innovative Trends in Information Technology (ICITIIT);2024-03-15
3. Modeling and Solving the Time-Dependent in-Building Delivery Problem in Last-Mile Logistics;IEEE Access;2024
4. The new approaches for solving hierarchical Chinese postman problem with stochastic travel times;Journal of Intelligent & Fuzzy Systems;2023-05-04
5. Planning of takeoff/landing site location, dispatch route, and spraying route for a pesticide application helicopter;European Journal of Agronomy;2023-05
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3