Plowing with precedence: A variant of the windy postman problem

Authors:
Benjamin Dussault;Bruce Golden;Chris GroëR;Edward Wasil
Affiliations:
Department of Applied Mathematics and Statistics, and Scientific Computation, University of Maryland, College Park, MD 20742-4015, United States;Robert H. Smith School of Business, University of Maryland, College Park, MD 20742-4015, United States;Link Analytics, 224 S. Peters Road, Suite 206, Knoxville, TN 37923, United States;Kogod School of Business, American University, Washington, DC 20016, United States
Venue:
Computers and Operations Research
Year:
2013

Citing 6
Cited 0

On the windy postman problem on Eulerian graphs

Mathematical Programming: Series A and B
New insertion and postoptimization procedures for the traveling salesman problem

Operations Research
A GIS-Integrated Intelligent System for Optimization of Asset Management for Maintenance of Roads and Bridges

IEA/AIE '02 Proceedings of the 15th international conference on Industrial and engineering applications of artificial intelligence and expert systems: developments in applied artificial intelligence
A branch & cut algorithm for the windy general routing problem and special cases

Networks
A survey of models and algorithms for winter road maintenance. Part I: system design for spreading and plowing

Computers and Operations Research
A survey of models and algorithms for winter road maintenance. Part II: system design for snow disposal

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In winter, a common problem is to determine the route that a snowplow should take in order to minimize the distance traveled. We propose a variant of this arc routing problem that is motivated by the fact that deadhead travel over streets that have already been plowed is significantly faster than the time it takes to plow the street. This problem differs from most arc routing problems because the cost of traversing a street changes depending on the order of the streets on a route. We develop a method that generates near-optimal solutions to instances as large as 200 nodes.