{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T23:23:52Z","timestamp":1786145032178,"version":"3.56.0"},"reference-count":3,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,10,13]],"date-time":"2006-10-13T00:00:00Z","timestamp":1160697600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2007,6,25]]},"DOI":"10.1007\/s10288-006-0028-y","type":"journal-article","created":{"date-parts":[[2006,10,12]],"date-time":"2006-10-12T07:00:14Z","timestamp":1160636414000},"page":"165-168","source":"Crossref","is-referenced-by-count":4,"title":["Vehicle and personnel routing optimization in the service sector: application to water distribution and treatment"],"prefix":"10.1007","volume":"5","author":[{"given":"Fabien","family":"Tricoire","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,10,13]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44:216\u2013229","journal-title":"Networks"},{"key":"28_CR2","first-page":"297","volume":"37","author":"J Homberger","year":"1999","unstructured":"Homberger J, Gehring H (1999) Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR 37:297\u2013318","journal-title":"INFOR"},{"key":"28_CR3","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problem with time window constraints. Oper Res 35:254\u2013265","journal-title":"Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0028-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-006-0028-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-006-0028-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:54Z","timestamp":1559131974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-006-0028-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,13]]},"references-count":3,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,6,25]]}},"alternative-id":["28"],"URL":"https:\/\/doi.org\/10.1007\/s10288-006-0028-y","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,13]]}}}