{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T04:03:02Z","timestamp":1747713782843,"version":"3.40.5"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1023\/a:1009679511137","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"253-267","source":"Crossref","is-referenced-by-count":34,"title":["Tabu Search for a Network Loading Problem with Multiple Facilities"],"prefix":"10.1007","volume":"6","author":[{"given":"David","family":"Berger","sequence":"first","affiliation":[]},{"given":"Bernard","family":"Gendron","sequence":"additional","affiliation":[]},{"given":"Jean-Yves","family":"Potvin","sequence":"additional","affiliation":[]},{"given":"S.","family":"Raghavan","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Soriano","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"262136_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., T.L. Magnanti, and J.B. Orlin. (1993). Network Flows: Theory, Algorithms, and Applications. Englewood Cliffs, NJ: Prentice-Hall."},{"key":"262136_CR2","first-page":"101","volume-title":"Proceedings of the First Int. Conf. on Genetic Algorithms and their Applications","author":"J. Baker","year":"1985","unstructured":"Baker, J. (1985). \u201cAdaptive Selection Methods for Genetic Algorithms.\u201d In J.J. Grefenstette (ed.), Proceedings of the First Int. Conf. on Genetic Algorithms and their Applications. Hillsdale, NJ: Lawrence Erlbaum Associates, pp. 101-111."},{"key":"262136_CR3","unstructured":"Balakrishnan, A., T.L. Magnanti, and P. Mirchandani. (1998). \u201cNetwork Design.\u201d In M. Dell'Amico, F. Maffioli, and S. Martello (eds.), Annotated Bibliographies in Combinatorial Optimization. Wiley, pp. 311-334."},{"key":"262136_CR4","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1287\/opre.37.5.716","volume":"37","author":"A. Balakrishnan","year":"1989","unstructured":"Balakrishnan, A., T.L. Magnanti, and R.T. Wong. (1989). \u201cA Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design.\u201d Operations Research 37, 716-740.","journal-title":"Operations Research"},{"key":"262136_CR5","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1137\/S1052623494279134","volume":"6","author":"F. Barahona","year":"1996","unstructured":"Barahona, F. (1996). \u201cNetwork Design Using Cut Inequalities.\u201d SIAM J. on Optimization 6, 823-837.","journal-title":"SIAM J. on Optimization"},{"key":"262136_CR6","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1287\/ijoc.8.3.243","volume":"8","author":"D. Bienstock","year":"1996","unstructured":"Bienstock, D. and O. G\u00fcnl\u00fck. (1996). \u201cCapacitated Network Design-Polyhedral Structure and Computation.\u201d INFORMS J. on Computing 8, 243-259.","journal-title":"INFORMS J. on Computing"},{"key":"262136_CR7","unstructured":"Crainic, T.G., A. Frangioni, and B. Gendron. (1998). \u201cBundle-Based Relaxation Methods for Multicommodity Capacitated Fixed Charge Network Design Problems.\u201d Technical Report CRT-98-45, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al."},{"key":"262136_CR8","unstructured":"Crainic, T.G., M. Gendreau, and J.M. Farvolden. (1996). \u201cSimplex-Based Tabu Search for the Multicommodity Capacitated Fixed Charge Network Design Problem.\u201d Technical Report CRT-96-07, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al."},{"key":"262136_CR9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W. (1959). \u201cANote on Two Problems in Connection with Graphs.\u201d Numerische Mathematik 1, 269-271.","journal-title":"Numerische Mathematik"},{"key":"262136_CR10","doi-asserted-by":"crossref","unstructured":"Gavish, B. and I. Neuman. (1989). \u201cA System for Routing and Capacity Assignment in Computer Communication Networks.\u201d IEEE Trans. Commun., 360-366.","DOI":"10.1109\/26.20116"},{"key":"262136_CR11","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1287\/ijoc.2.3.236","volume":"2","author":"B. Gavish","year":"1990","unstructured":"Gavish, B. and A. Altinkemer. (1990). \u201cBackbone Network Design Tools with Economic Tradeoffs.\u201d ORSA J. on Computing 2, 236-252.","journal-title":"ORSA J. on Computing"},{"key":"262136_CR12","doi-asserted-by":"crossref","unstructured":"Gendron, B., T.G. Crainic, and A. Frangioni. (1998). \u201cMulticommodity Capacitated Network Design.\u201d In B. Sans\u00f3 and P. Soriano (eds.), Telecommunications Network Planning. Kluwer, pp. 1-19.","DOI":"10.1007\/978-1-4615-5087-7_1"},{"key":"262136_CR13","unstructured":"Gendron, B. and T.G. Crainic. (1996). \u201cBounding Procedures for Multicommodity Capacitated Network Design Problems.\u201d Technical Report CRT-96-06, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al."},{"key":"262136_CR14","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). \u201cTabu Search-Part I.\u201d ORSA J. on Computing 1, 190-206.","journal-title":"ORSA J. on Computing"},{"key":"262136_CR15","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990). \u201cTabu Search-Part II.\u201d ORSA J. on Computing 2, 4-32.","journal-title":"ORSA J. on Computing"},{"key":"262136_CR16","first-page":"1","volume-title":"Advances in Metaheuristics, Optimization and Stochastic Modeling Technologies","author":"F. Glover","year":"1997","unstructured":"Glover, F. (1997). \u201cTabu Search and Adaptive Memory Programming-Advances, Applications and Challenges.\u201d In R.S. Barr, R.V. Helgason, and J.L.Kennington (eds.), Advances in Metaheuristics, Optimization and Stochastic Modeling Technologies. Boston: Kluwer, pp. 1-75."},{"key":"262136_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F. and M. Laguna. (1997). Tabu Search. Boston: Kluwer."},{"key":"262136_CR18","doi-asserted-by":"crossref","unstructured":"Holmberg, K. and D. Yuan. (1996). \u201cA Lagrangean Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem.\u201d Research Report LiTH-MAT-R-1996-23, Dept. of Mathematics, Linkoping Institute of Technology.","DOI":"10.1007\/978-3-642-60744-8_15"},{"key":"262136_CR19","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/net.3230230205","volume":"23","author":"T.L. Magnanti","year":"1993","unstructured":"Magnanti, T.L. and P. Mirchandani. (1993). \u201cShortest Paths, Single Origin-Destination Network Design and Associated Polyhedra.\u201d Networks 23, 103-121.","journal-title":"Networks"},{"key":"262136_CR20","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01580612","volume":"60","author":"T.L. Magnanti","year":"1993","unstructured":"Magnanti, T.L., P. Mirchandani, and R. Vachani. (1993). \u201cThe Convex Hull of Two Core Capacitated Network Design Problems.\u201d Mathematical Programming 60, 233-250.","journal-title":"Mathematical Programming"},{"key":"262136_CR21","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/opre.43.1.142","volume":"43","author":"T.L. Magnanti","year":"1995","unstructured":"Magnanti, T.L., P. Mirchandani, and R. Vachani. (1995). \u201cModeling and Solving the Two-Facility Capacitated Network Loading Problem.\u201d Operations Research 43, 142-157.","journal-title":"Operations Research"},{"key":"262136_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","volume":"18","author":"T.L. Magnanti","year":"1984","unstructured":"Magnanti, T.L. and R.T. Wong. (1984). \u201cNetwork Design and Transportation Planning: Models and Algorithms.\u201d Transportation Science 18, 1-55.","journal-title":"Transportation Science"},{"key":"262136_CR23","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0377-2217(91)90093-B","volume":"53","author":"S.P. Miaou","year":"1991","unstructured":"Miaou, S.P. and S.M. Chin. (1991). \u201cComputing k-Shortest Path for Nuclear Spent Fuel Highway Transportation.\u201d European J. of Operational Research 53, 64-80.","journal-title":"European J. of Operational Research"},{"key":"262136_CR24","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","volume":"19","author":"M. Minoux","year":"1989","unstructured":"Minoux, M. (1989). \u201cNetwork Synthesis and Optimum Network Design Problems: Models, Solution Methods and Applications.\u201d Networks 19, 313-360.","journal-title":"Networks"},{"key":"262136_CR25","first-page":"202","volume":"35","author":"T. Ng","year":"1987","unstructured":"Ng, T. and D. Hoang. (1987). \u201cJoint Optimization of Capacity and Flow Assignment in a Packet-Switched Communication Network.\u201d IEEE Trans. Comput. 35, 202-209.","journal-title":"IEEE Trans. Comput."},{"key":"262136_CR26","volume-title":"A Heuristic for the IOF Routing Problem","author":"S. Raghavan","year":"1995","unstructured":"Raghavan, S. (1995). \u201cA Heuristic for the IOF Routing Problem.\u201dWorking Paper, US West Advanced Technologies, Boulder, CO."},{"key":"262136_CR27","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y. and \u00c9.D. Taillard. (1995). \u201cProbabilistic Diversification and Intensification in Local Search for Vehicle Routing.\u201d Journal of Heuristics 1, 147-167.","journal-title":"Journal of Heuristics"},{"key":"262136_CR28","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230090303","volume":"9","author":"D.R. Shier","year":"1979","unstructured":"Shier, D.R. (1979). \u201cOn Algorithms for Finding the k-Shortest Paths in a Network.\u201d Networks 9, 195-214.","journal-title":"Networks"},{"key":"262136_CR29","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"\u00c9.D. Taillard","year":"1993","unstructured":"Taillard, \u00c9.D. (1993). \u201cParallel Iterative Search Methods for Vehicle Routing Problems.\u201d Networks 23, 661-673.","journal-title":"Networks"},{"key":"262136_CR30","first-page":"116","volume-title":"Proceedings of the Third Int. Conf. on Genetic Algorithms","author":"D. Whitley","year":"1989","unstructured":"Whitley, D. (1989). \u201cThe GENITOR Algorithm: Why Rank-Based Allocation of Reproductive Trials is Best.\u201d In J.D. Schaffer (ed.), Proceedings of the Third Int. Conf. on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, pp. 116-121."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009679511137.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009679511137\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009679511137.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:51:16Z","timestamp":1747651876000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009679511137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["262136"],"URL":"https:\/\/doi.org\/10.1023\/a:1009679511137","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}