Snow plow route optimization: A constraint programming approach

Many cities have to cope with annual snowfall, but are struggling to manage their snow plowing activities efficiently. Despite the fact that winter road maintenance has been a popular research subject for decades, very few papers propose scalable models that can incorporate side constraints encounte...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IISE transactions Jg. 53; H. 6; S. 685 - 703
Hauptverfasser: Kinable, Joris, van Hoeve, Willem-Jan, Smith, Stephen F.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Taylor & Francis 13.11.2020
Schlagworte:
arc routing
mathematical programming
vehicle routing
Winter road maintenance
ISSN:2472-5854, 2472-5862
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Many cities have to cope with annual snowfall, but are struggling to manage their snow plowing activities efficiently. Despite the fact that winter road maintenance has been a popular research subject for decades, very few papers propose scalable models that can incorporate side constraints encountered in real-life applications. In this work, we propose a Constraint Programming formulation for a Snow Plow Routing Problem (SPRP). The SPRP under consideration involves finding a set of vehicle routes to service a street network in a pre-defined service area, while accounting for various vehicle constraints and traffic restrictions. The fundamental mathematical problem underlying SPRP is the well-known Capacitated Arc Routing Problem (CARP). Common Mathematical Programming (MP) approaches for CARP are typically based on: (i) a graph transformation, thereby transforming CARP into an equivalent node routing problem, or (ii) a sparse network formulation. The CP formulation in this article is based on the former graph transformation. Using geospatial data from the city of Pittsburgh, we empirically show that our CP approach outperforms existing MP formulations for SPRP. For some of the larger instances, our CP model finds 26% shorter plowing schedules than alternative Integer Programming formulations. A test pilot held with actual vehicles proves the applicability of our approach in practice: our routes are 3-156% shorter than the routes the city of Pittsburgh generated with commercial routing software.
AbstractList Many cities have to cope with annual snowfall, but are struggling to manage their snow plowing activities efficiently. Despite the fact that winter road maintenance has been a popular research subject for decades, very few papers propose scalable models that can incorporate side constraints encountered in real-life applications. In this work, we propose a Constraint Programming formulation for a Snow Plow Routing Problem (SPRP). The SPRP under consideration involves finding a set of vehicle routes to service a street network in a pre-defined service area, while accounting for various vehicle constraints and traffic restrictions. The fundamental mathematical problem underlying SPRP is the well-known Capacitated Arc Routing Problem (CARP). Common Mathematical Programming (MP) approaches for CARP are typically based on: (i) a graph transformation, thereby transforming CARP into an equivalent node routing problem, or (ii) a sparse network formulation. The CP formulation in this article is based on the former graph transformation. Using geospatial data from the city of Pittsburgh, we empirically show that our CP approach outperforms existing MP formulations for SPRP. For some of the larger instances, our CP model finds 26% shorter plowing schedules than alternative Integer Programming formulations. A test pilot held with actual vehicles proves the applicability of our approach in practice: our routes are 3-156% shorter than the routes the city of Pittsburgh generated with commercial routing software.
Author Smith, Stephen F.
van Hoeve, Willem-Jan
Kinable, Joris
Author_xml – sequence: 1
  givenname: Joris
  orcidid: 0000-0002-1996-805X
  surname: Kinable
  fullname: Kinable, Joris
  organization: Robotics Institute, Carnegie Mellon University
– sequence: 2
  givenname: Willem-Jan
  orcidid: 0000-0002-0023-753X
  surname: van Hoeve
  fullname: van Hoeve, Willem-Jan
  organization: Tepper School of Business, Carnegie Mellon University
– sequence: 3
  givenname: Stephen F.
  surname: Smith
  fullname: Smith, Stephen F.
  organization: Robotics Institute, Carnegie Mellon University
BookMark eNqFkMtKw0AYhQepYK19BCEvkDqXzCW60CLeoOBCXQ9_JkkdSWbCZKTUpzex1YUL3fyXA-dw-I7RxHlXIXRK8IJghc9oJilXPFtQTAdJMSIJO0DTUU-5EnTyc_PsCM37_g1jTCTnWORTdPnk_CbpmmEE_x6rxHfRtvYDovXuPFkmxrs-BrAuJl3w6wBta906gW74wLyeoMMamr6a7_cMvdzePF_fp6vHu4fr5So1TPGYcmoqUuSc4pJlFdBSFKbOhMlAspwYKShjUpRFpbAQAoCQ0pQF4UJJUELmbIYudrkm-L4PVa2NjV8lx3KNJliPOPQ3Dj3i0Hscg5v_cnfBthC2__qudj7rah9a2PjQlDrCtvGhDuCM7TX7O-IT9T54rA
CitedBy_id crossref_primary_10_1061_JCRGEI_CRENG_721
crossref_primary_10_1287_trsc_2023_0024
crossref_primary_10_1016_j_tra_2023_103911
crossref_primary_10_1287_ijoc_2023_0128
crossref_primary_10_1111_itor_13620
crossref_primary_10_1139_cjce_2020_0262
crossref_primary_10_1287_inte_2023_0038
Cites_doi 10.1016/j.cor.2011.10.014
10.1023/B:JMMA.0000038618.37710.f8
10.1007/s10732-007-9050-2
10.1002/net.3230110308
10.1002/net.20091
10.1177/0361198118798295
10.1016/j.aap.2010.05.008
10.1287/trsc.1100.0352
10.1016/S1574-6526(06)80007-6
10.1287/opre.1120.1079
10.1287/trsc.2015.0660
10.1007/s10107-005-0644-x
10.1016/j.ejor.2007.06.002
10.1007/978-3-319-68496-3_12
10.1007/s10601-018-9281-x
10.1007/s12652-018-0717-3
10.1287/trsc.1070.0195
10.1016/j.cor.2011.08.014
10.1016/S0020-0190(00)00051-X
10.1007/978-1-4419-1644-0_3
10.1023/A:1020853410145
10.1287/trsc.35.4.425.10431
10.1007/978-3-319-33954-2_17
10.1287/opre.2017.1595
10.1145/3381449
10.1007/BF01442866
10.1007/978-1-4615-4495-1
10.1016/j.cor.2005.05.008
10.1016/S1574-6526(06)80010-6
10.1016/j.cor.2005.05.007
10.1007/s10107-011-0497-4
10.1016/j.cor.2004.07.006
10.1016/j.cor.2004.07.007
10.1007/978-0-387-77778-8_2
10.1139/cjce-2017-0185
10.1002/net.20347
10.1016/S1574-6526(06)80027-1
10.1007/s10951-014-0408-7
10.1287/trsc.2019.0900
10.1145/3207677.3277963
10.1016/j.cor.2008.09.008
10.1016/0305-0548(87)90065-7
10.1023/A:1018316919294
10.1287/ijoc.2014.0600
10.1007/978-1-4615-1479-4
10.1016/j.cor.2006.07.007
10.1002/net.3
10.1016/j.cor.2004.11.020
ContentType Journal Article
Copyright Copyright © 2020 The Author(s). Published with license by Taylor & Francis Group, LLC. 2020
Copyright_xml – notice: Copyright © 2020 The Author(s). Published with license by Taylor & Francis Group, LLC. 2020
DBID 0YH
AAYXX
CITATION
DOI 10.1080/24725854.2020.1831713
DatabaseName Taylor & Francis Open Access
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: 0YH
  name: Taylor & Francis Open Access
  url: https://www.tandfonline.com
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2472-5862
EndPage 703
ExternalDocumentID 10_1080_24725854_2020_1831713
1831713
Genre Research Article
GroupedDBID 0R~
0YH
30N
AAGDL
AAHIA
AAJMT
AAPUL
AAQRR
ABDBF
ABJNI
ABPAQ
ABXUL
ABXYU
ACGFS
ACIWK
ACTIO
ACUHS
ADGTB
ADMLS
AEISY
AEMOZ
AEOZL
AEPSL
AEYOC
AFRVT
AGDLA
AHQJS
AIJEM
AIYEW
AKOOK
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AQTUD
AWYRJ
BLEHA
CCCUG
DGEBU
DKSSO
EAP
EAS
EBR
EBS
EBU
EMK
EPL
EST
ESX
GEVLZ
H13
I-F
IPNFZ
KYCEM
LJTGL
M4Z
MK~
PQQKQ
RIG
RNANH
ROSJB
RTWRZ
SNACF
TDBHL
TEN
TFL
TFT
TFW
TH9
TTHFI
TUROJ
TUS
UT3
ZGOLN
AAYXX
CITATION
ID FETCH-LOGICAL-c385t-52ce1b9520d34ea2d6bcf46c4a7391c7623376dbe80666aa11dcdb15687a86793
IEDL.DBID TFW
ISICitedReferencesCount 11
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000591026900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2472-5854
IngestDate Sat Nov 29 06:20:26 EST 2025
Tue Nov 18 22:36:07 EST 2025
Mon Oct 20 23:49:59 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 6
Language English
License open-access: http://creativecommons.org/licenses/by-nc-nd/4.0/: This is an Open Access article distributed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives License (http://creativecommons.org/licenses/by-nc-nd/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original work is properly cited, and is not altered, transformed, or built upon in any way.
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c385t-52ce1b9520d34ea2d6bcf46c4a7391c7623376dbe80666aa11dcdb15687a86793
ORCID 0000-0002-1996-805X
0000-0002-0023-753X
OpenAccessLink https://www.tandfonline.com/doi/abs/10.1080/24725854.2020.1831713
PageCount 19
ParticipantIDs informaworld_taylorfrancis_310_1080_24725854_2020_1831713
crossref_citationtrail_10_1080_24725854_2020_1831713
crossref_primary_10_1080_24725854_2020_1831713
PublicationCentury 2000
PublicationDate 2020-11-13
PublicationDateYYYYMMDD 2020-11-13
PublicationDate_xml – month: 11
  year: 2020
  text: 2020-11-13
  day: 13
PublicationDecade 2020
PublicationTitle IISE transactions
PublicationYear 2020
Publisher Taylor & Francis
Publisher_xml – name: Taylor & Francis
References CIT0031
CIT0034
CIT0033
Belenguer J.M. (CIT0006) 2003; 30
Corberán A. (CIT0013) 2014
CIT0036
CIT0035
CIT0038
CIT0037
CIT0039
CIT0041
CIT0040
CIT0043
CIT0042
CIT0001
CIT0045
Laborie P. (CIT0030) 2008
CIT0044
CIT0003
CIT0002
CIT0046
CIT0005
CIT0049
CIT0004
Corberán A. (CIT0014) 2010; 56
CIT0048
CIT0007
CIT0009
CIT0008
CIT0050
CIT0051
CIT0010
CIT0054
CIT0053
CIT0056
CIT0011
CIT0055
CIT0058
Stringer S.M. (CIT0052) 2015
CIT0057
CIT0016
CIT0015
CIT0059
CIT0018
CIT0019
CIT0060
CIT0021
Laborie P. (CIT0032) 2009
CIT0020
CIT0023
CIT0022
Environmental Protection Agency (CIT0017) 1999
Régin J.-C. (CIT0047) 2011
CIT0025
CIT0024
CIT0027
CIT0026
CIT0029
Corberán A. (CIT0012) 2014
CIT0028
References_xml – ident: CIT0053
  doi: 10.1016/j.cor.2011.10.014
– ident: CIT0020
  doi: 10.1023/B:JMMA.0000038618.37710.f8
– ident: CIT0045
  doi: 10.1007/s10732-007-9050-2
– ident: CIT0022
  doi: 10.1002/net.3230110308
– ident: CIT0001
  doi: 10.1002/net.20091
– ident: CIT0008
  doi: 10.1177/0361198118798295
– ident: CIT0054
  doi: 10.1016/j.aap.2010.05.008
– ident: CIT0004
  doi: 10.1287/trsc.1100.0352
– ident: CIT0007
  doi: 10.1016/S1574-6526(06)80007-6
– ident: CIT0048
– ident: CIT0009
  doi: 10.1287/opre.1120.1079
– ident: CIT0015
  doi: 10.1287/trsc.2015.0660
– ident: CIT0018
  doi: 10.1007/s10107-005-0644-x
– ident: CIT0027
  doi: 10.1016/j.ejor.2007.06.002
– ident: CIT0023
  doi: 10.1007/978-3-319-68496-3_12
– volume: 30
  start-page: 705
  issue: 5
  year: 2003
  ident: CIT0006
  publication-title: A cutting plane algorithm for the capacitated arc routing problem. Computers & Operations Research
– ident: CIT0033
  doi: 10.1007/s10601-018-9281-x
– ident: CIT0057
  doi: 10.1007/s12652-018-0717-3
– ident: CIT0040
  doi: 10.1287/trsc.1070.0195
– ident: CIT0051
  doi: 10.1016/j.cor.2011.08.014
– volume-title: Arc Routing: Problems, Methods, and Applications
  year: 2014
  ident: CIT0012
– ident: CIT0019
  doi: 10.1016/S0020-0190(00)00051-X
– start-page: 63
  volume-title: Hybrid Optimization – The Ten Years of CPAIOR
  year: 2011
  ident: CIT0047
  doi: 10.1007/978-1-4419-1644-0_3
– start-page: 555
  year: 2008
  ident: CIT0030
  publication-title: Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, May 15–17, 2008,
– ident: CIT0058
  doi: 10.1023/A:1020853410145
– start-page: 183
  volume-title: Methods, and Applications, Society for Industrial
  year: 2014
  ident: CIT0013
– ident: CIT0025
  doi: 10.1287/trsc.35.4.425.10431
– ident: CIT0029
  doi: 10.1007/978-3-319-33954-2_17
– ident: CIT0056
  doi: 10.1287/opre.2017.1595
– ident: CIT0037
  doi: 10.1145/3381449
– ident: CIT0026
  doi: 10.1007/BF01442866
– volume-title: Technical report
  year: 2015
  ident: CIT0052
– ident: CIT0016
  doi: 10.1007/978-1-4615-4495-1
– ident: CIT0044
  doi: 10.1016/j.cor.2005.05.008
– ident: CIT0055
  doi: 10.1016/S1574-6526(06)80010-6
– ident: CIT0043
  doi: 10.1016/j.cor.2005.05.007
– ident: CIT0003
  doi: 10.1007/s10107-011-0497-4
– ident: CIT0041
  doi: 10.1016/j.cor.2004.07.006
– ident: CIT0042
  doi: 10.1016/j.cor.2004.07.007
– ident: CIT0050
  doi: 10.1016/j.cor.2011.08.014
– ident: CIT0059
  doi: 10.1007/978-0-387-77778-8_2
– ident: CIT0046
  doi: 10.1139/cjce-2017-0185
– volume: 56
  start-page: 50
  issue: 1
  year: 2010
  ident: CIT0014
  publication-title: Networks
  doi: 10.1002/net.20347
– ident: CIT0028
  doi: 10.1016/S1574-6526(06)80027-1
– ident: CIT0031
  doi: 10.1007/s10951-014-0408-7
– ident: CIT0039
  doi: 10.1287/trsc.2019.0900
– volume-title: Proceedings of the Twenty-Second International Florida Artificial Intelligence Research Society Conference, May 19–21, 2009, AAAI Press, FL, pp. 201–206
  year: 2009
  ident: CIT0032
– ident: CIT0060
  doi: 10.1145/3207677.3277963
– ident: CIT0035
  doi: 10.1016/j.cor.2008.09.008
– ident: CIT0038
  doi: 10.1016/0305-0548(87)90065-7
– ident: CIT0049
– ident: CIT0005
  doi: 10.1023/A:1018316919294
– ident: CIT0011
  doi: 10.1287/ijoc.2014.0600
– volume-title: Technical Report
  year: 1999
  ident: CIT0017
– ident: CIT0024
– ident: CIT0002
  doi: 10.1007/978-1-4615-1479-4
– ident: CIT0010
  doi: 10.1016/j.cor.2006.07.007
– ident: CIT0034
– ident: CIT0021
  doi: 10.1002/net.3
– ident: CIT0036
  doi: 10.1016/j.cor.2004.11.020
SSID ssj0001755069
Score 2.3459444
Snippet Many cities have to cope with annual snowfall, but are struggling to manage their snow plowing activities efficiently. Despite the fact that winter road...
SourceID crossref
informaworld
SourceType Enrichment Source
Index Database
Publisher
StartPage 685
SubjectTerms arc routing
mathematical programming
vehicle routing
Winter road maintenance
Title Snow plow route optimization: A constraint programming approach
URI https://www.tandfonline.com/doi/abs/10.1080/24725854.2020.1831713
Volume 53
WOSCitedRecordID wos000591026900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAWR
  databaseName: Taylor & Francis
  customDbUrl:
  eissn: 2472-5862
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001755069
  issn: 2472-5854
  databaseCode: TFW
  dateStart: 20170101
  isFulltext: true
  titleUrlDefault: https://www.tandfonline.com
  providerName: Taylor & Francis
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELagYoCBN6I8Kg-sgThOY4etQlQMqGIoUKbIsR0JqU2qNoW_z13iQDsAAyyREuks62LffWfffUfIRcgDK5TNPIPbLQQP6SndVR4zgW9jY-KousF_uheDgRyN4geXTTh3aZUYQ2c1UURlq3Fzq3TeZMRdBTAkoFw8EQngkwQXWPWtBdePPQyG_eevUxYBCLzqa4dCHko1ZTzfDbTioFboS5ccT3_nH6a8S7Yd6qS9epnskTWb75OtJS7CA0DtefFOp2N4zIpFaWkBxmTiqjSvaY9qRJLYUKKkLqlrAoK0ISU_JI_92-HNnee6K3iay24JEai2LI27gW94aFVgolRnYaRDJXjMNBhJDsbHpFZiiKMUY0abFMI9KRSy9PEj0sqL3B4TalK83hNWZr6CeC2TTGnAHYBeZGSFiNskbFSaaEc9jhMeJ8wxlDb6SVA_idNPm1x-ik1r7o3fBOLl_5WU1aFHVncoSfiPsid_kD0lm_iKJYqMn5FWOVvYc7Kh38rX-axD1v2Xu061Lj8AUUrang
linkProvider Taylor & Francis
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELYQIAEDb0R5emAN1HESO2wVoiqidCqoTJFjOxJSm1Qlhb_PXR6QDsAAS4ZEn2Vd7HvZ9x0hFx53rVA2cQxuNw8spKO0rxxm3LYNjQmD4gT_qS8GAzkahc1aGLxWiTF0UhJFFLoaNzcmo-srcVcujAluLqZEXHglwQZi49oVHztnw5puP_e-8iwCfPCisx2iHITVhTzfjbRgohYITBump7v1H5PeJpuV40k75UrZIUs23SUbDTrCPXDc0-ydTsfwmGXz3NIM9MmkKtS8ph2q0ZnEnhI5re51TQBIa17yffLYvR3e9JyqwYKjufRzCEK1ZXHou23DPatcE8Q68QLtKcFDpkFPctA_JrYSoxylGDPaxBDxSaGQqI8fkOU0S-0hoSbGEz5hZdJWELIlkikNrgc4MDKwQoQt4tUyjXTFPo4THkesIimt5ROhfKJKPi1y-QmblvQbvwHC5g-L8iLvkZRNSiL-I_boD9hzstYbPvSj_t3g_pis4yesWGT8hCzns7k9Jav6LX95nZ0Vy_MD1uHdmw
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELYQIAQDb0R5ZmAN1HEaO2wVEIGoqg4FukWO7UhIbVK1Kfx97hIH2gEYYMmQ6CzrYt99Z999R8iFzzzDpUldjdvNBw_pStWSLtVe04Rah0F5g__c4d2uGAzCns0mnNq0Soyh04ooorTVuLnHOq0z4q48GBJQLp6IePBKgAvEvrUrAJ0DjL_60cvXMQsHCF42tkMpF8XqOp7vRlrwUAv8pXOeJ9r6hzlvk00LO512tU52yJLJdsnGHBnhHsD2LH93xkN4TPJZYZwcrMnIlmleO21HIZTEjhKFY7O6RiDo1Kzk--Qpuuvf3Lu2vYKrmGgVEIIqQ5Ow5TU18430dJCo1A-ULzkLqQIrycD66MQIjHGkpFQrnUC8J7hEmj52QJazPDOHxNEJ3u9xI9KmhIAtFVQqAB4AX0RgOA8bxK9VGivLPY4THsbUUpTW-olRP7HVT4NcfoqNK_KN3wTC-f8VF-WpR1q1KInZj7JHf5A9J2u92yjuPHQfj8k6fsFyRcpOyHIxmZlTsqreitfp5KxcnB-OsNyI
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Snow+plow+route+optimization%3A+A+constraint+programming+approach&rft.jtitle=IISE+transactions&rft.au=Kinable%2C+Joris&rft.au=van+Hoeve%2C+Willem-Jan&rft.au=Smith%2C+Stephen+F.&rft.date=2020-11-13&rft.issn=2472-5854&rft.eissn=2472-5862&rft.volume=53&rft.issue=6&rft.spage=685&rft.epage=703&rft_id=info:doi/10.1080%2F24725854.2020.1831713&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_24725854_2020_1831713
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2472-5854&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2472-5854&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2472-5854&client=summon