{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T09:29:33Z","timestamp":1775035773566,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,5,29]],"date-time":"2014-05-29T00:00:00Z","timestamp":1401321600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s10479-014-1621-7","type":"journal-article","created":{"date-parts":[[2014,5,28]],"date-time":"2014-05-28T16:25:16Z","timestamp":1401294316000},"page":"329-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A location-routing problem in glass recycling"],"prefix":"10.1007","volume":"223","author":[{"given":"Fatih","family":"Rahim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Canan","family":"Sepil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,29]]},"reference":[{"key":"1621_CR1","unstructured":"Applegate, D., Bixby R. E., Chvatal, V., & Cook, W. (2006). Concorde TSP solver. http:\/\/www.tsp.gatech.edu\/concorde\/ ."},{"issue":"1","key":"1621_CR2","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D Applegate","year":"2003","unstructured":"Applegate, D., Cook, W., & Rohe, A. (2003). Chained Lin\u2013Kernighan for large traveling salesman problems. INFORMS Journal on Computing, 15(1), 82\u201392.","journal-title":"INFORMS Journal on Computing"},{"key":"1621_CR3","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/j.ijpe.2007.01.015","volume":"11","author":"N Aras","year":"2008","unstructured":"Aras, N., & Aksen, D. (2008). Locating collection centers for distance and incentive-dependent returns. International Journal of Production Economics, 11, 316\u2013333.","journal-title":"International Journal of Production Economics"},{"key":"1621_CR4","doi-asserted-by":"crossref","unstructured":"Aras, N., Aksen, D., & Tekin, T. (2010). Location and selective routing problem with pricing for the collection of used products. In 40th International Conference on Computers and Industrial Engineering (CIE), IEEE (pp. 1\u20136).","DOI":"10.1109\/ICCIE.2010.5668217"},{"issue":"2","key":"1621_CR5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0377-2217(98)00093-9","volume":"110","author":"AI Barros","year":"1998","unstructured":"Barros, A. I., Dekker, R., & Scholten, V. (1998). A two-level network for recycling sand: A case study. European Journal of Operational Research, 110(2), 199\u2013214.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1621_CR6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF02568604","volume":"4","author":"JE Beasley","year":"1996","unstructured":"Beasley, J. E., & Nascimento, E. M. (1996). The vehicle routing-allocation problem: A unifying framework. TOP, 4(1), 65\u201386.","journal-title":"TOP"},{"issue":"3","key":"1621_CR7","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C., & Roli, A. (2003). Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys (CSUR), 35(3), 268\u2013308.","journal-title":"ACM Computing Surveys (CSUR)"},{"issue":"1","key":"1621_CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01942293","volume":"32","author":"R Church","year":"1974","unstructured":"Church, R., & Velle, C. R. (1974). The maximal covering location problem. Papers in Regional Science, 32(1), 101\u2013118.","journal-title":"Papers in Regional Science"},{"issue":"3","key":"1621_CR9","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1287\/trsc.23.3.208","volume":"23","author":"JR Current","year":"1989","unstructured":"Current, J. R., & Schilling, D. A. (1989). The covering salesman problem. Transportation Science, 23(3), 208\u2013212.","journal-title":"Transportation Science"},{"issue":"2","key":"1621_CR10","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet, D., Dejax, P., & Gendreau, M. (2005). Traveling salesman problems with profits. Transportation Science, 39(2), 188\u2013205.","journal-title":"Transportation Science"},{"issue":"4","key":"1621_CR11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<263::AID-NET3>3.0.CO;2-Q","volume":"32","author":"M Gendreau","year":"1998","unstructured":"Gendreau, M., Laporte, G., & Semet, F. (1998). A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks, 32(4), 263\u2013273.","journal-title":"Networks"},{"issue":"4","key":"1621_CR12","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"P Hansen","year":"1997","unstructured":"Hansen, P., & Mladenovi\u0107, N. (1997). Variable neighborhood search for the p-median. Location Science, 5(4), 207\u2013226.","journal-title":"Location Science"},{"issue":"3","key":"1621_CR13","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., & Mladenovi\u0107, N. (2001). Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130(3), 449\u2013467.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1621_CR14","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/S0377-2217(02)00497-6","volume":"150","author":"V Jayaraman","year":"2003","unstructured":"Jayaraman, V., Patterson, R. A., & Rolland, E. (2003). The design of reverse distribution networks: Models and solution procedures. European Journal of Operational Research, 150(1), 128\u2013149.","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"1621_CR15","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1016\/S0305-0548(03)00105-9","volume":"31","author":"O Karasakal","year":"2004","unstructured":"Karasakal, O., & Karasakal, E. K. (2004). A maximal covering location model in the presence of partial coverage. Computers & Operations Research, 31(9), 1515\u20131526.","journal-title":"Computers & Operations Research"},{"key":"1621_CR16","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.ejor.2003.07.010","volume":"160","author":"M Labb\u00e9","year":"2005","unstructured":"Labb\u00e9, M., Laporte, G., Rodr\u00edguez-Mart\u00edn, I., & Salazar-Gonz\u00e1les, J. J. (2005). Locating median cycles in networks. European Journal of Operational Research, 160, 457\u2013470.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"1621_CR17","doi-asserted-by":"crossref","first-page":"855","DOI":"10.1016\/S0360-8352(99)00168-0","volume":"36","author":"D Louwers","year":"1999","unstructured":"Louwers, D., Kip, B. J., Peters, E., Souren, F., & Flapper, S. D. P. (1999). A facility location allocation model for reusing carpet materials. Computers & Industrial Engineering, 36(4), 855\u2013869.","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"1621_CR18","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation of traveling salesman problems. Journal of the ACM (JACM), 7(4), 326\u2013329.","journal-title":"Journal of the ACM (JACM)"},{"issue":"1","key":"1621_CR19","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.omega.2004.07.025","volume":"34","author":"H Min","year":"2006","unstructured":"Min, H., Jeung Ko, H., & Seong Ko, C. (2006). A genetic algorithm approach to developing the multi-echelon reverse logistics network for product returns. Omega, 34(1), 56\u201369.","journal-title":"Omega"},{"issue":"11","key":"1621_CR20","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11), 1097\u20131100.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"1621_CR21","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1002\/net.10081","volume":"42","author":"N Mladenovi\u0107","year":"2003","unstructured":"Mladenovi\u0107, N., Labb\u00e9, M., & Hansen, P. (2003). Solving the p-center problem with Tabu search and variable neighborhood search. Networks, 42(1), 48\u201364.","journal-title":"Networks"},{"key":"1621_CR22","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0377-2217(02)00831-7","volume":"151","author":"JA Moreno P\u00e9rez","year":"2003","unstructured":"Moreno P\u00e9rez, J. A., Moreno-Vega, J. M., & Rodr\u00edguez Mart\u00edn, I. (2003). Variable neighborhood tabu search and its application to the median cycle problem. European Journal of Operational Research, 151, 365\u2013378.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"1621_CR23","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","volume":"177","author":"G Nagy","year":"2007","unstructured":"Nagy, G., & Salhi, S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research, 177(2), 649\u2013672.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"1621_CR24","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1080\/07408170490458580","volume":"36","author":"MJ Realff","year":"2004","unstructured":"Realff, M. J., Ammons, J. C., & Newton, D. J. (2004). Robust reverse production system design for carpet recycling. IIE Transactions, 36(8), 767\u2013776.","journal-title":"IIE Transactions"},{"issue":"4","key":"1621_CR25","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G. (1991). TSPLIB\u2014A traveling salesman problem library. ORSA Journal on Computing, 3(4), 376\u2013384.","journal-title":"ORSA Journal on Computing"},{"issue":"3","key":"1621_CR26","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"DJ Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D. J., Stearns, R. E., & Lewis, P. M. (1977). An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing, 6(3), 563\u2013581.","journal-title":"SIAM Journal on Computing"},{"key":"1621_CR27","first-page":"25","volume":"1","author":"DA Schilling","year":"1993","unstructured":"Schilling, D. A., Jayaraman, V., & Barkhi, R. (1993). A review of covering problems in facility location. Location Science, 1, 25\u201355.","journal-title":"Location Science"},{"issue":"3","key":"1621_CR28","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0305-0483(73)90108-4","volume":"1","author":"CDT Watson-Gandy","year":"1973","unstructured":"Watson-Gandy, C. D. T., & Dohrn, P. J. (1973). Depot location with van salesmen\u2014A practical approach. Omega, 1(3), 321\u2013329.","journal-title":"Omega"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1621-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-014-1621-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1621-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:50Z","timestamp":1559138990000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-014-1621-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,29]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["1621"],"URL":"https:\/\/doi.org\/10.1007\/s10479-014-1621-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,29]]}}}