{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T12:10:09Z","timestamp":1743855009802,"version":"3.40.3"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100019923","name":"DEVCOM Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-21-2-0276"],"award-info":[{"award-number":["W911NF-21-2-0276"]}],"id":[{"id":"10.13039\/100019923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers, Environment and Urban Systems"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1016\/j.compenvurbsys.2024.102247","type":"journal-article","created":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T08:50:55Z","timestamp":1739436655000},"page":"102247","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Shortest covering paths and other covering walks: Refinements and prospects for subtour prevention"],"prefix":"10.1016","volume":"118","author":[{"given":"T.C.","family":"Matisziw","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.compenvurbsys.2024.102247_bb0005","series-title":"Recommended practice APTA SUDS-UD-RP-001-09","article-title":"Defining transit areas of influence","author":"American Public Transportation Association","year":"2009"},{"key":"10.1016\/j.compenvurbsys.2024.102247_bb0010","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1023\/A:1018923022243","article-title":"Models for multi-path covering-routing problems","volume":"82","author":"Boffey","year":"1998","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.compenvurbsys.2024.102247_bb0015","series-title":"Location covering models: History, applications and advancements","first-page":"229","article-title":"Coverage of network-based structures: Paths, tours and trees","author":"Church","year":"2018"},{"key":"10.1016\/j.compenvurbsys.2024.102247_bb0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.compenvurbsys.2019.101395","article-title":"TRANSMax II: Designing a flexible model for transit route optimization","volume":"79","author":"Church","year":"2020","journal-title":"Computers, Environment and Urban Systems"},{"issue":"4","key":"10.1016\/j.compenvurbsys.2024.102247_bb0025","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1287\/trsc.28.4.317","article-title":"Efficient algorithms for solving the shortest covering path problem","volume":"28","author":"Current","year":"1994","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.compenvurbsys.2024.102247_bb0030","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1111\/j.1467-9787.1984.tb01030.x","article-title":"The shortest covering path problem: An application of locational constraints to network design","volume":"24","author":"Current","year":"1984","journal-title":"Journal of Regional Science"},{"key":"10.1016\/j.compenvurbsys.2024.102247_bb0035","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0377-2217(85)90030-X","article-title":"The maximal covering\/shortest path problem: A multiobjective network design and routing formulation","volume":"21","author":"Current","year":"1985","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.compenvurbsys.2024.102247_bb0040","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.21.3.188","article-title":"The median shortest path problem: A multiobjective approach to analyze cost vs. accessibility in the design of transportation networks","volume":"21","author":"Current","year":"1987","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.compenvurbsys.2024.102247_bb0045","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1111\/j.1540-5915.1988.tb00282.x","article-title":"The minimum-covering\/shortest-path problem","volume":"19","author":"Current","year":"1988","journal-title":"Decision Sciences"},{"issue":"3","key":"10.1016\/j.compenvurbsys.2024.102247_bb0050","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1287\/trsc.23.3.208","article-title":"The covering salesman problem","volume":"23","author":"Current","year":"1989","journal-title":"Transportation Science"},{"key":"10.1016\/j.compenvurbsys.2024.102247_bb0055","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/0377-2217(94)90149-X","article-title":"The median tour and maximal covering tour problems: Formulations and heuristics","volume":"73","author":"Current","year":"1994","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.compenvurbsys.2024.102247_bb0060","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.ejor.2010.07.026","article-title":"The transit route arc-node service maximization problem","volume":"208","author":"Curtin","year":"2011","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.compenvurbsys.2024.102247_bb0065","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","article-title":"Solution of a large-scale traveling-salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Journal of the Operations Research Society of America"},{"year":"2004","series-title":"Characteristics of bus rapid transit for decision-making","key":"10.1016\/j.compenvurbsys.2024.102247_bb0070"},{"year":"1978","series-title":"The traveling salesman problem and related problems (078\u201378)","author":"Gavish","key":"10.1016\/j.compenvurbsys.2024.102247_bb0075"},{"issue":"4","key":"10.1016\/j.compenvurbsys.2024.102247_bb0080","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.45.4.568","article-title":"The covering tour problem","volume":"45","author":"Gendreau","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/j.compenvurbsys.2024.102247_bb0085","series-title":"The traveling salesman problem: A guided tour of combinatorial optimization","first-page":"251","article-title":"Polyhedral theory","author":"Gr\u00f6tschel","year":"1985"},{"key":"10.1016\/j.compenvurbsys.2024.102247_bb0090","series-title":"Perspectives in Operations Research. Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/978-0-387-39934-8_16","article-title":"The close enough traveling salesman problem: A discussion of several heuristics","volume":"36","author":"Gulczynski","year":"2006"},{"issue":"10","key":"10.1016\/j.compenvurbsys.2024.102247_bb0095","doi-asserted-by":"crossref","first-page":"1979","DOI":"10.1080\/13658816.2012.674137","article-title":"Inferring network paths from point observations","volume":"26","author":"Matisziw","year":"2012","journal-title":"International Journal of Geographical Information Science"},{"issue":"2","key":"10.1016\/j.compenvurbsys.2024.102247_bb0100","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1016\/j.ejor.2004.09.029","article-title":"Strategic route extension in transit networks","volume":"171","author":"Matisziw","year":"2006","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.compenvurbsys.2024.102247_bb0105","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulation of traveling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"Journal of Association for Computing Machinery"},{"key":"10.1016\/j.compenvurbsys.2024.102247_bb0110","doi-asserted-by":"crossref","DOI":"10.1016\/j.compenvurbsys.2024.102155","article-title":"Optimization of urban greenway route using a coverage maximization model for lines","volume":"112","author":"Mu","year":"2024","journal-title":"Computers, Environment and Urban Systems"},{"issue":"1","key":"10.1016\/j.compenvurbsys.2024.102247_bb0115","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1177\/0160017614550082","article-title":"The shortest covering path problem: A new perspective and model","volume":"39","author":"Niblett","year":"2016","journal-title":"International Regional Science Review"},{"key":"10.1016\/j.compenvurbsys.2024.102247_bb0120","unstructured":"Rath, J. (1992). Safe routes - safe stops. Madison-Oneida Boces. https:\/\/www.p12.nysed.gov\/schoolbus\/documents\/pdf\/SafeRoutes_SafeStops.pdf."},{"year":"2019","series-title":"Planning considerations: Evacuation and shelter-in-place - guidance for state","author":"U.S. Department of Homeland Security","key":"10.1016\/j.compenvurbsys.2024.102247_bb0125"},{"year":"2013","series-title":"Sustainment brigade (ATP 4-93)","author":"US Department of the Army","key":"10.1016\/j.compenvurbsys.2024.102247_bb0130"},{"year":"2021","series-title":"Brigade support battalion (ATP 4\u201390, C1)","author":"US Department of the Army","key":"10.1016\/j.compenvurbsys.2024.102247_bb0135"},{"year":"2024","series-title":"Sustainment operations (FM 4\u20130)","author":"US Department of the Army","key":"10.1016\/j.compenvurbsys.2024.102247_bb0140"},{"issue":"5","key":"10.1016\/j.compenvurbsys.2024.102247_bb0145","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1111\/mice.12426","article-title":"Strategic network expansion of urban rapid transit systems: A bi-objective programming model","volume":"34","author":"Wei","year":"2019","journal-title":"Computer-Aided Civil and Infrastructure Engineering"}],"container-title":["Computers, Environment and Urban Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0198971524001765?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0198971524001765?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T11:32:32Z","timestamp":1743852752000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0198971524001765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":29,"alternative-id":["S0198971524001765"],"URL":"https:\/\/doi.org\/10.1016\/j.compenvurbsys.2024.102247","relation":{},"ISSN":["0198-9715"],"issn-type":[{"type":"print","value":"0198-9715"}],"subject":[],"published":{"date-parts":[[2025,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Shortest covering paths and other covering walks: Refinements and prospects for subtour prevention","name":"articletitle","label":"Article Title"},{"value":"Computers, Environment and Urban Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.compenvurbsys.2024.102247","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 The Author. Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"102247"}}