{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,8]],"date-time":"2024-11-08T22:40:08Z","timestamp":1731105608355,"version":"3.28.0"},"reference-count":23,"publisher":"American Dairy Science Association","issue":"5","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,1,14]],"date-time":"2019-01-14T00:00:00Z","timestamp":1547424000000},"content-version":"vor","delay-in-days":3545,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Dairy Science"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.3168\/jds.2008-1697","type":"journal-article","created":{"date-parts":[[2009,4,23]],"date-time":"2009-04-23T19:40:17Z","timestamp":1240515617000},"page":"2306-2316","source":"Crossref","is-referenced-by-count":1,"title":["Mathematical optimization to improve cows\u2019 artificial insemination services"],"prefix":"10.3168","volume":"92","author":[{"given":"B.","family":"Shneider","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Eben Chaime","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Gilad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Halachmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1747","reference":[{"key":"10.3168\/jds.2008-1697_bib1","first-page":"371","article-title":"A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions","volume":"13","author":"Chao","year":"1993","journal-title":"Am. J. Math. Manage. Sci."},{"key":"10.3168\/jds.2008-1697_bib2","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0377-2217(95)00077-1","article-title":"Genetic algorithms and traveling salesman problems","volume":"93","author":"Chatterjee","year":"1996","journal-title":"Eur. J. Oper. Res."},{"key":"10.3168\/jds.2008-1697_bib23","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clark","year":"1964","journal-title":"Oper. Res."},{"key":"10.3168\/jds.2008-1697_bib3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","article-title":"A tabu search heuristic for periodic and multi-depot vehicle routing problem","volume":"30","author":"Cordeau","year":"1997","journal-title":"Networks"},{"key":"10.3168\/jds.2008-1697_bib4","doi-asserted-by":"crossref","first-page":"885","DOI":"10.3168\/jds.S0022-0302(92)77829-1","article-title":"Optimizing model: Insemination, replacement, seasonal production, and cash flow","volume":"75","author":"DeLorenzo","year":"1992","journal-title":"J. Dairy Sci."},{"year":"1979","series-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Garey","key":"10.3168\/jds.2008-1697_bib5"},{"key":"10.3168\/jds.2008-1697_bib6","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/0305-0483(76)90097-9","article-title":"Multi-terminal vehicle-dispatching algorithm","volume":"4","author":"Gillett","year":"1976","journal-title":"Omega"},{"key":"10.3168\/jds.2008-1697_bib7","doi-asserted-by":"crossref","first-page":"984","DOI":"10.1057\/palgrave.jors.2601426","article-title":"New assignment algorithms for the multi-depot vehicle routing problem","volume":"53","author":"Giosa","year":"2002","journal-title":"J. Oper. Res. Soc."},{"key":"10.3168\/jds.2008-1697_bib8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230070203","article-title":"Implementing vehicle routing algorithms","volume":"7","author":"Golden","year":"1977","journal-title":"Networks"},{"key":"10.3168\/jds.2008-1697_bib9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","article-title":"The traveling salesman problem: An overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"Eur. J. Oper. Res."},{"key":"10.3168\/jds.2008-1697_bib10","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","article-title":"The vehicle routing problem: An overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"Eur. J. Oper. Res."},{"key":"10.3168\/jds.2008-1697_bib11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/trsc.22.3.161","article-title":"Solving a family of multi-depot vehicle routing and location-routing problems","volume":"22","author":"Laporte","year":"1988","journal-title":"Transport. Sci."},{"year":"1990","series-title":"The traveling salesman problem","author":"Lawler","key":"10.3168\/jds.2008-1697_bib12"},{"key":"10.3168\/jds.2008-1697_bib13","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1002\/net.3230110211","article-title":"Complexity of vehicle routing and scheduling problems","volume":"11","author":"Lenstra","year":"1981","journal-title":"Networks"},{"key":"10.3168\/jds.2008-1697_bib14","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1109\/TASE.2005.853472","article-title":"Multi-depot vehicle routing problem: A one-stage approach","volume":"2","author":"Lim","year":"2005","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.3168\/jds.2008-1697_bib15","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.3168\/jds.S0022-0302(97)76035-1","article-title":"Predicting optimal time of insemination in cows that show visual signs of estrus by estimating onset of estrus with pedometers","volume":"80","author":"Maatje","year":"1997","journal-title":"J. Dairy Sci."},{"year":"2001","series-title":"Production and operations analysis","author":"Nahmias","key":"10.3168\/jds.2008-1697_bib16"},{"key":"10.3168\/jds.2008-1697_bib17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0377-2217(82)80011-8","article-title":"A modular algorithms for an extended vehicle scheduling problem","volume":"11","author":"Raft","year":"1982","journal-title":"Eur. J. Oper. Res."},{"key":"10.3168\/jds.2008-1697_bib18","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0305-0548(95)O0026-P","article-title":"A tabu search heuristic for the multi-depot vehicle routing problem","volume":"3","author":"Renaud","year":"1996","journal-title":"Comput. Oper. Res."},{"key":"10.3168\/jds.2008-1697_bib19","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1080\/07408178508975281","article-title":"Designing a production line to maximize profit","volume":"17","author":"Rosenblatt","year":"1985","journal-title":"IIE Trans."},{"key":"10.3168\/jds.2008-1697_bib20","series-title":"in Proc 15th Annual IEEE Symp. Switching and Automata Theory","first-page":"33","article-title":"Approximate algorithms for the traveling salesman problem","author":"Rosenkrantz","year":"1974"},{"key":"10.3168\/jds.2008-1697_bib21","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/trsc.3.3.192","article-title":"The multiple terminal delivery problem with probabilistic demands","volume":"3","author":"Tillman","year":"1969","journal-title":"Transport. Sci."},{"year":"2002","series-title":"The vehicle routing problem","author":"Toth","key":"10.3168\/jds.2008-1697_bib22"}],"container-title":["Journal of Dairy Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022030209705466?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022030209705466?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022030209705466","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,8]],"date-time":"2024-11-08T22:08:19Z","timestamp":1731103699000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022030209705466"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["S0022030209705466"],"URL":"https:\/\/doi.org\/10.3168\/jds.2008-1697","relation":{},"ISSN":["0022-0302"],"issn-type":[{"type":"print","value":"0022-0302"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}