{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T01:59:37Z","timestamp":1775008777775,"version":"3.50.1"},"reference-count":50,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1016\/s0377-2217(97)00284-1","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"441-456","source":"Crossref","is-referenced-by-count":133,"title":["A tabu search heuristic procedure for the fixed charge transportation problem"],"prefix":"10.1016","volume":"106","author":[{"given":"Minghe","family":"Sun","sequence":"first","affiliation":[]},{"given":"Jay E.","family":"Aronson","sequence":"additional","affiliation":[]},{"given":"Patrick G.","family":"McKeown","sequence":"additional","affiliation":[]},{"given":"Dennis","family":"Drinka","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00284-1_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02216922","article-title":"A survey of dynamic network flows","volume":"20","author":"Aronson","year":"1989","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1002\/nav.3800080104","article-title":"Fixed cost transportation problem","volume":"8","author":"Balinski","year":"1961","journal-title":"Naval Research Logistics Quarterly"},{"issue":"3","key":"10.1016\/S0377-2217(97)00284-1_BIB3","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1287\/opre.29.3.448","article-title":"A new optimization method for large scale fixed charge transportation problems","volume":"29","author":"Barr","year":"1981","journal-title":"Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(97)00284-1_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.24.1.1","article-title":"Design and implementation of large scale primal transshipment algorithms","volume":"24","author":"Bradley","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/nav.3800310115","article-title":"Some branch-and-bound procedures for fixed-cost transportation problems","volume":"31","author":"Cabot","year":"1984","journal-title":"Naval Research Logistics Quarterly"},{"issue":"7","key":"10.1016\/S0377-2217(97)00284-1_BIB6","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1287\/mnsc.32.7.856","article-title":"Improved penalties for fixed cost linear programs using lagrangean relaxation","volume":"32","author":"Cabot","year":"1986","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/S0377-2217(97)00284-1_BIB7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0898-1221(75)90010-3","article-title":"The fixed charge problem-1: A new heuristic","volume":"1","author":"Cooper","year":"1975","journal-title":"Computers and Mathematics with Applications"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01720782","article-title":"Tabu search techniques: A tutorial and an application to neural networks","volume":"11","author":"de Werra","year":"1989","journal-title":"OR Spectrum"},{"issue":"3","key":"10.1016\/S0377-2217(97)00284-1_BIB9","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/nav.3800130306","article-title":"Use of completely reduced matrices in solving transportation problems with fixed charges","volume":"13","author":"Dwyer","year":"1966","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB10","series-title":"Optimization Algorithms for Networks and Graphs","author":"Evans","year":"1992"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB11","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1002\/nav.3800260408","article-title":"The pure fixed charge transportation problem","volume":"26","author":"Fisk","year":"1979","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB12","article-title":"Candidate Strategies and Tabu Search","author":"Glover","year":"1989"},{"issue":"3","key":"10.1016\/S0377-2217(97)00284-1_BIB13","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search: Part 1","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"10.1016\/S0377-2217(97)00284-1_BIB14","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","article-title":"Tabu search: Part II","volume":"2","author":"Glover","year":"1990","journal-title":"ORSA Journal on Computing"},{"issue":"4","key":"10.1016\/S0377-2217(97)00284-1_BIB15","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/inte.20.4.74","article-title":"Tabu search: A tutorial","volume":"20","author":"Glover","year":"19906","journal-title":"Interfaces"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB16","series-title":"Solving zero-one mixed integer programming problems using tabu search","author":"Glover","year":"1993"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB17","series-title":"Tabu search fundamentals and uses","author":"Glover","year":"1994"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB18","series-title":"Mathematical Programming: State of the Art 1994","article-title":"Tabu search: Improved solution alternatives","author":"Glover","year":"1994"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB19","series-title":"Network Models in Optimization and Their Applications in Practice","author":"Glover","year":"1992"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB20","series-title":"Tabu Search","author":"Glover","year":"1997"},{"issue":"1\u20134","key":"10.1016\/S0377-2217(97)00284-1_BIB21","first-page":"3","article-title":"A user's guide to tabu search","volume":"41","author":"Glover","year":"1993","journal-title":"Annals of Operations Research"},{"issue":"6","key":"10.1016\/S0377-2217(97)00284-1_BIB22","doi-asserted-by":"crossref","first-page":"1529","DOI":"10.1287\/opre.19.6.1529","article-title":"Exact solution of the fixed-charge transportation problem","volume":"19","author":"Gray","year":"1971","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB23","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1002\/nav.3800150306","article-title":"The fixed charge problem","volume":"15","author":"Hirsch","year":"1968","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB24","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1080\/05695557608975073","article-title":"The fixed-charge transportation problem: A computational study with a branch-and-bound code","volume":"8","author":"Kennington","year":"1976","journal-title":"AIIE Transactions"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB25","series-title":"Algorithms for Network Programming","author":"Kennington","year":"1980"},{"issue":"10","key":"10.1016\/S0377-2217(97)00284-1_BIB26","doi-asserted-by":"crossref","first-page":"1116","DOI":"10.1287\/mnsc.22.10.1116","article-title":"A new branch-and-bound algorithm for the fixed charge transportation problem","volume":"22","author":"Kennington","year":"1976","journal-title":"Management Science"},{"issue":"5","key":"10.1016\/S0377-2217(97)00284-1_BIB27","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","article-title":"NETGEN - A program for generating large scale (Un)Capacitated assignment, transportation, and minimum cost flow network problems","volume":"20","author":"Klingman","year":"1974","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/S0377-2217(97)00284-1_BIB28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/nav.3800090102","article-title":"An approximate algorithm for the fixed-charge transportation problem","volume":"9","author":"Kuhn","year":"1961","journal-title":"Naval Research Logistics Quarterly"},{"issue":"5","key":"10.1016\/S0377-2217(97)00284-1_BIB29","doi-asserted-by":"crossref","first-page":"897","DOI":"10.1080\/00207177208932320","article-title":"On the fixed cost flow problem","volume":"16","author":"Malek-Zavarei","year":"1972","journal-title":"International Journal of Control"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB30","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1287\/opre.23.6.1183","article-title":"A vertex ranking procedure for solving the linear fixed charge problem","volume":"23","author":"McKeown","year":"1975","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB31","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1002\/nav.3800280409","article-title":"A branch-and-bound algorithm for solving fixed charge problems","volume":"28","author":"McKeown","year":"1981","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB32","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0305-0548(90)90023-Z","article-title":"A computational study of using preprocessing and stronger formulations to solve general fixed charge problems","volume":"17","author":"McKeown","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB33","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1002\/nav.3800270409","article-title":"An easy solution to a special class of fixed charge problems","volume":"25","author":"McKeown","year":"1980","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB34","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1287\/opre.16.2.268","article-title":"Solving the fixed charge problem by ranking the extreme points","volume":"16","author":"Murty","year":"1968","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB35","series-title":"Network Programming","author":"Murty","year":"1992"},{"issue":"9","key":"10.1016\/S0377-2217(97)00284-1_BIB36","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1287\/mnsc.36.9.1092","article-title":"A branch-andbound method for the fixed charge transportation problem","volume":"36","author":"Palekar","year":"1990","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB37","article-title":"A cutting plane method for the fixed cost problem","author":"Rousseau","year":"1973"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB38","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0377-2217(89)90229-4","article-title":"Use of penalties in the branch-and-bound procedure for the fixed charge transportation problem","volume":"43","author":"Schaffer","year":"1989","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0377-2217(97)00284-1_BIB39","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1002\/1520-6750(199004)37:2<327::AID-NAV3220370210>3.0.CO;2-U","article-title":"A relaxation decomposition algorithm for the fixed charge network problem","volume":"37","author":"Shetty","year":"1990","journal-title":"Naval Research Logistic Quarterly"},{"issue":"2","key":"10.1016\/S0377-2217(97)00284-1_BIB40","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/nav.3800170209","article-title":"The fixed charge problem","volume":"17","author":"Steinberg","year":"1970","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB41","series-title":"Designing a heuristic for the fixed-charge transportation problem","author":"Steinberg","year":"1977"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB42","series-title":"Presented at the ORSA\/TIMS Joint National Meeting","article-title":"Solving fixed charge transportation problems using tabu search","author":"Sun","year":"1992"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB43","series-title":"Proceedings of the Decision Sciences Institute 1995 Annual Meeting","first-page":"915","article-title":"Implementation data structures for a tabu search heuristic procedure for solving the fixed charge transportation problem","author":"Sun","year":"1995"},{"issue":"1\u20134","key":"10.1016\/S0377-2217(97)00284-1_BIB44","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF02023003","article-title":"Tabu search applied to the general fixed charge problem","volume":"41","author":"Sun","year":"1993","journal-title":"Annals of Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(97)00284-1_BIB45","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1287\/mnsc.22.5.587","article-title":"A heuristic adjacent extreme point algorithm for the fixed charge problem","volume":"22","author":"Walker","year":"1976","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB46","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/0377-2217(89)90441-4","article-title":"Solving the fixed charge problem with lagrangian relaxation and cost allocation heuristics","volume":"42","author":"Wright","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB47","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0377-2217(91)90084-9","article-title":"COLE: A new heuristic approach for solving the fixed charge problem \u2014 Computational results","volume":"52","author":"Wright","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00284-1_BIB48","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1287\/mnsc.13.1.105","article-title":"A deterministic multiperiod production scheduling model with backloggings","volume":"13","author":"Zangwill","year":"1966","journal-title":"Management Science"},{"issue":"7","key":"10.1016\/S0377-2217(97)00284-1_BIB49","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1287\/mnsc.14.7.429","article-title":"Minimum concave cost flows in certain networks","volume":"14","author":"Zangwill","year":"1968","journal-title":"Management Science"},{"issue":"9","key":"10.1016\/S0377-2217(97)00284-1_BIB50","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1287\/mnsc.15.9.506","article-title":"A backlogging model and a multi-echelon model of a dynamic economic lot size production system \u2014 A network approach","volume":"15","author":"Zangwill","year":"1969","journal-title":"Management Science"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002841?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002841?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T08:56:05Z","timestamp":1556096165000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797002841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":50,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0377221797002841"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00284-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}