Publication Cover
Transportation Letters
The International Journal of Transportation Research
Volume 7, 2015 - Issue 4
201
Views
12
CrossRef citations to date
0
Altmetric
Research Papers

A case study of snow plow routing using an adaptive large hood search metaheuristic

, &
Pages 201-209 | Received 31 Mar 2014, Accepted 15 Sep 2014, Published online: 09 Oct 2015

References

  • Dror M, Stern H and Trudeau P. 1987. Postman tour on a graph with precedence relation on arcs, Networks, 17, (3), 283–294.
  • Goode L and Nantung T. 1995. CASPER: the friendly, efficient snow routes planner, TR News, 181, 20–21.
  • Handa H, Chapman L and Xin Y. 2005. Dynamic salting route optimization using evolutionary computation, Proceedings of the 2005 IEEE Congress on Evolutionary Computation, 158–165.
  • Handa H, Chapman L and Xin Y. 2006. Robust solution of salting route optimisation using evolutionary algorithms, 2006 IEEE Congress on Evolutionary Computation, 3098–3105.
  • Haslam E and Wright JR. 1991. Application of routing technologies to rural snow and ice control, Transp. Res. Rec., 1304, 202–211.
  • Kandula P and Wright JR. 1997. Designing network partitions to improve maintenance routing, J. Infrastruct. Sys., 3, 160–168.
  • Laporte G, Musmanno R and Vocaturo F. 2010. An adaptive large neighborhood search heuristic for the capacitated arc-routing problem with stochastic demands, Transp. Sci., 44, (1), 125–135.
  • Minsk LD. 1998. Snow and ice control manual for transportation facilities, New York, McGraw-Hill.
  • Moss CR. 1997. A routing methodology for snowplows and cindering trucks, Penn DOT project 68-5, Pennsylvania Transportation and Traffic Safety Center, Pennsylvania State University.
  • Omer M. 2007. Efficient routing of snow removal vehicles. Masters Dissertation, College of Engineering and Mineral Resources, West Virginia University, Morgantown.
  • Perrier N, Langevin A and Campbell JF. 2007. A survey of models and algorithms for winter road maintenance Part IV: vehicle routing and fleet sizing for plowing and snow disposal, Comput. Oper. Res., 34, (1), 258–294.
  • Perrier N, Langevin A and Amaya C-A. 2008. Vehicle routing for urban snow plowing, Transp. Sci., 42, (1), 44–56.
  • Robinson JD, Ogawa LS and Frickenstein SG. 1990. The two-snowplow routing problem, UMAP J., 11, 251–259.
  • Ropke S and Pisinger D. 2006. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Transp. Sci., 40, (4), 455–472.
  • Salazar-Aguilar MA, Langevin A and Laporte G. 2011. An adaptive large neighborhood search heuristic for a snow plowing problem with synchronized routes, in Networks Optimization, Proc. 5th International Conf., INOC 2011 Hamburg, Germany, Lecture Notes in Computer Science, Vol. 6701, 406–411, Berlin Heidelberg, Springer.
  • Salazar-Aguilar MA, Langevin A and Laporte G. 2012. Synchronized arc routing for snow plowing operations, Comput. Oper. Res., 39, 1432–1440.
  • Tagmouti M, Gendreau M and Potvin J-Y. 2010. A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs, Comput. Ind. Eng., 59, (4), 954–963.
  • Tagmouti M, Gendreau M and Potvin J-Y. 2011. A dynamic capacitated arc routing problem with time-dependent service costs, Transp. Res. C Emerg. Technol., 19, 20–28.
  • Wang J-Y. 1997. Computer aided system for planning efficient routes, PhD dissertation, Purdue University, West Lafayette.
  • Wang J-Y and Wright JR. 1994. Interactive design of service routes, J. Transp. Eng., 120, (6), 897–913.
  • Wang Y, Kandula P and Wright JR. 1995. Evaluation of computer-generated routes for improved snow and ice control, Transp. Res. Rec., 1509, 15–21.
  • Wright JR. 1993. The computer aided system for planning efficient routes. Joint Highway Research Project Draft Final Report FHWA/IN/JHRP-93-8, Purdue University, West Lafayette, IN.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.