An updated annotated bibliography on arc routing problems
Authors:
- MourãoMOMourão
- M. CândidaMCM. Cândida
- Leonor S. PintoLPLeonor S. Pinto
Abstract
The number of arc routing publications has increased significantly in the last decade. Such an increase justifies a second annotated bibliography, a sequel to Corberán and Prins (Networks 56 (2010), 50–69), discussing arc routing studies from 2010 onwards. These studies are grouped into three main sections: single vehicle problems, multiple vehicle problems and applications. Each main section catalogs problems according to their specifics. Section 2 is therefore composed of four subsections, namely: the Chinese Postman Problem, the Rural Postman Problem, the General Routing Problem (GRP) and Arc Routing Problems (ARPs) with profits. Section 3, devoted to the multiple vehicle case, begins with three subsections on the Capacitated Arc Routing Problem (CARP) and then delves into several variants of multiple ARPs, ending with GRPs and problems with profits. Section 4 is devoted to applications, including distribution and collection routes, outdoor activities, post‐disaster operations, road cleaning and marking. As new applications emerge and existing applications continue to be used and adapted, the future of arc routing research looks promising. © 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(3), 144–194 2017Keywords
Funding Information
- FEDER (UID/MULTI/00491/2013, UID/MAT/04561/2013, PTDC/MAT‐NAN/2196/2014)
This publication has 173 references indexed in Scilit:
- Efficient Algorithms for Eulerian Extension and Rural PostmanSIAM Journal on Discrete Mathematics, 2013
- A genetic local search algorithm for the multi-depot heterogeneous fleet capacitated arc routing problemFlexible Services and Manufacturing Journal, 2012
- Synchronized arc routing for snow plowing operationsComputers & Operations Research, 2012
- Multi-treatment capacitated arc routing of construction machinery in Taiwan's smooth road projectAutomation in Construction, 2012
- A branch-and-cut algorithm for the maximum benefit Chinese postman problemMathematical Programming, 2011
- Improved lower bounds and exact algorithm for the capacitated arc routing problemMathematical Programming, 2011
- The open capacitated arc routing problemComputers & Operations Research, 2011
- The mixed capacitated general routing problem with turn penaltiesExpert Systems with Applications, 2011
- A variable neighborhood descent heuristic for arc routing problems with time-dependent service costsComputers & Industrial Engineering, 2010
- Recent results on Arc Routing Problems: An annotated bibliographyNetworks, 2010