{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T09:55:57Z","timestamp":1760522157391},"reference-count":18,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"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":["Parallel Computing"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0167-8191(03)00044-9","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T02:21:32Z","timestamp":1052792492000},"page":"591-606","source":"Crossref","is-referenced-by-count":16,"title":["A parallel hybrid heuristic for the multicommodity capacitated location problem with balancing requirements"],"prefix":"10.1016","volume":"29","author":[{"given":"Bernard","family":"Gendron","sequence":"first","affiliation":[]},{"given":"Jean-Yves","family":"Potvin","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Soriano","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(03)00044-9_BIB1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0968-090X(97)00005-3","article-title":"A parallel tabu search heuristic for the vehicle routing problem with time windows","volume":"5","author":"Badeau","year":"1997","journal-title":"Transportation Research C"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02097809","article-title":"Models for multimode multicommodity location problems with interdepot balancing requirements","volume":"18","author":"Crainic","year":"1989","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB3","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1287\/trsc.27.2.90","article-title":"Dual-ascent procedures for multicommodity location\u2013allocation problems with balancing requirements","volume":"27","author":"Crainic","year":"1993","journal-title":"Transportation Science"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB4","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/0377-2217(93)90117-6","article-title":"A branch-and-bound method for multicommodity location with balancing requirements","volume":"65","author":"Crainic","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB5","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF02023001","article-title":"A tabu search procedure for multicommodity location\/allocation with balancing requirements","volume":"41","author":"Crainic","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB6","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0966-8349(95)00005-3","article-title":"A branch-and-bound algorithm for depot location and container fleet management","volume":"3","author":"Gendron","year":"1995","journal-title":"Location Science"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB7","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1016\/S0305-0548(96)00094-9","article-title":"A parallel branch-and-bound algorithm for multicommodity location with balancing requirements","volume":"24","author":"Gendron","year":"1997","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB8","unstructured":"B. Gendron, J.-Y. Potvin, P. Soriano, A Tabu Search with Slope Scaling for the Multicommodity Capacitated Location Problem with Balancing Requirements, Technical Report CRT-2001-37, Centre de Recherche sur les Transports, Montr\u00e9al, 2001"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB9","first-page":"255","article-title":"Tabu search with exact neighbor evaluation for multicommodity location with balancing requirements","volume":"37","author":"Gendron","year":"1999","journal-title":"INFOR"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB10","series-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","first-page":"433","article-title":"An introduction to variable neighborhood search","author":"Hansen","year":"1999"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB11","unstructured":"ILOG CPLEX 6.6, 1999"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB12","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(99)00004-8","article-title":"A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure","volume":"24","author":"Kim","year":"1999","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB13","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/(SICI)1097-0037(200005)35:3<216::AID-NET5>3.0.CO;2-E","article-title":"Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problem","volume":"35","author":"Kim","year":"2000","journal-title":"Networks"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB14","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1023\/A:1026502220076","article-title":"A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems","volume":"17","author":"Kim","year":"2000","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","article-title":"Probabilistic diversification and intensification in local search for vehicle routing","volume":"1","author":"Rochat","year":"1995","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB16","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0377-2217(95)00042-O","article-title":"The capacitated plant location problem","volume":"87","author":"Sridharan","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB17","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","article-title":"A tabu search heuristic for the vehicle routing problem with soft time windows","volume":"31","author":"Taillard","year":"1997","journal-title":"Transportation Science"},{"key":"10.1016\/S0167-8191(03)00044-9_BIB18","series-title":"Proceedings of the Third International Conference on Genetic Algorithms","first-page":"116","article-title":"The GENITOR algorithm: why rank-based allocation of reproductive trials is best","author":"Whitley","year":"1989"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000449?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000449?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T22:20:03Z","timestamp":1553379603000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819103000449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0167819103000449"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(03)00044-9","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}