{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T22:06:49Z","timestamp":1769810809927,"version":"3.49.0"},"reference-count":17,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/0305-0548(90)90047-b","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"427-435","source":"Crossref","is-referenced-by-count":55,"title":["The location-routing problem: Considerations in physical distribution system design"],"prefix":"10.1016","volume":"17","author":[{"given":"Rajesh","family":"Srivastava","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.C.","family":"Benton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(90)90047-B_BIB1","series-title":"Strategic Physical Distribution Management","author":"Lambert","year":"1982"},{"key":"10.1016\/0305-0548(90)90047-B_BIB2","author":"Davis","year":"1975"},{"key":"10.1016\/0305-0548(90)90047-B_BIB3","series-title":"Logistics: Issues for the '80s","article-title":"A proposed computer model for strategic inventory deployment","author":"Ballou","year":"1982"},{"key":"10.1016\/0305-0548(90)90047-B_BIB4","series-title":"Distribution Management: Mathematical Modelling and Practical Analysis","author":"Eilon","year":"1971"},{"key":"10.1016\/0305-0548(90)90047-B_BIB5","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/net.3230110212","article-title":"Formulation and structure of more complex\/realistic routing and scheduling problems","volume":"11","author":"Schrage","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0305-0548(90)90047-B_BIB6","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1057\/jors.1968.74","article-title":"Cost functions in the location of depots for multiple-delivery journeys","volume":"19","author":"Webb","year":"1968","journal-title":"Opl Res. Q."},{"key":"10.1016\/0305-0548(90)90047-B_BIB7","article-title":"Algorithms for solving the location-routing problem","author":"Srivastava","year":"1986"},{"key":"10.1016\/0305-0548(90)90047-B_BIB8","article-title":"A unified warehouse location-routing analysis","author":"Perl","year":"1983"},{"key":"10.1016\/0305-0548(90)90047-B_BIB9","series-title":"Proceedings of National DSI Conference","article-title":"An algorithm for solving the location-routing problem","author":"Srivastava","year":"1986"},{"key":"10.1016\/0305-0548(90)90047-B_BIB10","series-title":"Scientific Management of Transport Systems","first-page":"194","article-title":"A survey of methods for solving combined location-routing problems","author":"Madsen","year":"1981"},{"key":"10.1016\/0305-0548(90)90047-B_BIB11","author":"LaLonde","year":"1976"},{"key":"10.1016\/0305-0548(90)90047-B_BIB12","article-title":"Evaluating an efficient heuristic for the multiple vehicle problem","author":"Benton","year":"1982"},{"key":"10.1016\/0305-0548(90)90047-B_BIB13","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":"Clarke","year":"1964","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(90)90047-B_BIB14","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/trsc.3.3.192","article-title":"The multiple terminal delivery problem with stochastic demands","volume":"3","author":"Tillman","year":"1969","journal-title":"Transport. Sci."},{"key":"10.1016\/0305-0548(90)90047-B_BIB15","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/mnsc.12.9.670","article-title":"Warehouse location under continuous economies of scale","volume":"12","author":"Feldman","year":"1966","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(90)90047-B_BIB16","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1287\/opre.11.6.972","article-title":"An algorithm for the travelling salesman problem","volume":"11","author":"Little","year":"1963","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(90)90047-B_BIB17","doi-asserted-by":"crossref","first-page":"B718","DOI":"10.1287\/mnsc.18.12.B718","article-title":"An efficient branch and bound algorithm for the warehouse location problem","volume":"18","author":"Khumawala","year":"1972","journal-title":"Mgmt Sci."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489090047B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489090047B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:20:37Z","timestamp":1552915237000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489090047B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["030505489090047B"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(90)90047-b","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}