Heuristics for the Profitable Close-Enough Arc Routing Problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Heuristics for the Profitable Close-Enough Arc Routing Problem

Published:2023-11 Issue: Volume:230 Page:120513
ISSN:0957-4174
Container-title:Expert Systems with Applications
language:en
Short-container-title:Expert Systems with Applications

Author:

Reula Miguel^ORCID,Martí Rafael^ORCID

Funder

European Regional Development Fund

European Commission

Government of Valencia Ministry of Innovation Universities Science and Society

Generalitat Valenciana

Ministerio de Ciencia e Innovación

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Science Applications,General Engineering

Reference36 articles.

1. The generalized arc routing problem;Aráoz;TOP,2017

2. A new branch-and-cut algorithm for the generalized directed rural postman problem;Ávila;Transportation Science,2016

3. Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem;Ávila;EURO Journal on Computational Optimization,2017

4. An integer-programming-based approach to the close-enough traveling salesman problem;Behdani;INFORMS Journal on Computing,2014

5. The min-max close-enough arc routing problem;Bianchessi;European Journal of Operational Research,2022

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. VNS with Path Relinking for the Profitable Close-Enough Arc Routing Problem;Lecture Notes in Computer Science;2024

2. Models and Algorithms for the Rural Postman Problem with Load-Dependent Costs;2024

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP