{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:39:01Z","timestamp":1740123541645,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T00:00:00Z","timestamp":1489622400000},"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":["J Supercomput"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s11227-017-2006-x","type":"journal-article","created":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T12:55:55Z","timestamp":1489668955000},"page":"4221-4244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A GPU-based genetic algorithm for the p-median problem"],"prefix":"10.1007","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1851-8831","authenticated-orcid":false,"given":"Bader F.","family":"AlBdaiwi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hosam M. F.","family":"AboElFotoh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,16]]},"reference":[{"key":"2006_CR1","unstructured":"Cuda-C Programming Guide. http:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide"},{"key":"2006_CR2","unstructured":"Discrete location problems benchmark library, the p-median problem. www.math.nsc.ru\/AP\/benchmarks\/P-median"},{"key":"2006_CR3","unstructured":"NVIDIA (2015) CURAND Library. Programming guide. PG-05328-050_v7.5. NVIDIA"},{"key":"2006_CR4","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/s10878-009-9251-8","volume":"21","author":"BF AlBdaiwi","year":"2011","unstructured":"AlBdaiwi BF, Ghosh D, Glodengorin B (2011) Data aggregation for p-median problems. J Comb Optim 21:348\u2013363","journal-title":"J Comb Optim"},{"issue":"5","key":"2006_CR5","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1016\/j.camwa.2008.10.081","volume":"57","author":"BF AlBdaiwi","year":"2009","unstructured":"AlBdaiwi BF, Goldengorin B, Sierksma G (2009) Equivalent instances of the simple plant location problem. Comput Math Appl 57(5):812\u2013820","journal-title":"Comput Math Appl"},{"key":"2006_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/A:1026130003508","volume":"122","author":"O Alp","year":"2003","unstructured":"Alp O, Erkut E (2003) An efficient genetic algorithm for the p-median problem. Ann Oper Res 122:21\u201342","journal-title":"Ann Oper Res"},{"key":"2006_CR7","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/j.rser.2016.06.079","volume":"65","author":"FF Bargos","year":"2016","unstructured":"Bargos FF, de Queiroz Lamas W, Bargos DC, Neto MB, Pardal PCPM (2016) Location problem method applied to sugar and ethanol mills location optimization. Renew Sustain Energy Rev 65:274\u2013282","journal-title":"Renew Sustain Energy Rev"},{"key":"2006_CR8","unstructured":"Beasley JE, OR-Library. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/orlib\/pmedinfo.html"},{"issue":"3","key":"2006_CR9","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10732-015-9282-5","volume":"21","author":"B Biesinger","year":"2015","unstructured":"Biesinger B, Hu B, Raidl G (2015) A hybrid genetic algorithm with solution archive for the discrete (r|p)-centroid problem. J Heuristics 21(3):391\u2013431","journal-title":"J Heuristics"},{"key":"2006_CR10","doi-asserted-by":"crossref","unstructured":"Bozkaya B, Zhang J, Erkut E (2002) An efficient genetic algorithm for the p-median problem. Facil Locat Appl Theory 29: 179\u2013205","DOI":"10.1007\/978-3-642-56082-8_6"},{"key":"2006_CR11","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-319-13111-5_2","volume-title":"Location science, chapter 2","author":"MS Daskin","year":"2015","unstructured":"Daskin MS, Maass KL (2015) The p-median problem. In: Laporte G, Nickel S, da Gama FS (eds) Location science, chapter 2. Springer, Berlin, pp 21\u201345"},{"key":"2006_CR12","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.cor.2014.05.010","volume":"62","author":"Z Drezner","year":"2015","unstructured":"Drezner Z, Brimberg J, Mladenovi\u0107 N, Salhi S (2015) New heuristic algorithms for solving the planar p-median problem. Comput Oper Res 62:296\u2013304","journal-title":"Comput Oper Res"},{"issue":"2","key":"2006_CR13","first-page":"124","volume":"13","author":"TA El-Mihoub","year":"2006","unstructured":"El-Mihoub TA, Hopgood AA, Nolle L, Battersby A (2006) Hybrid genetic algorithms: a review. Eng Lett 13(2):124\u2013137","journal-title":"Eng Lett"},{"issue":"4","key":"2006_CR14","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","journal-title":"Comput Ind Eng"},{"key":"2006_CR15","doi-asserted-by":"crossref","unstructured":"Goldengorin B, Kocheturov A, Pardalos PM (2014) A Pseudo-Boolean approach to the market graph analysis by means of the p-median model. In: Clusters, orders, and trees: methods and applications. Springer, pp 77\u201389","DOI":"10.1007\/978-1-4939-0742-7_5"},{"key":"2006_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-8002-0","volume-title":"Cell formation in industrial engineering, theory, algorithms and experiments","author":"B Goldengorin","year":"2013","unstructured":"Goldengorin B, Krushinsky D, Pardalos P (2013) Cell formation in industrial engineering, theory, algorithms and experiments. Springer, Berlin"},{"issue":"2","key":"2006_CR17","doi-asserted-by":"crossref","first-page":"21","DOI":"10.2307\/2313307","volume":"72","author":"M Hall","year":"1965","unstructured":"Hall M, Knuth DE (1965) Combinatorial analysis and computers. Am Math Mon 72(2):21\u201328","journal-title":"Am Math Mon"},{"issue":"5","key":"2006_CR18","first-page":"330","volume":"6","author":"PL Hammer","year":"1968","unstructured":"Hammer PL (1968) Plant location-a pseudo-Boolean approach. Isr J Technol 6(5):330\u2013332","journal-title":"Isr J Technol"},{"key":"2006_CR19","unstructured":"HP Inc. (2015) QuickSpecs. HP Z820 workstation. c04111526-DA-14264-Worldwide-Version 48. HP Inc., USA"},{"issue":"3","key":"2006_CR20","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0966-8349(96)00016-2","volume":"4","author":"P Jaillet","year":"1996","unstructured":"Jaillet P, Song G, Yu G (1996) Airline network design and hub location problems. Locat Sci 4(3):195\u2013212","journal-title":"Locat Sci"},{"issue":"6","key":"2006_CR21","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/S0305-0548(01)00021-1","volume":"29","author":"JH Jaramillo","year":"2002","unstructured":"Jaramillo JH, Bhadury J, Batta R (2002) On the use of genetic algorithms to solve location problems. Comput Oper Res 29(6):761\u2013779","journal-title":"Comput Oper Res"},{"key":"2006_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-016-1748-1","author":"S Kang","year":"2016","unstructured":"Kang S, Kim S-S, Won J, Kang Y-M (2016) GPU-based parallel genetic approach to large-scale travelling salesman problem. J Super Comput. doi: 10.1007\/s11227-016-1748-1","journal-title":"J Super Comput"},{"issue":"3","key":"2006_CR23","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv O, Hakimi S (1979) An algorithmic approach to network location problems. II: The p-medians. SIAM J Appl Math 37(3):539\u2013560","journal-title":"SIAM J Appl Math"},{"key":"2006_CR24","unstructured":"Kazakovtsev LA, Orlov V, Stupina AA, Kazakovtsev V (2015) Modified genetic algorithm with greedy heuristic for continuous and discrete p-median problems. Facta Univ Ser Math Inform 30(1):89\u2013106"},{"key":"2006_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-13111-5","volume-title":"Location science","author":"G Laporte","year":"2015","unstructured":"Laporte G, Nickel S, da Gama FS (2015) Location science. Springer, Berlin"},{"issue":"1","key":"2006_CR26","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/j.cie.2012.10.008","volume":"64","author":"G Lim","year":"2013","unstructured":"Lim G, Ma L (2013) GPU-based parallel vertex substitution algorithm for the p-median problem. Comput Ind Eng 64(1):381\u2013388","journal-title":"Comput Ind Eng"},{"key":"2006_CR27","unstructured":"Ma L, Lim G (2011) GPU-based parallel computational algorithms for solving p-median problem. In: IIE Annual Conference. Proceedings. Institute of Industrial Engineers-Publisher, p 1"},{"key":"2006_CR28","unstructured":"McCaffrey J (2004) Generating the mth lexicographical element of a mathematical combination. CTAN. http:\/\/msdn.microsoft.com\/en-us\/library\/aa289166 , July 2004"},{"key":"2006_CR29","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An introduction to genetic algorithms","author":"M Mitchell","year":"1998","unstructured":"Mitchell M (1998) An introduction to genetic algorithms. MIT Press, Cambridge"},{"issue":"3","key":"2006_CR30","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","volume":"179","author":"N Mladenovi\u0107","year":"2007","unstructured":"Mladenovi\u0107 N, Brimberg J, Hansen P, Moreno-P\u00e9rez JA (2007) The p-median problem: a survey of metaheuristic approaches. Eur J Oper Res 179(3):927\u2013939","journal-title":"Eur J Oper Res"},{"key":"2006_CR31","unstructured":"NVIDIA (2013) Tesla K40 active accelerator. Board specification. BD-06949-001_v03. NVIDIA"},{"key":"2006_CR32","doi-asserted-by":"crossref","unstructured":"Rebreyend P, Lemarchand L, Euler R (2015) A computational comparison of different algorithms for very large p-median problems. In: 15th European Conference on Evolutionary Computation in Combinatorial Optimization. Springer, pp 13\u201324","DOI":"10.1007\/978-3-319-16468-7_2"},{"issue":"3","key":"2006_CR33","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.20128","volume":"48","author":"J Reese","year":"2006","unstructured":"Reese J (2006) Solution methods for the p-median problem: an annotated bibliography. Networks 48(3):125\u2013142","journal-title":"Networks"},{"key":"2006_CR34","doi-asserted-by":"crossref","unstructured":"Ren Y, Awasthi A (2015) Investigating metaheuristics applications for capacitated location allocation problem on logistics networks. In: Chaos modeling and control systems design. Springer, pp 213\u2013238","DOI":"10.1007\/978-3-319-13132-0_9"},{"issue":"1","key":"2006_CR35","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","volume":"10","author":"MGC Resende","year":"2004","unstructured":"Resende MGC, Werneck RF (2004) A hybrid heuristic for thep-median problem. J Heuristics 10(1):59\u201388","journal-title":"J Heuristics"},{"issue":"1","key":"2006_CR36","first-page":"117","volume":"29","author":"Z Stanimirovi\u0107","year":"2012","unstructured":"Stanimirovi\u0107 Z (2012) A genetic algorithm approach for the capacitated single allocation p-hub median problem. Comput Inform 29(1):117\u2013132","journal-title":"Comput Inform"},{"key":"2006_CR37","unstructured":"Todosijevi\u0107 R, Uro\u0161evi\u0107 D, Mladenovi\u0107 N, Hanafi S (2015) A general variable neighborhood search for solving the uncapacitated r-allocation p-hub median problem. Optim Lett 23: 1\u201313"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-017-2006-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2006-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-017-2006-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T17:24:34Z","timestamp":1692725074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-017-2006-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,16]]},"references-count":37,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["2006"],"URL":"https:\/\/doi.org\/10.1007\/s11227-017-2006-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2017,3,16]]}}}