.png){kind=icon}
返回
The synchronized arc and node routing problem: Application to road marking
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2013.01.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces the synchronized arc and node routing problem, inspired from a real application arising in road marking operations. In this setting, several capacitated vehicles are used to paint lines on the roads and a tank vehicle is used to replenish the painting vehicles. The aim of the problem is to determine the routes and schedules for the painting and replenishment vehicles so that the pavement marking is completed within the least possible time. This must be done in such a way that the routes of the painting and replenishment vehicles are synchronized. An adaptive large neighborhood heuristic is described and evaluated over a large set of artificial instances. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Arc routing
Node routing
Road maintenance
Synchronized routes
Adaptive large neighborhood search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏
An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows带时间窗的取货和送货问题的自适应大邻域搜索启发式
PREAI
分享收藏A reactive GRASP for a commercial territory design problem with multiple balancing requirements
PREAI
分享收藏分享收藏
查看更多内容