{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T19:16:56Z","timestamp":1777663016166,"version":"3.51.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,3,17]],"date-time":"2015-03-17T00:00:00Z","timestamp":1426550400000},"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":["Soft Comput"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s00500-015-1640-6","type":"journal-article","created":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T07:18:50Z","timestamp":1426490330000},"page":"2261-2280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Modeling and solving a capacitated stochastic location-allocation problem using sub-sources"],"prefix":"10.1007","volume":"20","author":[{"given":"Morteza","family":"Alizadeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nezam","family":"Mahdavi-Amiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saber","family":"Shiripour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,17]]},"reference":[{"issue":"2","key":"1640_CR1","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.ejor.2005.01.035","volume":"173","author":"M Albareda-Sambola","year":"2006","unstructured":"Albareda-Sambola M, Van Der Vlerk M, Fern\u00e1ndez E (2006) Exact solutions to a class of stochastic generalized assignment problems. Eur J Oper Res 173(2):465\u2013487","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1640_CR2","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1016\/j.ejor.2005.04.051","volume":"179","author":"M Albareda-Sambola","year":"2007","unstructured":"Albareda-Sambola M, Fern\u00e1ndez E, Laporte G (2007) Heuristic and lower bounds for a stochastic location routing problem. Eur J Oper Res 179(3):940\u2013955","journal-title":"Eur J Oper Res"},{"issue":"3","key":"1640_CR3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.omega.2010.08.002","volume":"39","author":"M Albareda-Sambola","year":"2011","unstructured":"Albareda-Sambola M, Fern\u00e1ndez E, Saldanha-da-Gama F (2011) The facility location problem with Bernoulli demands. Omega 39(3):335\u2013345","journal-title":"Omega"},{"issue":"2","key":"1640_CR4","first-page":"1007","volume":"26","author":"M Alizadeh","year":"2013","unstructured":"Alizadeh M, Mahdavi I, Shiripour S, Asadi H (2013) A nonlinear model for a capacitated location\u2013allocation problem with Bernoulli demand using sub-sources. Int J Eng 26(2):1007\u20131016","journal-title":"Int J Eng"},{"issue":"7","key":"1640_CR5","doi-asserted-by":"crossref","first-page":"3380","DOI":"10.1016\/j.asoc.2013.01.022","volume":"13","author":"M Amiri-Aref","year":"2013","unstructured":"Amiri-Aref M, Javadian N, Tavakkoli-Moghaddam R, Baboli A, Shiripour S (2013) The center location-dependent relocation problem with a probabilistic line barrier. Appl Soft Comput 13(7):3380\u20133391","journal-title":"Appl Soft Comput"},{"key":"1640_CR6","doi-asserted-by":"crossref","unstructured":"Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. Evolutionary computation, CEC, IEEE","DOI":"10.1109\/CEC.2007.4425083"},{"key":"1640_CR7","doi-asserted-by":"crossref","unstructured":"Atashpaz-Gargari E, Hashemzadeh F, Rajabioun R, Lucas C (2008) Colonial competitive algorithm: a novel approach for PID controller design in MIMO distillation column process. Int J Intell Comput Cybern 1(3):337\u2013355","DOI":"10.1108\/17563780810893446"},{"key":"1640_CR8","doi-asserted-by":"crossref","unstructured":"Behnamian J, Zandieh M (2011) A discrete colonial competitive algorithm for hybrid flow shop scheduling to minimize earliness and quadratic tardiness penalties. Expert Syst Appl 38(12):14490\u201314498","DOI":"10.1016\/j.eswa.2011.04.241"},{"issue":"10","key":"1640_CR9","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/trsc.22.2.148","volume":"22","author":"O Berman","year":"1988","unstructured":"Berman O, Simchi-Levi D (1988) Finding the optimal a priori tour and location of a traveling salesman with non-homogeneous customers. Transp Sci 22(10):148\u2013154","journal-title":"Transp Sci"},{"issue":"1","key":"1640_CR10","first-page":"11","volume":"10","author":"A Biabangard-Oskouyi","year":"2009","unstructured":"Biabangard-Oskouyi A, Atashpaz-Gargari E, Soltani N, Lucas C (2009) Application of imperialist competitive algorithm for materials property characterization from sharp indentation test. Int J Eng Simul 10(1):11\u201312","journal-title":"Int J Eng Simul"},{"issue":"1","key":"1640_CR11","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.ejor.2005.05.027","volume":"176","author":"L Bianchi","year":"2007","unstructured":"Bianchi L, Campbell AM (2007) Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem. Eur J Oper Res 176(1):131\u2013144","journal-title":"Eur J Oper Res"},{"key":"1640_CR12","unstructured":"Boukani FH, Moghaddam BF, Pishvaee MS (2014) Robust optimization approach to capacitated single and multiple allocation hub location problems. Comput Appl Math 76(5\u20138):1091\u20131110"},{"issue":"11","key":"1640_CR13","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1007\/s00500-005-0044-4","volume":"10","author":"KY Chan","year":"2006","unstructured":"Chan KY, Aydin EM, Fogarty TC (2006) Main effect fine-tuning of the mutation operator and the neighbourhood function for uncapacitated facility location problems. Soft Comput 10(11):1075\u20131090","journal-title":"Soft Comput"},{"issue":"3","key":"1640_CR14","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/opre.11.3.331","volume":"11","author":"L Cooper","year":"1963","unstructured":"Cooper L (1963) Location\u2013allocation problems. Oper Res 11(3):331\u2013343","journal-title":"Oper Res"},{"issue":"1","key":"1640_CR15","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/1006005","volume":"6","author":"L Cooper","year":"1964","unstructured":"Cooper L (1964) Heuristic methods for location\u2013allocation problems. SIAM Rev 6(1):37\u201353","journal-title":"SIAM Rev"},{"issue":"1","key":"1640_CR16","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.20.1.94","volume":"20","author":"L Cooper","year":"1972","unstructured":"Cooper L (1972) The transportation-location problem. Oper Res 20(1):94\u2013108","journal-title":"Oper Res"},{"issue":"4","key":"1640_CR17","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1002\/nav.20410","volume":"57","author":"T Drezner","year":"2010","unstructured":"Drezner T, Drezner Z, Goldstein Z (2010) A stochastic gradual cover location problem. Nav Res Logist (NRL) 57(4):367\u2013372","journal-title":"Nav Res Logist (NRL)"},{"key":"1640_CR18","volume-title":"Facility layout and location: an analytical approach","author":"RL Francis","year":"1992","unstructured":"Francis RL, Mcginnis LF, White JA (1992) Facility layout and location: an analytical approach. Prentice Hall, Englewood Cliffs"},{"key":"1640_CR19","unstructured":"Hillier FS, Lieberman GJ (2001) Introduction to operations research, 8th edn. McGraw-Hill, New York"},{"key":"1640_CR20","unstructured":"Jasour AM, Atashpaz E, Lucas C (2008) Vehicle fuzzy control using imperialist competitive algorithm. In: Second Iranian joint congress on fuzzy and intelligent systems (IFIS 2008), Tehran, Iran"},{"issue":"6","key":"1640_CR21","doi-asserted-by":"crossref","first-page":"1571","DOI":"10.1016\/j.scient.2011.09.018","volume":"18","author":"H Karimi","year":"2011","unstructured":"Karimi H, Bashiri M (2011) Hub covering location problems with different coverage types. Sci Iran 18(6):1571\u20131578","journal-title":"Sci Iran"},{"issue":"1\u20132","key":"1640_CR22","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1504\/IJBIC.2009.022781","volume":"1","author":"A Khabbazi","year":"2009","unstructured":"Khabbazi A, Atashpaz-Gargari E, Lucas C (2009) Imperialist competitive algorithm for minimum bit error rate beamforming. Int J Bio-Inspired Comput 1(1\u20132):125\u2013133","journal-title":"Int J Bio-Inspired Comput"},{"issue":"3","key":"1640_CR23","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/opre.42.3.543","volume":"42","author":"G Laporte","year":"1994","unstructured":"Laporte G, Louveaux FV, Mercure H (1994) An exact solution for the a priori optimization of the probabilistic traveling salesman problem. Oper Res 42(3):543\u2013549","journal-title":"Oper Res"},{"issue":"1","key":"1640_CR24","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0305-0548(01)00085-5","volume":"30","author":"KY Lee","year":"2003","unstructured":"Lee KY, Han SN, Roh MI (2003) An improved genetic algorithm for facility layout problems having inner structure walls and passages. Comput Oper Res 30(1):117\u2013138","journal-title":"Comput Oper Res"},{"issue":"8","key":"1640_CR25","doi-asserted-by":"crossref","first-page":"2061","DOI":"10.1080\/00207540600847418","volume":"46","author":"R Manzini","year":"2008","unstructured":"Manzini R, Gebennini E (2008) Optimization models for the dynamic facility location and allocation problem. Int J Prod Res 46(8):2061\u20132086","journal-title":"Int J Prod Res"},{"issue":"3","key":"1640_CR26","doi-asserted-by":"crossref","first-page":"445","DOI":"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","journal-title":"Soft Comput"},{"issue":"1","key":"1640_CR27","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ejor.2010.10.012","volume":"210","author":"A Marn","year":"2011","unstructured":"Marn A (2011) The discrete facility location problem with balanced allocation of customers. Eur J Oper Res 210(1):27\u201338","journal-title":"Eur J Oper Res"},{"key":"1640_CR28","first-page":"71","volume":"7","author":"E Mehdizadeh","year":"2011","unstructured":"Mehdizadeh E, Tavarroth MR, Hajipour V (2011a) A new hybrid algorithm to optimize stochastic-fuzzy capacitated multi-facility location\u2013allocation problem. J Optim Ind Eng 7:71\u201380","journal-title":"J Optim Ind Eng"},{"key":"1640_CR29","unstructured":"Mehdizadeh E, Tavarroth MR, Mousavi SM (2010b) Solving the stochastic capacitated location\u2013allocation problem by using a new hybrid algorithm, MATH\u2019 10 proceedings of the 15 $$^{th}$$ t h WSEAS international conference on applied mathematics, Athens, Greece, December 29\u201331, 2010, pp 27\u201332"},{"issue":"7","key":"1640_CR30","doi-asserted-by":"crossref","first-page":"5109","DOI":"10.1016\/j.apm.2012.10.038","volume":"37","author":"M Mousavi","year":"2013","unstructured":"Mousavi M, Niaki T (2013) Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm. Appl Math Model 37(7):5109\u20135119","journal-title":"Appl Math Model"},{"issue":"10","key":"1640_CR31","doi-asserted-by":"crossref","first-page":"1897","DOI":"10.1080\/00207721.2012.670301","volume":"44","author":"M Mousavi","year":"2013","unstructured":"Mousavi M, Niaki T, Mehdizadeh E, Tavarroth M (2013) The capacitated multi-facility location\u2013allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms. Int J Syst Sci 44(10): 1897\u20131912","journal-title":"Int J Syst Sci"},{"key":"1640_CR32","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.protcy.2012.02.036","volume":"1","author":"H Mozafari","year":"2012","unstructured":"Mozafari H, Abdi B, Ayob A (2012) Optimization of adhesive-bonded fiber glass strip using imperialist competitive algorithm. Procedia Technol 1:194\u2013198","journal-title":"Procedia Technol"},{"issue":"12","key":"1640_CR33","doi-asserted-by":"crossref","first-page":"7615","DOI":"10.1016\/j.eswa.2010.04.081","volume":"37","author":"S Nazari-Shirkouhi","year":"2010","unstructured":"Nazari-Shirkouhi S, Eivazy H, Ghodsi R, Rezaie K, Atashpaz-Gargari E (2010) Solving the integrated product mix outsourcing problem using the imperialist competitive algorithm. Expert Syst Appl 37(12):7615\u20137626","journal-title":"Expert Syst Appl"},{"issue":"4","key":"1640_CR34","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1016\/j.omega.2008.08.002","volume":"37","author":"K Pank","year":"2009","unstructured":"Pank K, Lai KK, Liang L, Leung CH (2009) Two-period pricing and ordering policy for the dominant retailer in a two-echelon supply chain with demand uncertainty. Omega 37(4):919\u2013929","journal-title":"Omega"},{"issue":"6","key":"1640_CR35","doi-asserted-by":"crossref","first-page":"2932","DOI":"10.1016\/j.amc.2011.08.041","volume":"218","author":"E Pilotta","year":"2011","unstructured":"Pilotta E, Torres G (2011) A projected Weiszfeld algorithm for the box-constrained Weber location problem. Appl Math Comput 218(6):2932\u20132943","journal-title":"Appl Math Comput"},{"key":"1640_CR36","doi-asserted-by":"crossref","unstructured":"Rajabioun R, Hashemzadeh F, Atashpaz-Gargari E, Mesgari B, Rajaei Salmasi F (2008a) Identification of a MIMO evaporator and its decentralized PID controller tuning using colonial competitive algorithm. In: Proceedings of the 17th world congress, The International Federation of Automatic Control, Seoul, Korea, July 6\u201311, 2008, pp 9952\u20139957","DOI":"10.3182\/20080706-5-KR-1001.01684"},{"key":"1640_CR37","doi-asserted-by":"crossref","unstructured":"Rajabioun R, Atashpaz-Gargari E, Lucas C (2008b) Colonial competitive algorithm as a tool for Nash equilibrium point achievement. Comput Sci Appl-ICCSA 2008 5073:680\u2013695","DOI":"10.1007\/978-3-540-69848-7_55"},{"issue":"1","key":"1640_CR38","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.sepro.2012.04.004","volume":"5","author":"Y Sha","year":"2012","unstructured":"Sha Y, Huang J (2012) The multi-period location\u2013allocation problem of engineering emergency blood supply systems. Syst Eng Procedia 5(1):21\u201328","journal-title":"Syst Eng Procedia"},{"key":"1640_CR39","doi-asserted-by":"crossref","first-page":"947","DOI":"10.4236\/am.2011.28130","volume":"2","author":"S Shiripour","year":"2011","unstructured":"Shiripour S, Amiri-Aref M, Mahdavi I (2011a) The capacitated location\u2013allocation problem in the presence of $$k$$ k connections. Appl Math 2:947\u2013952","journal-title":"Appl Math"},{"issue":"15","key":"1640_CR40","doi-asserted-by":"crossref","first-page":"3988","DOI":"10.1080\/00207543.2011.579639","volume":"50","author":"S Shiripour","year":"2011","unstructured":"Shiripour S, Mahdavi I, Amiri-Aref M, Mohammadnia-Otaghsara M, Mahdavi-Amiri N (2011b) Multi-facility location problems in the presence of a probabilistic line barrier: a mixed integer quadratic programming model. Int J Prod Res 50(15):3988\u20134008","journal-title":"Int J Prod Res"},{"issue":"21","key":"1640_CR41","doi-asserted-by":"crossref","first-page":"5117","DOI":"10.1080\/00207540600823195","volume":"45","author":"FJF Silva","year":"2007","unstructured":"Silva FJF, de la Figuera DS (2007) A capacitated facility location problem with constrained backlogging probabilities. Int J Prod Res 45(21):5117\u20135134","journal-title":"Int J Prod Res"},{"issue":"2","key":"1640_CR42","first-page":"69","volume":"9","author":"B Wang","year":"2010","unstructured":"Wang B, He S, Jaruphongsa W, Tan V, Hui C (2010) Robust optimization model and algorithm for logistics center location and allocation under uncertain environment. J Transp Syst Eng Inf Technol 9(2):69\u201374","journal-title":"J Transp Syst Eng Inf Technol"},{"key":"1640_CR43","unstructured":"Weber A (1909) \u00dcber den Standort der Industrien, T\u00fcbingen theory of the location of industries. Chicago, University of Chicago Press (English translation by C.J. Friedrich, 1929)"},{"issue":"1","key":"1640_CR44","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1016\/j.asoc.2010.02.018","volume":"11","author":"M Wen","year":"2011","unstructured":"Wen M, Kang R (2011) Some optimal models for facility location\u2013allocation problem with random fuzzy demands. Appl Soft Comput 11(1):1202\u20131207","journal-title":"Appl Soft Comput"},{"key":"1640_CR45","doi-asserted-by":"crossref","unstructured":"Yang K, Liu Y (2014) Developing equilibrium optimization methods for hub location problems. Soft Comput. doi: 10.1007\/s00500-014-1427-1","DOI":"10.1007\/s00500-014-1427-1"},{"issue":"2","key":"1640_CR46","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1016\/j.ejor.2010.06.006","volume":"207","author":"Z Yao","year":"2010","unstructured":"Yao Z, Lee L, Jaruphongsa W, Tan V, Hui C (2010) Multi-source facility location\u2013allocation and inventory problem. Eur J Oper Res 207(2):750\u2013762","journal-title":"Eur J Oper Res"},{"issue":"1","key":"1640_CR47","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0360-8352(03)00021-4","volume":"45","author":"J Zhou","year":"2003","unstructured":"Zhou J, Liu B (2003a) New stochastic models for capacitated location\u2013allocation problem. Comput Ind Eng 45(1):111\u2013125","journal-title":"Comput Ind Eng"},{"issue":"3","key":"1640_CR48","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/j.cie.2006.06.019","volume":"53","author":"J Zhou","year":"2007","unstructured":"Zhou J, Liu B (2007b) Modeling capacitated location-allocation problem with fuzzy demands. Comput Ind Eng 53(3):454\u2013468","journal-title":"Comput Ind Eng"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1640-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-015-1640-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-015-1640-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,30]],"date-time":"2020-08-30T22:09:44Z","timestamp":1598825384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-015-1640-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,17]]},"references-count":48,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["1640"],"URL":"https:\/\/doi.org\/10.1007\/s00500-015-1640-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,17]]}}}