District design for arc-routing applications
In this paper we address the problem of district design for the organisation of arc-routing activities. In particular, the focus is on operations like winter gritting and road maintenance. The problem involves how to allocate the road network edges to a set of depots with given locations. The collec...
Gespeichert in:
| Veröffentlicht in: | The Journal of the Operational Research Society 2003-11, Vol.54 (11), p.1209-1221 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1221 |
|---|---|
| container_issue | 11 |
| container_start_page | 1209 |
| container_title | The Journal of the Operational Research Society |
| container_volume | 54 |
| creator | Muyldermans, L Cattrysse, D Oudheusden, D Van |
| description | In this paper we address the problem of district design for the organisation of arc-routing activities. In particular, the focus is on operations like winter gritting and road maintenance. The problem involves how to allocate the road network edges to a set of depots with given locations. The collection of edges assigned to a facility forms a district in which routes have to be designed that start and end at the facility. Apart from the ability to support good arc routing, well-designed districts for road-maintenance operations should have the road network to be serviced connected and should define clear geographical boundaries. We present three districting heuristics and evaluate the quality of the partitions by solving capacitated arc routing problems in the districts, and by comparing the solution values with a multi-depot CARP cutting plane lower bound. Our experiments reveal that based on global information about the distribution system (ie the number of facilities or districts, the average edge demand and the vehicle capacity) and by using simple guidelines, an adequate districting policy may be selected. |
| doi_str_mv | 10.1057/palgrave.jors.2601626 |
| format | Article |
| fullrecord | <record><control><sourceid>jstor_infor</sourceid><recordid>TN_cdi_jstor_primary_4101777</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>4101777</jstor_id><sourcerecordid>4101777</sourcerecordid><originalsourceid>FETCH-LOGICAL-c552t-916757ce406423bc8b5674c35b6850f84dfc3b4d8f899af57d620600450ec3573</originalsourceid><addsrcrecordid>eNqFkU1r3DAYhEVoIdu0_6CBpdCc4u0r68u-NeSjLQR6ac9CK8uLFq_kvpIT8u-jxZss9NCeBJpnRsOIkHMKKwpCfRnNsEHz4FbbiGlVS6CylidkQbmSVcskvCGLcgeVkE19St6ltAWAFmi7IJc3PmX0Ni87l_wmLPuIS4O2wjhlHzZLM46Dtyb7GNJ78rY3Q3IfDucZ-X13--v6e3X_89uP66v7ygpR56qlUgllHQfJa7a2zVpIxS0Ta9kI6Bve9Zatedf0TduaXqhO1iABuABXKMXOyMWcO2L8M7mU9c4n64bBBBenpFkjJBNAC_jpL3AbJwylm64ZZW2rBC-QmCGLMSV0vR7R7ww-aQp6P6B-GVDvB9SHAYvv8yHcJGuGHk2wPh3NoobSf8_JmUtFChuHxxL_e-B8NgaTJ3SvyUf946xvU474KnMKVKn9Sl9n2YfyaTvzGHHodDZPQ8SXsuzfDZ4BAz-vUg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>231399754</pqid></control><display><type>article</type><title>District design for arc-routing applications</title><source>Jstor Complete Legacy</source><creator>Muyldermans, L ; Cattrysse, D ; Oudheusden, D Van</creator><creatorcontrib>Muyldermans, L ; Cattrysse, D ; Oudheusden, D Van</creatorcontrib><description>In this paper we address the problem of district design for the organisation of arc-routing activities. In particular, the focus is on operations like winter gritting and road maintenance. The problem involves how to allocate the road network edges to a set of depots with given locations. The collection of edges assigned to a facility forms a district in which routes have to be designed that start and end at the facility. Apart from the ability to support good arc routing, well-designed districts for road-maintenance operations should have the road network to be serviced connected and should define clear geographical boundaries. We present three districting heuristics and evaluate the quality of the partitions by solving capacitated arc routing problems in the districts, and by comparing the solution values with a multi-depot CARP cutting plane lower bound. Our experiments reveal that based on global information about the distribution system (ie the number of facilities or districts, the average edge demand and the vehicle capacity) and by using simple guidelines, an adequate districting policy may be selected.</description><identifier>ISSN: 0160-5682</identifier><identifier>EISSN: 1476-9360</identifier><identifier>DOI: 10.1057/palgrave.jors.2601626</identifier><identifier>CODEN: JORSDZ</identifier><language>eng</language><publisher>London: Taylor & Francis</publisher><subject>Aggregation ; Applied sciences ; Business and Management ; capacitated arc routing ; Cost control ; Distribution costs ; districting ; Districts ; Exact sciences and technology ; Geography ; Heuristic ; Heuristics ; Industrial design ; Integers ; Inventory control, production control. Distribution ; Linear programming ; Maintenance management ; Management ; Mathematical methods ; Network analysis ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Operations Research/Decision Theory ; Organization theory ; Roads ; Roads & highways ; School districts ; Studies ; Theoretical Paper ; Theoretical Papers ; Truck routes ; Trucks ; Vehicle capacity ; Vehicles ; Vertices ; winter gritting ; Workloads</subject><ispartof>The Journal of the Operational Research Society, 2003-11, Vol.54 (11), p.1209-1221</ispartof><rights>Copyright © 2003, Palgrave Macmillan Ltd 2003</rights><rights>Copyright 2003 Operational Research Society Ltd</rights><rights>Palgrave Macmillan Ltd 2003</rights><rights>2003 INIST-CNRS</rights><rights>Copyright (c) 2003 Palgrave Macmillan Ltd</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c552t-916757ce406423bc8b5674c35b6850f84dfc3b4d8f899af57d620600450ec3573</citedby><cites>FETCH-LOGICAL-c552t-916757ce406423bc8b5674c35b6850f84dfc3b4d8f899af57d620600450ec3573</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/4101777$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://www.jstor.org/stable/4101777$$EHTML$$P50$$Gjstor$$H</linktohtml><link.rule.ids>314,778,782,801,27913,27914,58006,58239</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15208996$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Muyldermans, L</creatorcontrib><creatorcontrib>Cattrysse, D</creatorcontrib><creatorcontrib>Oudheusden, D Van</creatorcontrib><title>District design for arc-routing applications</title><title>The Journal of the Operational Research Society</title><addtitle>J Oper Res Soc</addtitle><description>In this paper we address the problem of district design for the organisation of arc-routing activities. In particular, the focus is on operations like winter gritting and road maintenance. The problem involves how to allocate the road network edges to a set of depots with given locations. The collection of edges assigned to a facility forms a district in which routes have to be designed that start and end at the facility. Apart from the ability to support good arc routing, well-designed districts for road-maintenance operations should have the road network to be serviced connected and should define clear geographical boundaries. We present three districting heuristics and evaluate the quality of the partitions by solving capacitated arc routing problems in the districts, and by comparing the solution values with a multi-depot CARP cutting plane lower bound. Our experiments reveal that based on global information about the distribution system (ie the number of facilities or districts, the average edge demand and the vehicle capacity) and by using simple guidelines, an adequate districting policy may be selected.</description><subject>Aggregation</subject><subject>Applied sciences</subject><subject>Business and Management</subject><subject>capacitated arc routing</subject><subject>Cost control</subject><subject>Distribution costs</subject><subject>districting</subject><subject>Districts</subject><subject>Exact sciences and technology</subject><subject>Geography</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Industrial design</subject><subject>Integers</subject><subject>Inventory control, production control. Distribution</subject><subject>Linear programming</subject><subject>Maintenance management</subject><subject>Management</subject><subject>Mathematical methods</subject><subject>Network analysis</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Organization theory</subject><subject>Roads</subject><subject>Roads & highways</subject><subject>School districts</subject><subject>Studies</subject><subject>Theoretical Paper</subject><subject>Theoretical Papers</subject><subject>Truck routes</subject><subject>Trucks</subject><subject>Vehicle capacity</subject><subject>Vehicles</subject><subject>Vertices</subject><subject>winter gritting</subject><subject>Workloads</subject><issn>0160-5682</issn><issn>1476-9360</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNqFkU1r3DAYhEVoIdu0_6CBpdCc4u0r68u-NeSjLQR6ac9CK8uLFq_kvpIT8u-jxZss9NCeBJpnRsOIkHMKKwpCfRnNsEHz4FbbiGlVS6CylidkQbmSVcskvCGLcgeVkE19St6ltAWAFmi7IJc3PmX0Ni87l_wmLPuIS4O2wjhlHzZLM46Dtyb7GNJ78rY3Q3IfDucZ-X13--v6e3X_89uP66v7ygpR56qlUgllHQfJa7a2zVpIxS0Ta9kI6Bve9Zatedf0TduaXqhO1iABuABXKMXOyMWcO2L8M7mU9c4n64bBBBenpFkjJBNAC_jpL3AbJwylm64ZZW2rBC-QmCGLMSV0vR7R7ww-aQp6P6B-GVDvB9SHAYvv8yHcJGuGHk2wPh3NoobSf8_JmUtFChuHxxL_e-B8NgaTJ3SvyUf946xvU474KnMKVKn9Sl9n2YfyaTvzGHHodDZPQ8SXsuzfDZ4BAz-vUg</recordid><startdate>20031101</startdate><enddate>20031101</enddate><creator>Muyldermans, L</creator><creator>Cattrysse, D</creator><creator>Oudheusden, D Van</creator><general>Taylor & Francis</general><general>Palgrave Macmillan Press</general><general>Palgrave Macmillan UK</general><general>Palgrave</general><general>Taylor & Francis Ltd</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7RQ</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88E</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L.0</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M2O</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>U9A</scope><scope>8BJ</scope><scope>FQK</scope><scope>JBE</scope></search><sort><creationdate>20031101</creationdate><title>District design for arc-routing applications</title><author>Muyldermans, L ; Cattrysse, D ; Oudheusden, D Van</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c552t-916757ce406423bc8b5674c35b6850f84dfc3b4d8f899af57d620600450ec3573</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Aggregation</topic><topic>Applied sciences</topic><topic>Business and Management</topic><topic>capacitated arc routing</topic><topic>Cost control</topic><topic>Distribution costs</topic><topic>districting</topic><topic>Districts</topic><topic>Exact sciences and technology</topic><topic>Geography</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Industrial design</topic><topic>Integers</topic><topic>Inventory control, production control. Distribution</topic><topic>Linear programming</topic><topic>Maintenance management</topic><topic>Management</topic><topic>Mathematical methods</topic><topic>Network analysis</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Organization theory</topic><topic>Roads</topic><topic>Roads & highways</topic><topic>School districts</topic><topic>Studies</topic><topic>Theoretical Paper</topic><topic>Theoretical Papers</topic><topic>Truck routes</topic><topic>Trucks</topic><topic>Vehicle capacity</topic><topic>Vehicles</topic><topic>Vertices</topic><topic>winter gritting</topic><topic>Workloads</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Muyldermans, L</creatorcontrib><creatorcontrib>Cattrysse, D</creatorcontrib><creatorcontrib>Oudheusden, D Van</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Career & Technical Education Database</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Medical Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Research Library</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>International Bibliography of the Social Sciences (IBSS)</collection><collection>International Bibliography of the Social Sciences</collection><collection>International Bibliography of the Social Sciences</collection><jtitle>The Journal of the Operational Research Society</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Muyldermans, L</au><au>Cattrysse, D</au><au>Oudheusden, D Van</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>District design for arc-routing applications</atitle><jtitle>The Journal of the Operational Research Society</jtitle><stitle>J Oper Res Soc</stitle><date>2003-11-01</date><risdate>2003</risdate><volume>54</volume><issue>11</issue><spage>1209</spage><epage>1221</epage><pages>1209-1221</pages><issn>0160-5682</issn><eissn>1476-9360</eissn><coden>JORSDZ</coden><abstract>In this paper we address the problem of district design for the organisation of arc-routing activities. In particular, the focus is on operations like winter gritting and road maintenance. The problem involves how to allocate the road network edges to a set of depots with given locations. The collection of edges assigned to a facility forms a district in which routes have to be designed that start and end at the facility. Apart from the ability to support good arc routing, well-designed districts for road-maintenance operations should have the road network to be serviced connected and should define clear geographical boundaries. We present three districting heuristics and evaluate the quality of the partitions by solving capacitated arc routing problems in the districts, and by comparing the solution values with a multi-depot CARP cutting plane lower bound. Our experiments reveal that based on global information about the distribution system (ie the number of facilities or districts, the average edge demand and the vehicle capacity) and by using simple guidelines, an adequate districting policy may be selected.</abstract><cop>London</cop><pub>Taylor & Francis</pub><doi>10.1057/palgrave.jors.2601626</doi><tpages>13</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0160-5682 |
| ispartof | The Journal of the Operational Research Society, 2003-11, Vol.54 (11), p.1209-1221 |
| issn | 0160-5682 1476-9360 |
| language | eng |
| recordid | cdi_jstor_primary_4101777 |
| source | Jstor Complete Legacy |
| subjects | Aggregation Applied sciences Business and Management capacitated arc routing Cost control Distribution costs districting Districts Exact sciences and technology Geography Heuristic Heuristics Industrial design Integers Inventory control, production control. Distribution Linear programming Maintenance management Management Mathematical methods Network analysis Operational research and scientific management Operational research. Management science Operations research Operations Research/Decision Theory Organization theory Roads Roads & highways School districts Studies Theoretical Paper Theoretical Papers Truck routes Trucks Vehicle capacity Vehicles Vertices winter gritting Workloads |
| title | District design for arc-routing applications |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T09%3A12%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_infor&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=District%20design%20for%20arc-routing%20applications&rft.jtitle=The%20Journal%20of%20the%20Operational%20Research%20Society&rft.au=Muyldermans,%20L&rft.date=2003-11-01&rft.volume=54&rft.issue=11&rft.spage=1209&rft.epage=1221&rft.pages=1209-1221&rft.issn=0160-5682&rft.eissn=1476-9360&rft.coden=JORSDZ&rft_id=info:doi/10.1057/palgrave.jors.2601626&rft_dat=%3Cjstor_infor%3E4101777%3C/jstor_infor%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=231399754&rft_id=info:pmid/&rft_jstor_id=4101777&rfr_iscdi=true |