{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T02:44:06Z","timestamp":1648867446785},"reference-count":10,"publisher":"Informa UK Limited","issue":"1","license":[{"start":{"date-parts":[[2011,2,2]],"date-time":"2011-02-02T00:00:00Z","timestamp":1296604800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Insight"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1057\/ori.2010.13","type":"journal-article","created":{"date-parts":[[2011,2,2]],"date-time":"2011-02-02T11:00:33Z","timestamp":1296644433000},"page":"63-76","source":"Crossref","is-referenced-by-count":2,"title":["A comprehensive empirical analysis of 16 heuristics for the transportation problem"],"prefix":"10.1080","volume":"24","author":[{"given":"Nelya","family":"Storozhyshina","sequence":"first","affiliation":[]},{"given":"Farzad","family":"Pargar","sequence":"additional","affiliation":[]},{"given":"Francis J","family":"Vasko","sequence":"additional","affiliation":[]}],"member":"301","published-online":{"date-parts":[[2011,2,2]]},"reference":[{"key":"BFori201013_CR1","volume-title":"Linear Network Optimization Algorithms and Codes","author":"DP Bertsekas","year":"1991","unstructured":"Bertsekas, D.P. (1991) Linear Network Optimization Algorithms and Codes. Cambridge, MA: MIT Press."},{"key":"BFori201013_CR2","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1057\/jors.1991.158","volume":"42","author":"SK Goyal","year":"1991","unstructured":"Goyal, S.K. (1991) A note on a heuristic for obtaining an initial solution for the transportation problem. Journal of the Operational Research Society 42: 819\u2013821.","journal-title":"Journal of the Operational Research Society"},{"key":"BFori201013_CR3","volume-title":"Introduction to Operations Research","author":"FS Hillier","year":"2010","unstructured":"Hillier, F.S. and Lieberman, G.J. (2010) Introduction to Operations Research, 9th edn. New York: McGraw-Hill."},{"key":"BFori201013_CR4","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1057\/jors.1990.124","volume":"41","author":"O Kirca","year":"1990","unstructured":"Kirca, O. and Satir, A. (1990) A heuristic for obtaining an initial solution for the transportation problem. Journal of the Operational Research Society 41: 865\u2013871.","journal-title":"Journal of the Operational Research Society"},{"key":"BFori201013_CR5","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1142\/S0217595904000333","volume":"21","author":"M Mathirajan","year":"2004","unstructured":"Mathirajan, M. and Meenakshi, B. (2004) Experimental analysis of some variants of Vogel's approximation method. Asia-Pacific Journal of Operational Research 21: 447\u2013462.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"BFori201013_CR6","unstructured":"Pargar, F., Javadian, N. and Ganji, A.P. (2009) A Heuristic for Obtaining an Initial Solution for the Transportation Problem with Experimental Analysis, The 6th International Industrial Engineering Conference, Sharif University of Technology, Tehran, Iran."},{"key":"BFori201013_CR7","volume-title":"Mathematical Programming","author":"NV Reinfeld","year":"1958","unstructured":"Reinfeld, N.V. and Vogel, W.R. (1958) Mathematical Programming. Englewood Cliffs, NJ: Prentice-Hall."},{"key":"BFori201013_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1287\/opre.17.1.187","volume":"17","author":"EJ Russell","year":"1969","unstructured":"Russell, E.J. (1969) Extension of Dantzig's algorithm to finding an initial near-optimal basis for the transportation problem. Operations Research 17: 187\u2013191.","journal-title":"Operations Research"},{"key":"BFori201013_CR9","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/0360-8352(94)90015-9","volume":"26","author":"FJ Vasko","year":"1994","unstructured":"Vasko, F.J., Creggar, M.L., Stott, K.L. and Woodyatt, L.R. (1994) Optimal assignments of slabs to orders: An example of appropriate model formulation. Computers & Industrial Engineering 26: 797\u2013800.","journal-title":"Computers & Industrial Engineering"},{"key":"BFori201013_CR10","volume-title":"Operations Research: Applications and Algorithms","author":"WL Winston","year":"2004","unstructured":"Winston, W.L. (2004) Operations Research: Applications and Algorithms. Belmont, CA: Thomson."}],"container-title":["OR Insight"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1057\/ori.2010.13.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1057\/ori.2010.13\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1057\/ori.2010.13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1057\/ori.2010.13.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T08:42:57Z","timestamp":1563439377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1057\/ori.2010.13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,2]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["BFori201013"],"URL":"https:\/\/doi.org\/10.1057\/ori.2010.13","relation":{},"ISSN":["1759-0477"],"issn-type":[{"value":"1759-0477","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,2]]}}}