{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T03:48:45Z","timestamp":1759117725169,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,8,2]],"date-time":"2017-08-02T00:00:00Z","timestamp":1501632000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10489-017-0995-z","type":"journal-article","created":{"date-parts":[[2017,8,2]],"date-time":"2017-08-02T05:08:10Z","timestamp":1501650490000},"page":"771-790","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Discrete particle swarm optimization algorithms for two variants of the static data segment location problem"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2290-9114","authenticated-orcid":false,"given":"Goutam","family":"Sen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohan","family":"Krishnamoorthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,2]]},"reference":[{"issue":"3","key":"995_CR1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1287\/trsc.21.3.163","volume":"21","author":"RK Ahuja","year":"1987","unstructured":"Ahuja RK, Murty VVS (1987) Exact and heuristic algorithms for the optimum communication spanning tree problem. Transp Sci 21(3):163\u2013170. \n                        http:\/\/www.jstor.org\/stable\/25768270","journal-title":"Transp Sci"},{"issue":"5","key":"995_CR2","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1016\/j.cor.2008.04.003","volume":"36","author":"TJ Ai","year":"2009","unstructured":"Ai TJ, Kachitvichyanukul V (2009) A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Comput Oper Res 36(5):1693\u20131702. Selected papers presented at the Tenth International Symposium on Locational Decisions (ISOLDE X). \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054808000774","journal-title":"Comput Oper Res"},{"issue":"1","key":"995_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2007.06.008","volume":"190","author":"S Alumur","year":"2008","unstructured":"Alumur S, Kara BY (2008) Network hub location problems: The state of the art. Eur J Oper Res 190 (1):1\u201321","journal-title":"Eur J Oper Res"},{"issue":"6","key":"995_CR4","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.omega.2012.02.005","volume":"40","author":"SA Alumur","year":"2012","unstructured":"Alumur SA, Kara BY, Karasan OE (2012) Multimodal hub location and hub network design. Omega 40(6):927\u2013939. Special Issue on Forecasting in Management Science","journal-title":"Omega"},{"key":"995_CR5","doi-asserted-by":"crossref","unstructured":"Applegate D, Archer A, Gopalakrishnan V, Lee S, Ramakrishnan KK (2010) Optimal content placement for a large-scale vod system. In: Proceedings of the 6th International Conference. Co-NEXT \u201910. ACM, New York, NY, USA, pp 4:1\u20134:12","DOI":"10.1145\/1921168.1921174"},{"key":"995_CR6","doi-asserted-by":"crossref","unstructured":"Azimdoost B, Farhadi G, Abani N, Ito A (2015) Optimal in-network cache allocation and content placement. In: 2015 IEEE conference on computer communications workshops (INFOCOM WKSHPS), pp 263\u2013268","DOI":"10.1109\/INFCOMW.2015.7179395"},{"key":"995_CR7","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.cor.2014.05.012","volume":"65","author":"N Azizi","year":"2016","unstructured":"Azizi N, Chauhan S, Salhi S, Vidyarthi N (2016) The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques. Comput Oper Res 65:174\u2013188. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054814001415","journal-title":"Comput Oper Res"},{"key":"995_CR8","doi-asserted-by":"crossref","unstructured":"Bailey A, Ornbuki-Berrnan B, Asobiela S (2013) Discrete pso for the uncapacitated single allocation hub location problem. In: 2013 IEEE workshop on computational intelligence in production and logistics systems (CIPLS), pp 92\u201398","DOI":"10.1109\/CIPLS.2013.6595205"},{"key":"995_CR9","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/978-3-642-56082-8_12","volume-title":"Facility location: Applications and theory","author":"J Campbell","year":"2002","unstructured":"Campbell J, Ernst A, Krishnamoorthy M (2002) Hub location problems. In: Hamacher H, Drezner Z (eds) Facility location: Applications and theory. Springer, Berlin, pp 373\u2013408"},{"issue":"2","key":"995_CR10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1287\/trsc.1120.0410","volume":"46","author":"JF Campbell","year":"2012","unstructured":"Campbell JF, O\u2019Kelly ME (2012) Twenty-five years of hub location research. Transp Sci 46(2):153\u2013169","journal-title":"Transp Sci"},{"key":"995_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-39930-8_8","volume-title":"Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem","author":"M Clerc","year":"2004","unstructured":"Clerc M (2004) Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem. Springer Berlin Heidelberg, Berlin, Heidelberg, pp 219\u2013239. doi:\n                        10.1007\/978-3-540-39930-8_8"},{"issue":"2","key":"995_CR12","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.ejor.2009.05.044","volume":"202","author":"I Contreras","year":"2010","unstructured":"Contreras I, Fernndez E, Marn A (2010) The tree of hubs location problem. Eur J Oper Res 202 (2):390\u2013400. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221709004214","journal-title":"Eur J Oper Res"},{"key":"995_CR13","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.cor.2014.09.003","volume":"62","author":"H Damgacioglu","year":"2015","unstructured":"Damgacioglu H, Dinler D, Ozdemirel NE, Iyigun C (2015) A genetic algorithm for the uncapacitated single allocation planar hub location problem. Comput Oper Res 62:224\u2013236. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054814002500","journal-title":"Comput Oper Res"},{"issue":"3","key":"995_CR14","doi-asserted-by":"crossref","first-page":"3385","DOI":"10.1016\/j.eswa.2011.09.026","volume":"39","author":"R de Camargo","year":"2012","unstructured":"de Camargo R, Miranda G (2012) Single allocation hub location problem under congestion: network owner and user perspectives. Expert Systems with Applications 39(3):3385\u20133391. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0957417411013352","journal-title":"Expert Systems with Applications"},{"issue":"12\u201313","key":"995_CR15","doi-asserted-by":"crossref","first-page":"7465","DOI":"10.1016\/j.apm.2013.02.035","volume":"37","author":"RS de Camargo","year":"2013","unstructured":"de Camargo RS, de Miranda G, Lokketangen A (2013) A new formulation and an exact approach for the many-to-many hub location-routing problem. Appl Math Model 37(12\u201313):7465\u20137480. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0307904X1300142X","journal-title":"Appl Math Model"},{"issue":"1","key":"995_CR16","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.ejor.2015.04.017","volume":"246","author":"EM de Sa","year":"2015","unstructured":"de Sa EM, Contreras I, Cordeau J-F (2015a) Exact and heuristic algorithms for the design of hub networks with multiple lines. Eur J Oper Res 246(1):186\u2013198. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221715003100","journal-title":"Eur J Oper Res"},{"issue":"3","key":"995_CR17","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1287\/trsc.2014.0576","volume":"49","author":"EM de Sa","year":"2015","unstructured":"de Sa EM, Contreras I, Cordeau J-F, de Camargo RS, de Miranda G (2015b) The hub line location problem. Transp Sci 49(3):500\u2013518. doi:\n                        10.1287\/trsc.2014.0576","journal-title":"Transp Sci"},{"issue":"2","key":"995_CR18","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.ejor.2012.10.051","volume":"226","author":"EM de Sa","year":"2013","unstructured":"de Sa EM, de Camargo RS, de Miranda G (2013) An improved benders decomposition algorithm for the tree of hubs location problem. Eur J Oper Res 226(2):185\u2013202. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221712008211","journal-title":"Eur J Oper Res"},{"key":"995_CR19","first-page":"1","volume-title":"IEEE INFOCOM 2016 - The 35th annual IEEE international conference on computer communications","author":"S Dernbach","year":"2016","unstructured":"Dernbach S, Taft N, Kurose J, Weinsberg U, Diot C, Ashkan A (2016) Cache content-selection policies for streaming video services. In: IEEE INFOCOM 2016 - The 35th annual IEEE international conference on computer communications, pp 1\u20139"},{"issue":"3","key":"995_CR20","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0966-8349(96)00011-3","volume":"4","author":"AT Ernst","year":"1996","unstructured":"Ernst AT, Krishnamoorthy M (1996) Efficient algorithms for the uncapacitated single allocation p-hub median problem. Locat Sci 4(3):139\u2013154","journal-title":"Locat Sci"},{"issue":"4","key":"995_CR21","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1016\/j.cie.2013.01.012","volume":"64","author":"RZ Farahani","year":"2013","unstructured":"Farahani RZ, Hekmatfar M, Arabani AB, Nikbakhsh E (2013) Hub location problems: a review of models, classification, solution techniques, and applications. Comput Ind Eng 64(4):1096\u20131109. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835213000326","journal-title":"Comput Ind Eng"},{"issue":"7","key":"995_CR22","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/TC.1986.1676799","volume":"35","author":"B Gavish","year":"1986","unstructured":"Gavish B, Pirkul H (1986) Computer and database location in distributed computer systems. IEEE Trans Comput 35(7):583\u2013590","journal-title":"IEEE Trans Comput"},{"issue":"1","key":"995_CR23","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s40314-014-0179-y","volume":"35","author":"F Habibzadeh Boukani","year":"2016","unstructured":"Habibzadeh Boukani F, Farhang Moghaddam B, Pishvaee MS (2016) Robust optimization approach to capacitated single and multiple allocation hub location problems. Comput Appl Math 35(1):45\u201360. doi:\n                        10.1007\/s40314-014-0179-y","journal-title":"Comput Appl Math"},{"issue":"4","key":"995_CR24","doi-asserted-by":"publisher","first-page":"19:1","DOI":"10.1145\/2827872","volume":"5","author":"FM Harper","year":"2015","unstructured":"Harper FM, Konstan JA (2015) The movielens datasets: History and context. ACM Trans Interact Intell Syst 5(4):19:1\u201319:19. doi:\n                        10.1145\/2827872","journal-title":"ACM Trans Interact Intell Syst"},{"key":"995_CR25","doi-asserted-by":"crossref","unstructured":"He Y, Wu T, Zhang C, Liang Z (2015) An improved {MIP} heuristic for the intermodal hub location problem. Omega 57, Part B, 203 \u2013 211. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305048315000900","DOI":"10.1016\/j.omega.2015.04.016"},{"key":"995_CR26","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"D Johnson","year":"1987","unstructured":"Johnson D, Lenstra J, A RK (1987) The complexity of the network design problem. Networks 8:279\u2013285","journal-title":"Networks"},{"key":"995_CR27","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1007\/978-0-387-30164-8_630","volume-title":"Particle Swarm Optimization","author":"J Kennedy","year":"2010","unstructured":"Kennedy J (2010) Particle Swarm Optimization. Springer US, Boston, MA, pp 760\u2013766. doi:\n                        10.1007\/978-0-387-30164-8_630"},{"key":"995_CR28","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/j.cie.2016.09.019","volume":"101","author":"R Kian","year":"2016","unstructured":"Kian R, Kargar K (2016) Comparison of the formulations for a hub-and-spoke network design problem under congestion. Comput Ind Eng 101:504\u2013512. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S036083521630359X","journal-title":"Comput Ind Eng"},{"key":"995_CR29","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/B978-0-12-405163-8.00007-7","volume-title":"Swarm Intelligence and Bio-Inspired Computation. Elsevier, Oxford","author":"J Krause","year":"2013","unstructured":"Krause J, Cordeiro J, Parpinelli RS, Lopes HS (2013) 7 - a survey of swarm algorithms applied to discrete optimization problems. In: Karamanoglu X.-S.Y.C.X.H.G. (ed) Swarm Intelligence and Bio-Inspired Computation. Elsevier, Oxford. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/B9780124051638000077\n                        \n                    , pp 169\u2013191"},{"issue":"1","key":"995_CR30","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.ejor.2015.09.008","volume":"250","author":"AI Mahmutogullari","year":"2016","unstructured":"Mahmutogullari AI, Kara BY (2016) Hub location under competition. Eur J Oper Res 250(1):214\u2013225. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221715008322","journal-title":"Eur J Oper Res"},{"issue":"3","key":"995_CR31","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s00500-012-0919-0http:\/\/dx.doi.org\/10.1007\/s00500-012-0919-0","volume":"17","author":"M Mari\u0107","year":"2013","unstructured":"Mari\u0107 M, Stanimirovi\u0107 Z, Stanojevi\u0107 P (2013) An efficient memetic algorithm for the uncapacitated single allocation hub location problem. Soft Comput 17(3):445\u2013466. doi:\n                        10.1007\/s00500-012-0919-0\n                        \n                     \n                        10.1007\/s00500-012-0919-0","journal-title":"Soft Comput"},{"issue":"9","key":"995_CR32","doi-asserted-by":"crossref","first-page":"2807","DOI":"10.1016\/j.cor.2006.12.030","volume":"35","author":"Q-K Pan","year":"2008","unstructured":"Pan Q-K, Tasgetiren MF, Liang Y-C (2008) A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput Oper Res 35(9):2807\u20132839. part Special Issue: Bio-inspired Methods in Combinatorial Optimization. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054806003170","journal-title":"Comput Oper Res"},{"issue":"1","key":"995_CR33","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"R Poli","year":"2007","unstructured":"Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization. Swarm Intell 1(1):33\u201357. doi:\n                        10.1007\/s11721-007-0002-0","journal-title":"Swarm Intell"},{"issue":"3","key":"995_CR34","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1016\/j.ejor.2013.12.021","volume":"236","author":"J Rieck","year":"2014","unstructured":"Rieck J, Ehrenberg C, Zimmermann J (2014) Many-to-many location-routing with inter-hub transport andmulti-commodity pickup-and-delivery. Eur J Oper Res 236(3):863\u2013878. Vehicle Routing and Distribution Logistics. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221713010059","journal-title":"Eur J Oper Res"},{"key":"995_CR35","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.cor.2014.04.014","volume":"50","author":"I Rodrguez-Martn","year":"2014","unstructured":"Rodrguez-Martn I, Salazar-Gonzlez J-J, Yaman H (2014) A branch-and-cut algorithm for the hub location and routing problem. Comput Oper Res 50:161\u2013174. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054814001051","journal-title":"Comput Oper Res"},{"issue":"8","key":"995_CR36","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/S0141-9331(02)00053-4","volume":"26","author":"A Salman","year":"2002","unstructured":"Salman A, Ahmad I, Al-Madani S (2002) Particle swarm optimization for task assignment problem. Microprocess Microsyst 26(8):363\u2013371. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0141933102000534","journal-title":"Microprocess Microsyst"},{"key":"995_CR37","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cor.2014.01.009","volume":"47","author":"M Sasaki","year":"2014","unstructured":"Sasaki M, Campbell J, Krishnamoorthy M, Ernst A (2014) A stackelberg hub arc location model for a competitive environment. Comput Oper Res 47:27\u201341","journal-title":"Comput Oper Res"},{"key":"995_CR38","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-42902-1_15","volume-title":"A Benders Decomposition Approach for Static Data Segment Location to Servers Connected by a Tree Backbone","author":"G Sen","year":"2017","unstructured":"Sen G, Krishnamoorthy M, Narayanan V, Rangaraj N (2017) A Benders Decomposition Approach for Static Data Segment Location to Servers Connected by a Tree Backbone. Springer International Publishing, Cham, pp 109\u2013116. doi:\n                        10.1007\/978-3-319-42902-1_15"},{"key":"995_CR39","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.cor.2014.05.023","volume":"62","author":"G Sen","year":"2015","unstructured":"Sen G, Krishnamoorthy M, Rangaraj N, Narayanan V (2015) Exact approaches for static data segment allocation problem in an information network. Comput Oper Res 62:282\u2013295. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054814001592","journal-title":"Comput Oper Res"},{"issue":"1","key":"995_CR40","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10479-015-1840-6http:\/\/dx.doi.org\/10.1007\/s10479-015-1840-6","volume":"246","author":"G Sen","year":"2016","unstructured":"Sen G, Krishnamoorthy M, Rangaraj N, Narayanan V (2016a) Facility location models to locate data in information networks: a literature review. Ann Oper Res 246(1):313\u2013348. doi:\n                        10.1007\/s10479-015-1840-6","journal-title":"Ann Oper Res"},{"issue":"1","key":"995_CR41","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1002\/net.21675http:\/\/dx.doi.org\/10.1002\/net.21675","volume":"68","author":"G Sen","year":"2016","unstructured":"Sen G, Krishnamoorthy M, Rangaraj N, Narayanan V (2016b) Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem. Networks 68(1):4\u201322. doi:\n                        10.1002\/net.21675\n                        \n                     \n                        10.1002\/net.21675","journal-title":"Networks"},{"key":"995_CR42","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.cor.2017.03.006","volume":"85","author":"M Tanash","year":"2017","unstructured":"Tanash M, Contreras I, Vidyarthi N (2017) An exact algorithm for the modular hub location problem with single assignments. Comput Oper Res 85:32\u201344. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0305054817300710","journal-title":"Comput Oper Res"},{"issue":"3","key":"995_CR43","doi-asserted-by":"crossref","first-page":"1930","DOI":"10.1016\/j.ejor.2005.12.024","volume":"177","author":"MF Tasgetiren","year":"2007","unstructured":"Tasgetiren MF, Liang Y-C, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177 (3):1930\u20131947. \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221705008453","journal-title":"Eur J Oper Res"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-017-0995-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-0995-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-0995-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,8]],"date-time":"2018-02-08T03:07:53Z","timestamp":1518059273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-017-0995-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,2]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["995"],"URL":"https:\/\/doi.org\/10.1007\/s10489-017-0995-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2017,8,2]]}}}