Resolving splits in location/allocation modeling: a heuristic procedure for transit center decisions
A heuristic procedure is developed to assign buses to transit centers (garages) in such a way that all the buses on a particular route are assigned to a single transit center. This research builds on an optimal mixed integer programming location/allocation model that splits the bus assignments when...
Gespeichert in:
| Veröffentlicht in: | Transportation research. Part E, Logistics and transportation review Logistics and transportation review, 2001-03, Vol.37 (1), p.71-83 |
|---|---|
| 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 | 83 |
|---|---|
| container_issue | 1 |
| container_start_page | 71 |
| container_title | Transportation research. Part E, Logistics and transportation review |
| container_volume | 37 |
| creator | Willoughby, Keith A Uyeno, Dean H |
| description | A heuristic procedure is developed to assign buses to transit centers (garages) in such a way that all the buses on a particular route are assigned to a single transit center. This research builds on an optimal mixed integer programming location/allocation model that splits the bus assignments when capacity limitations were reached at a transit center. The heuristic procedure adopts a two-step process: namely, assignment of all buses of a route to a unique transit center, then switching of routes to alternative transit centers to enforce capacity limitations. The procedure is shown to still provide cost savings over current locations and allocations for the Vancouver Regional Transit System (VRTS), Canada's largest urban transit network. |
| doi_str_mv | 10.1016/S1366-5545(00)00006-5 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_218593963</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1366554500000065</els_id><sourcerecordid>69046287</sourcerecordid><originalsourceid>FETCH-LOGICAL-c477t-86023951d9b972dae37ee18665b42e55d259f81e8ce86dfeaf91df608726d7723</originalsourceid><addsrcrecordid>eNqFkNtKJDEQhptFYdX1ERaCV3rRmsPk0N6IDJ5AWHDX6xCT6jXS02mTzIBvb82MemugUhX4_6rK1zS_GT1llKmzv0wo1Uo5k8eUnlA8-PrR7DGjTSt1N9vB-lPys9kv5QU1TEm-14QHKGlYxfE_KdMQayFxJEPyrsY0nrnhsySLFGBA2Tlx5BmWOZYaPZly8hCWGUifMqnZjSVW4mGskEkAHwt6y69mt3dDgcOPfNA8Xl_9m9-2939u7uaX962faV1boygXnWShe-o0Dw6EBmBGKfk04yBl4LLrDQPjwajQg-s7FnpFjeYqaM3FQXO07YtrvS6hVPuSlnnEkZYzIzvRKYEiuRX5nErJ0Nspx4XLb5ZRu-ZpNzztGpal1G54Wom-260vwwT-ywQAm2-DXVnhhMbrDYMjYEwRY50nDM2sEfa5LrDVxbYVIIxVhGyLjzAiyZjBVxtS_GaZd75fluM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>218593963</pqid></control><display><type>article</type><title>Resolving splits in location/allocation modeling: a heuristic procedure for transit center decisions</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><creator>Willoughby, Keith A ; Uyeno, Dean H</creator><creatorcontrib>Willoughby, Keith A ; Uyeno, Dean H</creatorcontrib><description>A heuristic procedure is developed to assign buses to transit centers (garages) in such a way that all the buses on a particular route are assigned to a single transit center. This research builds on an optimal mixed integer programming location/allocation model that splits the bus assignments when capacity limitations were reached at a transit center. The heuristic procedure adopts a two-step process: namely, assignment of all buses of a route to a unique transit center, then switching of routes to alternative transit centers to enforce capacity limitations. The procedure is shown to still provide cost savings over current locations and allocations for the Vancouver Regional Transit System (VRTS), Canada's largest urban transit network.</description><identifier>ISSN: 1366-5545</identifier><identifier>EISSN: 1878-5794</identifier><identifier>DOI: 10.1016/S1366-5545(00)00006-5</identifier><identifier>CODEN: TRERFW</identifier><language>eng</language><publisher>Exeter: Elsevier India Pvt Ltd</publisher><subject>Buses ; Decision making ; Heuristic ; Heuristic procedure ; Heuristic procedure Location modeling ; Integer programming ; Location modeling ; Mass transit ; Resource allocation ; Studies</subject><ispartof>Transportation research. Part E, Logistics and transportation review, 2001-03, Vol.37 (1), p.71-83</ispartof><rights>2000 Elsevier Science Ltd</rights><rights>Copyright Elsevier Sequoia S.A. Mar 2001</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c477t-86023951d9b972dae37ee18665b42e55d259f81e8ce86dfeaf91df608726d7723</citedby><cites>FETCH-LOGICAL-c477t-86023951d9b972dae37ee18665b42e55d259f81e8ce86dfeaf91df608726d7723</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S1366554500000065$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,3994,27903,27904,65309</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/eeetranse/v_3a37_3ay_3a2001_3ai_3a1_3ap_3a71-83.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Willoughby, Keith A</creatorcontrib><creatorcontrib>Uyeno, Dean H</creatorcontrib><title>Resolving splits in location/allocation modeling: a heuristic procedure for transit center decisions</title><title>Transportation research. Part E, Logistics and transportation review</title><description>A heuristic procedure is developed to assign buses to transit centers (garages) in such a way that all the buses on a particular route are assigned to a single transit center. This research builds on an optimal mixed integer programming location/allocation model that splits the bus assignments when capacity limitations were reached at a transit center. The heuristic procedure adopts a two-step process: namely, assignment of all buses of a route to a unique transit center, then switching of routes to alternative transit centers to enforce capacity limitations. The procedure is shown to still provide cost savings over current locations and allocations for the Vancouver Regional Transit System (VRTS), Canada's largest urban transit network.</description><subject>Buses</subject><subject>Decision making</subject><subject>Heuristic</subject><subject>Heuristic procedure</subject><subject>Heuristic procedure Location modeling</subject><subject>Integer programming</subject><subject>Location modeling</subject><subject>Mass transit</subject><subject>Resource allocation</subject><subject>Studies</subject><issn>1366-5545</issn><issn>1878-5794</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2001</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNqFkNtKJDEQhptFYdX1ERaCV3rRmsPk0N6IDJ5AWHDX6xCT6jXS02mTzIBvb82MemugUhX4_6rK1zS_GT1llKmzv0wo1Uo5k8eUnlA8-PrR7DGjTSt1N9vB-lPys9kv5QU1TEm-14QHKGlYxfE_KdMQayFxJEPyrsY0nrnhsySLFGBA2Tlx5BmWOZYaPZly8hCWGUifMqnZjSVW4mGskEkAHwt6y69mt3dDgcOPfNA8Xl_9m9-2939u7uaX962faV1boygXnWShe-o0Dw6EBmBGKfk04yBl4LLrDQPjwajQg-s7FnpFjeYqaM3FQXO07YtrvS6hVPuSlnnEkZYzIzvRKYEiuRX5nErJ0Nspx4XLb5ZRu-ZpNzztGpal1G54Wom-260vwwT-ywQAm2-DXVnhhMbrDYMjYEwRY50nDM2sEfa5LrDVxbYVIIxVhGyLjzAiyZjBVxtS_GaZd75fluM</recordid><startdate>20010301</startdate><enddate>20010301</enddate><creator>Willoughby, Keith A</creator><creator>Uyeno, Dean H</creator><general>Elsevier India Pvt Ltd</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FD</scope><scope>FR3</scope><scope>KR7</scope></search><sort><creationdate>20010301</creationdate><title>Resolving splits in location/allocation modeling: a heuristic procedure for transit center decisions</title><author>Willoughby, Keith A ; Uyeno, Dean H</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c477t-86023951d9b972dae37ee18665b42e55d259f81e8ce86dfeaf91df608726d7723</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Buses</topic><topic>Decision making</topic><topic>Heuristic</topic><topic>Heuristic procedure</topic><topic>Heuristic procedure Location modeling</topic><topic>Integer programming</topic><topic>Location modeling</topic><topic>Mass transit</topic><topic>Resource allocation</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Willoughby, Keith A</creatorcontrib><creatorcontrib>Uyeno, Dean H</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Civil Engineering Abstracts</collection><jtitle>Transportation research. Part E, Logistics and transportation review</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Willoughby, Keith A</au><au>Uyeno, Dean H</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Resolving splits in location/allocation modeling: a heuristic procedure for transit center decisions</atitle><jtitle>Transportation research. Part E, Logistics and transportation review</jtitle><date>2001-03-01</date><risdate>2001</risdate><volume>37</volume><issue>1</issue><spage>71</spage><epage>83</epage><pages>71-83</pages><issn>1366-5545</issn><eissn>1878-5794</eissn><coden>TRERFW</coden><abstract>A heuristic procedure is developed to assign buses to transit centers (garages) in such a way that all the buses on a particular route are assigned to a single transit center. This research builds on an optimal mixed integer programming location/allocation model that splits the bus assignments when capacity limitations were reached at a transit center. The heuristic procedure adopts a two-step process: namely, assignment of all buses of a route to a unique transit center, then switching of routes to alternative transit centers to enforce capacity limitations. The procedure is shown to still provide cost savings over current locations and allocations for the Vancouver Regional Transit System (VRTS), Canada's largest urban transit network.</abstract><cop>Exeter</cop><pub>Elsevier India Pvt Ltd</pub><doi>10.1016/S1366-5545(00)00006-5</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1366-5545 |
| ispartof | Transportation research. Part E, Logistics and transportation review, 2001-03, Vol.37 (1), p.71-83 |
| issn | 1366-5545 1878-5794 |
| language | eng |
| recordid | cdi_proquest_journals_218593963 |
| source | RePEc; Elsevier ScienceDirect Journals |
| subjects | Buses Decision making Heuristic Heuristic procedure Heuristic procedure Location modeling Integer programming Location modeling Mass transit Resource allocation Studies |
| title | Resolving splits in location/allocation modeling: a heuristic procedure for transit center decisions |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T23%3A45%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Resolving%20splits%20in%20location/allocation%20modeling:%20a%20heuristic%20procedure%20for%20transit%20center%20decisions&rft.jtitle=Transportation%20research.%20Part%20E,%20Logistics%20and%20transportation%20review&rft.au=Willoughby,%20Keith%20A&rft.date=2001-03-01&rft.volume=37&rft.issue=1&rft.spage=71&rft.epage=83&rft.pages=71-83&rft.issn=1366-5545&rft.eissn=1878-5794&rft.coden=TRERFW&rft_id=info:doi/10.1016/S1366-5545(00)00006-5&rft_dat=%3Cproquest_cross%3E69046287%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=218593963&rft_id=info:pmid/&rft_els_id=S1366554500000065&rfr_iscdi=true |