{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:47:45Z","timestamp":1729630065293,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1109\/itsc.2014.6957786","type":"proceedings-article","created":{"date-parts":[[2014,11,26]],"date-time":"2014-11-26T10:15:59Z","timestamp":1416996959000},"page":"792-797","source":"Crossref","is-referenced-by-count":2,"title":["Monitoring of traffic networks using mobile sensors"],"prefix":"10.1109","author":[{"family":"Zhe Cong","sequence":"first","affiliation":[]},{"given":"Bart","family":"De Schutter","sequence":"additional","affiliation":[]},{"given":"Mernout","family":"Burger","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Babuska","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"74","article-title":"The arc oriented location routing problem","volume":"27","author":"levy","year":"1989","journal-title":"INFOR"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.3.399"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","article-title":"The multiple traveling salesman problem: an overview of formulations and solution procedures","volume":"34","author":"bektas","year":"2006","journal-title":"Omega"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2012.6315112"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/321043.321046"},{"article-title":"Operations Research: An Introduction","year":"1987","author":"taha","key":"ref15"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.10.5.647"},{"key":"ref3","first-page":"110","article-title":"Graphic programming using odd or even points","volume":"1","author":"kwan","year":"1962","journal-title":"Chinese Math"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1051\/ro\/1981150302331","article-title":"Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph","volume":"15","author":"miliotis","year":"1981","journal-title":"RAIRO Recherche Operationnelle Operations Research"},{"key":"ref5","article-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","volume":"3","author":"lawler","year":"1985"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.4.525"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.2.231"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2008.4732534"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2005.1520133"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230040106"}],"event":{"name":"2014 IEEE 17th International Conference on Intelligent Transportation Systems (ITSC)","start":{"date-parts":[[2014,10,8]]},"location":"Qingdao, China","end":{"date-parts":[[2014,10,11]]}},"container-title":["17th International IEEE Conference on Intelligent Transportation Systems (ITSC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6948869\/6957655\/06957786.pdf?arnumber=6957786","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T17:15:04Z","timestamp":1566062104000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6957786\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/itsc.2014.6957786","relation":{},"subject":[],"published":{"date-parts":[[2014,10]]}}}