Arc Routing

Ángel Corberán is a Professor of Statistics and Operations Research at the Faculty of Mathematics of the University of Valencia. He started studying arc routing problems 35 years ago under the supervision of Professor Nicos Christofides of the Imperial College. He has published more than 60 papers in combinatorial optimization and is coordinating editor of Computational Optimization and Applications and a member of the editorial board of Computers and Operations Research, the EURO Journal on Transportation and Logistics, and the EURO Journal on Computational Optimization. His research interests concern the study and solution of combinatorial optimization problems, mainly in the routing and location areas. Gilbert Laporte is Professor of Operations Research at HEC Montréal and holds the Canada Research Chair in Distribution Management. He has been editor of Transportation Science, Computers and Operations Research, and INFOR. He has authored or coauthored fifteen books and more than 450 scientific articles in combinatorial optimization, mostly in the areas of vehicle routing, location, and timetabling. He has received many scientific awards, including the Pergamon Prize in 1987, the 1994 Merit Award of the Canadian Operational Research Society, and the CORS Practice Prize on three occasions. He has been a member of the Royal Society of Canada since 1998 and a Fellow of INFORMS since 2005. In 2009, he received the Robert M. Herman Lifetime Achievement Award in Transportation Science from the Transportation Science and Logistics Society of INFORMS. In 2014, he obtained the Lifetime Achievement in Location Analysis Award from the Section on Location Analysis of INFORMS.

• List of figuresList of tablesPrefaceChapter 1: A Historical Perspective on Arc RoutingPart I: Arc routing problems with a single vehicleChapter 2: The Complexity of Arc Routing ProblemsChapter 3: The undirected Chinese Postman ProblemChapter 4: The Chinese Postman Problem on Directed, Mixed, and Windy GraphsChapter 5: The Undirected Rural Postman ProblemChapter 6: The Rural Postman Problem on Directed, Mixed, and Windy GraphsPart II: Arc routing problems with several vehiclesChapter 7: The CARP: HeuristicsChapter 8: The CARP: Combinatorial Lower BoundsChapter 9: The Capacitated Arc Routing Problem: Exact AlgorithmsChapter 10: Variants of the Capacitated Arc Routing ProblemChapter 11: Arc Routing Problems with Min-Max ObjectivesChapter 12: Arc Routing Problems with ProfitsPart III: ApplicationsChapter 13: Route Optimization for Meter Reading and Salt SpreadingChapter 14: Advances in Vehicle Routing for Snow PlowingChapter 15: Routing in Waste CollectionChapter 16: Arc Routing Applications in Newspaper DeliveryIndex