乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T00:41:05Z","timestamp":1743727265486,"version":"3.37.3"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100004586","name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Industrial Engineering"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1016\/j.cie.2020.106827","type":"journal-article","created":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T02:34:11Z","timestamp":1601951651000},"page":"106827","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Network sensor location problem with monitored lanes: Branch-and-cut and clustering search solution techniques"],"prefix":"10.1016","volume":"150","author":[{"given":"Victor Hugo Souza","family":"de Abreu","sequence":"first","affiliation":[]},{"given":"Pedro Henrique","family":"Gonz\u00e1lez","sequence":"additional","affiliation":[]},{"given":"Geraldo Regis","family":"Mauri","sequence":"additional","affiliation":[]},{"given":"Glaydston Mattos","family":"Ribeiro","sequence":"additional","affiliation":[]},{"given":"Romulo Dante","family":"Orrico","sequence":"additional","affiliation":[]},{"given":"Nilo Flavio Rosa","family":"Campos J\u00fanior","sequence":"additional","affiliation":[]},{"given":"Carlos Alberto","family":"Abramides","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"2014","series-title":"Network flows","author":"Ahuja","key":"10.1016\/j.cie.2020.106827_b0005"},{"key":"10.1016\/j.cie.2020.106827_b0010","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.asoc.2018.11.003","article-title":"Improving the clustering search heuristic: An application to cartographic labeling","volume":"77","author":"Ara\u00fajo","year":"2019","journal-title":"Applied Soft Computing"},{"key":"10.1016\/j.cie.2020.106827_b0015","article-title":"Lexicographic optimization-based clustering search metaheuristic for the multiobjective flexible job shop scheduling problem","author":"Bissoli","year":"2020","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.cie.2020.106827_b0020","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.trb.2014.06.015","article-title":"Non-planar hole-generated networks and link flow observability based on link counters","volume":"68","author":"Castillo","year":"2014","journal-title":"Transportation Research Part B: Methodological"},{"issue":"1","key":"10.1016\/j.cie.2020.106827_b0025","first-page":"68","article-title":"Observability of traffic networks: Optimal location of counting and scanning devices","volume":"1","author":"Castillo","year":"2013","journal-title":"Transportmetrica B: Transport Dynamics"},{"issue":"1","key":"10.1016\/j.cie.2020.106827_b0030","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1080\/18128600508685639","article-title":"A bi-objective traffic counting location problem for origin\u2013destination trip table estimation","volume":"1","author":"Chootinan","year":"2005","journal-title":"Transportmetrica"},{"key":"10.1016\/j.cie.2020.106827_b0035","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.trc.2019.09.004","article-title":"Optimization of traffic count locations for estimation of travel demands with covariance between origin-destination flows","volume":"108","author":"Fu","year":"2019","journal-title":"Transportation Research Part C: Emerging Technologies"},{"year":"1999","series-title":"Traffic and highway engineering","author":"Garber","key":"10.1016\/j.cie.2020.106827_b0040"},{"key":"10.1016\/j.cie.2020.106827_b0045","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/j.trc.2012.01.004","article-title":"Locating sensors on traffic networks: Models, challenges and research opportunities","volume":"24","author":"Gentili","year":"2012","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"10.1016\/j.cie.2020.106827_b0050","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.eswa.2019.04.068","article-title":"New approaches for the traffic counting location problem","volume":"132","author":"Gonz\u00e1lez","year":"2019","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.cie.2020.106827_b0055","doi-asserted-by":"crossref","first-page":"1530","DOI":"10.1016\/j.cor.2011.09.002","article-title":"Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks","volume":"39","author":"Guney","year":"2011","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.cie.2020.106827_b0060","first-page":"147","article-title":"Error detecting and error correcting codes","volume":"29","author":"Hamming","year":"1950","journal-title":"Bell LabsTechnical Journal"},{"key":"10.1016\/j.cie.2020.106827_b0065","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.trb.2013.02.006","article-title":"A graphical approach to identify sensor locations for link flow inference","volume":"51","author":"He","year":"2013","journal-title":"Transportation Research Part B: Methodological"},{"issue":"8\u20139","key":"10.1016\/j.cie.2020.106827_b0070","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/j.trb.2009.02.008","article-title":"Identification of vehicle sensor locations for link-based network traffic applications","volume":"43","author":"Hu","year":"2009","journal-title":"Transportation Research Part B: Methodological"},{"issue":"2","key":"10.1016\/j.cie.2020.106827_b0075","doi-asserted-by":"crossref","first-page":"113","DOI":"10.3846\/16484142.2016.1258674","article-title":"The sensor location problem: Methodological approach and application","volume":"32","author":"Mitsakis","year":"2017","journal-title":"Transport"},{"key":"10.1016\/j.cie.2020.106827_b0080","series-title":"IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), Rio de Janeiro, Brazil, 2019","first-page":"542","article-title":"Parallel clustering search applied to capacitated centered clustering problem","author":"Morales","year":"2019"},{"issue":"6","key":"10.1016\/j.cie.2020.106827_b0085","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1016\/j.trb.2012.02.001","article-title":"Synergistic sensor location for segmento flow inference without path enumeration: A node-based approach","volume":"46","author":"Ng","year":"2012","journal-title":"Transportation Research Part B: Methodological"},{"issue":"1","key":"10.1016\/j.cie.2020.106827_b0090","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1590\/S0101-74382013000100007","article-title":"Clustering search","volume":"33","author":"Oliveira","year":"2013","journal-title":"Pesquisa Operacional"},{"key":"10.1016\/j.cie.2020.106827_b0095","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.cie.2016.09.006","article-title":"A mathematical model and a clustering search metaheuristic for planning the helicopter transportation of employees to the production platforms of oil and gas","volume":"101","author":"Rosa","year":"2016","journal-title":"Computers & Industrial Engineering"},{"issue":"5","key":"10.1016\/j.cie.2020.106827_b0100","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0191-2615(91)90028-H","article-title":"An analysis of the reliability of an origin\u2013destination trip matrix estimated from traffic counts","volume":"25","author":"Yang","year":"1991","journal-title":"Transportation Research Part B: Methodological"},{"issue":"3","key":"10.1016\/j.cie.2020.106827_b0105","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1016\/j.cor.2004.08.011","article-title":"Models and algorithms for the screen line-based traffic-counting location problems","volume":"33","author":"Yang","year":"2006","journal-title":"Computers and Operations Research"},{"issue":"2","key":"10.1016\/j.cie.2020.106827_b0110","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0191-2615(97)00016-7","article-title":"Optimal traffic counting locations for origin\u2013destination matrix estimation","volume":"32","author":"Yang","year":"1998","journal-title":"Transportation Research Part B: Methodological"},{"key":"10.1016\/j.cie.2020.106827_b0115","article-title":"Evaluation of count location selection methods for estimation of O-D matrices","volume":"376","author":"Yim","year":"1998","journal-title":"Journal of Transportation Engineering"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835220305301?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835220305301?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,1,26]],"date-time":"2021-01-26T23:16:09Z","timestamp":1611702969000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835220305301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":23,"alternative-id":["S0360835220305301"],"URL":"https:\/\/doi.org\/10.1016\/j.cie.2020.106827","relation":{},"ISSN":["0360-8352"],"issn-type":[{"type":"print","value":"0360-8352"}],"subject":[],"published":{"date-parts":[[2020,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Network sensor location problem with monitored lanes: Branch-and-cut and clustering search solution techniques","name":"articletitle","label":"Article Title"},{"value":"Computers & Industrial Engineering","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cie.2020.106827","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"106827"}}