IDEAS home Printed from https://ideas.repec.org/a/eee/transa/v179y2024ics0965856423003312.html
   My bibliography  Save this article

Constraint-Based snowplow optimization model for winter maintenance operations

Author

Listed:
  • Nguyen, Phuong H.D.
  • Tran, Daniel

Abstract

In the annual winter route maintenance, transportation agencies often deploy multiple fleets of trucks for snow control and removal activities over a vast maintenance area which creates an operational problem in determining the optimal maintenance routes and fleet size. The objective of this paper is to develop a snowplow routing optimization model to enhance the efficiency of snow removal route planning. The routing optimization model was developed using vehicle routing problems, constraint-based programming, and geographic information system. The developed model was applied to optimize the snow removal route planning practice of a District in Kansas, United States, as a case study. The result of this study shows that the optimization model can help minimize the fleet size and increase the level of service for treating snow routes within the selected District. The results of this study are expected to assist transportation agencies in optimizing their snow route removal in winter maintenance operations.

Suggested Citation

  • Nguyen, Phuong H.D. & Tran, Daniel, 2024. "Constraint-Based snowplow optimization model for winter maintenance operations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 179(C).
    • Handle: RePEc:eee:transa:v:179:y:2024:i:c:s0965856423003312
    DOI: 10.1016/j.tra.2023.103911
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0965856423003312
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tra.2023.103911?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transa:v:179:y:2024:i:c:s0965856423003312. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/547/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.