Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.cor.2012.10.013 | Computers & OR |
Keywords | DocType | Volume |
common problem,arc routing problem,near-optimal solution,street change,deadhead travel,windy postman problem | Journal | 40 |
Issue | ISSN | Citations |
4 | 0305-0548 | 6 |
PageRank | References | Authors |
0.45 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benjamin Dussault | 1 | 14 | 1.99 |
| Bruce Golden | 2 | 63 | 4.62 |
| Chris Groër | 3 | 134 | 5.95 |
| Edward A. Wasil | 4 | 898 | 85.07 |