{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T05:42:06Z","timestamp":1771047726797,"version":"3.50.1"},"reference-count":9,"publisher":"Informa UK Limited","issue":"7","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of the Operational Research Society"],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1057\/palgrave.jors.2601863","type":"journal-article","created":{"date-parts":[[2004,9,22]],"date-time":"2004-09-22T11:35:04Z","timestamp":1095852904000},"page":"763-775","source":"Crossref","is-referenced-by-count":19,"title":["Problem difficulty of real instances of convoy planning"],"prefix":"10.1080","volume":"56","author":[{"given":"A L","family":"Tuson","sequence":"first","affiliation":[{"name":"City University London UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S A","family":"Harrison","sequence":"additional","affiliation":[{"name":"Dstl, Malvern Technology Centre Great Malvern Worcestershire UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"CIT0003","first-page":"215","volume-title":"Modern Heuristic Search Methods","author":"Lee YN","year":"1996"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.33.1.34"},{"key":"CIT0005","first-page":"56","volume":"31","author":"Chih K","year":"1990","journal-title":"J Transp Res Forum"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.1976.11731632"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1016\/S1366-5545(97)00022-7"},{"key":"CIT0008","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M","year":"1979"},{"key":"CIT0009","volume-title":"Sequential and parallel solutions of the convoy movement problem using branch\u2013and\u2013bound and heuristic hybrid techniques","author":"Lee YN","year":"1995"},{"key":"CIT0011","volume-title":"Empirical Methods for Artificial Intelligence","author":"Cohen PR","year":"1995"},{"key":"CIT0012","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja RK","year":"1993"}],"container-title":["Journal of the Operational Research Society"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1057\/palgrave.jors.2601863.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1057\/palgrave.jors.2601863\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1057\/palgrave.jors.2601863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1057\/palgrave.jors.2601863.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,16]],"date-time":"2018-02-16T15:54:57Z","timestamp":1518796497000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1057\/palgrave.jors.2601863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":9,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2017,12,21]]},"published-print":{"date-parts":[[2005,7]]}},"alternative-id":["10.1057\/palgrave.jors.2601863"],"URL":"https:\/\/doi.org\/10.1057\/palgrave.jors.2601863","relation":{},"ISSN":["0160-5682","1476-9360"],"issn-type":[{"value":"0160-5682","type":"print"},{"value":"1476-9360","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}