Arc routing problems: A review of the past, present, and future

被引:54
|
作者
Corberan, Angel [1 ]
Eglese, Richard [2 ]
Hasle, Geir [3 ]
Plana, Isaac [4 ]
Sanchis, Jose Maria [5 ]
机构
[1] Univ Valencia, Dept Estadist & Invest Operat, Valencia, Spain
[2] Univ Lancaster, Dept Management Sci, Lancaster, Lancs, England
[3] SINTEF Digital, Dept Math & Cybernet, Oslo, Norway
[4] Univ Valencia, Dept Matemat Econ & Empresa, Valencia, Spain
[5] Univ Politecn Valencia, Dept Matemat Aplicada, Valencia, Spain
关键词
applications; arc routing; future; history; state-of-the-art; vehicle routing; RURAL POSTMAN PROBLEM; WINTER ROAD MAINTENANCE; SENSOR-BASED COVERAGE; SYNCHRONIZED ARC; LOCAL SEARCH; MEMETIC ALGORITHM; BOUND ALGORITHM; PATH RELINKING; OR/MS RESEARCH; CUT ALGORITHM;
D O I
10.1002/net.21965
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Arc routing problems (ARPs) are defined and introduced. Following a brief history of developments in this area of research, different types of ARPs are described that are currently relevant for study. In addition, particular features of ARPs that are important from a theoretical or practical point of view are discussed. A section on applications describes some of the changes that have occurred from early applications of ARP models to the present day and points the way to emerging topics for study. A final section provides information on libraries and instance repositories for ARPs. The review concludes with some perspectives on future research developments and opportunities for emerging applications.
引用
收藏
页码:88 / 115
页数:28
相关论文
共 50 条