{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T15:41:37Z","timestamp":1771342897694,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,2,16]],"date-time":"2016-02-16T00:00:00Z","timestamp":1455580800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Natural Sciences and Engineering Research Council of Canada (NSERC)","award":["RGPIN\/311631-2009"],"award-info":[{"award-number":["RGPIN\/311631-2009"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s12293-016-0180-7","type":"journal-article","created":{"date-parts":[[2016,2,16]],"date-time":"2016-02-16T04:54:44Z","timestamp":1455598484000},"page":"169-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A simplex social spider algorithm for solving integer programming and minimax problems"],"prefix":"10.1007","volume":"8","author":[{"given":"Mohamed A.","family":"Tawhid","sequence":"first","affiliation":[]},{"given":"Ahmed F.","family":"Ali","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,16]]},"reference":[{"key":"180_CR1","volume-title":"Introduction to Optimum Design","author":"JS Arora","year":"1989","unstructured":"Arora JS (1989) Introduction to Optimum Design. McGrawHill, New York"},{"issue":"1","key":"180_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1086\/284535","volume":"128","author":"L Aviles","year":"1986","unstructured":"Aviles L (1986) Sex-Ratio bias and possible group selection in the social spider snelosimus eximius. Am Nat 128(1):1\u201312","journal-title":"Am Nat"},{"key":"180_CR3","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1017\/CBO9780511721953.024","volume-title":"The evolution of social behavior in insects and arachnids","author":"L Aviles","year":"1997","unstructured":"Aviles L (1997) Causes and consequences of cooperation and permanent-sociality in spiders. In: Choe BC (ed) The evolution of social behavior in insects and arachnids. Cambridge University Press, Cambridge, pp 476\u2013498"},{"issue":"2","key":"180_CR4","first-page":"137","volume":"21","author":"N Bacanin","year":"2012","unstructured":"Bacanin N, Tuba M (2012) Artificial Bee Colony (ABC) algorithm for constrained optimization improved with genetic operators. Stud Inf Control 21(2):137\u2013146","journal-title":"Stud Inf Control"},{"key":"180_CR5","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/BF00933620","volume":"13","author":"JW Bandler","year":"1974","unstructured":"Bandler JW, Charalambous C (1974) Nonlinear programming using minimax techniques. J Optim Theory Appl 13:607\u2013619","journal-title":"J Optim Theory Appl"},{"key":"180_CR6","doi-asserted-by":"publisher","first-page":"2888","DOI":"10.1016\/j.asoc.2010.11.025","volume":"11","author":"A Banharnsakun","year":"2011","unstructured":"Banharnsakun A, Achalakul T, Sirinaovakul B (2011) The best-so-far selection in Artificial Bee Colony algorithm. Appl Soft Comput 11:2888\u20132901","journal-title":"Appl Soft Comput"},{"issue":"16","key":"180_CR7","doi-asserted-by":"publisher","first-page":"6374","DOI":"10.1016\/j.eswa.2013.05.041","volume":"40","author":"E Cuevas","year":"2013","unstructured":"Cuevas E, Cienfuegos M, Zald\u00edvar D, P\u00e9rez-Cisneros M (2013) A swarm optimization algorithm inspired in the behavior of the social-spider. Expert Syst Appl 40(16):6374\u20136384","journal-title":"Expert Syst Appl"},{"key":"180_CR8","unstructured":"Dorigo M (1992) Optimization, Learning and natural algorithms. Ph.D. Thesis, Politecnico di Milano, Italy"},{"key":"180_CR9","unstructured":"Bacanin N, Brajevic I, Tuba M (2013) Firefly algorithm applied to integer programming problems. Recent Adv Math 143\u2013148"},{"key":"180_CR10","unstructured":"Borchers B, Mitchell JE (1992) Using an interior point method In a branch and bound algorithm for integer programming. Technical Report, Rensselaer Polytechnic Institute"},{"issue":"8","key":"180_CR11","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/S0305-0548(97)00002-6","volume":"24","author":"B Borchers","year":"1997","unstructured":"Borchers B, Mitchell JE (1997) A computational comparison of branch and bound and outer approximation methods for 0\u20131 mixed integer nonlinear programs. Comput Oper Res 24(8):699\u2013701","journal-title":"Comput Oper Res"},{"key":"180_CR12","doi-asserted-by":"publisher","unstructured":"Chu SA, Tsai P-W, Pan J-S (2006) Cat swarm optimization. Lecture notes in computer science (including sub-series lecture notes in artificial intelligence and lecture notes in bioinformatics), 4099 LNAI, pp 854\u2013858","DOI":"10.1007\/978-3-540-36668-3_94"},{"key":"180_CR13","doi-asserted-by":"publisher","unstructured":"Du DZ, Pardalos PM (eds) (1995) Minimax and applications. Nonconvex Optimization and Its Applications. doi: 10.1007\/978-1-4613-3557-3","DOI":"10.1007\/978-1-4613-3557-3"},{"issue":"33","key":"180_CR14","doi-asserted-by":"publisher","first-page":"11818","DOI":"10.1073\/pnas.0710603105","volume":"105","author":"C Eric","year":"2008","unstructured":"Eric C, Yip KS (2008) Cooperative capture of large prey solves scaling challenge faced by spider societies. Proc Natl Acad Sci USA 105(33):11818\u201311822","journal-title":"Proc Natl Acad Sci USA"},{"key":"180_CR15","volume-title":"Practical method of optimization, Vol.1 & 2","author":"R Fletcher","year":"1980","unstructured":"Fletcher R (1980) Practical method of optimization, Vol.1 & 2. Wiley, NY"},{"key":"180_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1080\/03052157908902410","volume":"4","author":"A Glankwahmdee","year":"1979","unstructured":"Glankwahmdee A, Liebman JS, Hogg GL (1979) Unconstrained discrete nonlinear programming. Eng Optim 4:95\u2013107","journal-title":"Eng Optim"},{"issue":"3","key":"180_CR17","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF00932858","volume":"22","author":"SP Han","year":"1977","unstructured":"Han SP (1977) A globally convergent method for nonlinear programming. J Optim Theory Appl 22(3):297\u2013309","journal-title":"J Optim Theory Appl"},{"key":"180_CR18","volume-title":"Adaptation in Natural and Artificial Systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor"},{"key":"180_CR19","unstructured":"Isabel ACP, Santo E, Fernandes E (2011) Heuristics pattern search for bound constrained minimax problems, computational science and its applications-6784. ICCSA, pp 174\u2013184"},{"issue":"8","key":"180_CR20","doi-asserted-by":"publisher","first-page":"5360","DOI":"10.1016\/j.asoc.2011.05.023","volume":"11","author":"R Jovanovic","year":"2011","unstructured":"Jovanovic R, Tuba M (2011) An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem. Appl Soft Comput 11(8):5360\u20135366","journal-title":"Appl Soft Comput"},{"key":"180_CR21","doi-asserted-by":"crossref","unstructured":"Jovanovic R, Tuba M (2012) Ant colony optimization algorithm with pheromone correction strategy for minimum connected dominating set problem. Comput Sci Inf Syst (ComSIS) 9(4)","DOI":"10.2298\/CSIS110927038J"},{"issue":"3","key":"180_CR22","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. J Glob Optim 39(3):459\u2013471","journal-title":"J Glob Optim"},{"key":"180_CR23","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","volume":"4","author":"J Kennedy","year":"1995","unstructured":"Kennedy J, Eberhart RC (1995) Particle swarm optimization. Proc IEEE Int Conf Neural Netw 4:1942\u20131948","journal-title":"Proc IEEE Int Conf Neural Netw"},{"key":"180_CR24","doi-asserted-by":"publisher","unstructured":"Laskari EC, Parsopoulos KE, Vrahatis MN (2002) Particle swarm optimization for integer programming. In: Proceedings of the IEEE 2002 congress on evolutionary computation. Honolulu (HI), pp 1582\u20131587","DOI":"10.1109\/CEC.2002.1004478"},{"key":"180_CR25","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler EL, Wood DW (1966) Branch and bound methods: a survey. Oper Res 14:699\u2013719","journal-title":"Oper Res"},{"issue":"11","key":"180_CR26","first-page":"32","volume":"22","author":"XL Li","year":"2002","unstructured":"Li XL, Shao ZJ, Qian JX (2002) Optimizing method based on autonomous animats: Fish-swarm algorithm. Xitong Gongcheng Lilun yu Shijian\/Syst Eng Theory Pract 22(11):32","journal-title":"Xitong Gongcheng Lilun yu Shijian\/Syst Eng Theory Pract"},{"key":"180_CR27","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1137\/040615821","volume":"16","author":"G Liuzzi","year":"2006","unstructured":"Liuzzi G, Lucidi S, Sciandrone M (2006) A derivative-free algorithm for linearly constrained finite minimax problems. SIAM J Optim 16:1054\u20131075","journal-title":"SIAM J Optim"},{"key":"180_CR28","unstructured":"Luk\u0161an L, Vlcek J (2000) Test problems for nonsmooth unconstrained and linearly constrained optimization. Technical report 798, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, Czech Republic"},{"key":"180_CR29","unstructured":"Manquinho VM, Marques Silva JP, Oliveira AL, Sakallah KA (1997) Branch and bound algorithms for highly constrained integer programs. Technical Report, Cadence European Laboratories, Portugal"},{"key":"180_CR30","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1636\/Hi09-99.1","volume":"38","author":"S Maxence","year":"2010","unstructured":"Maxence S (2010) Social organization of the colonial spider Leucauge sp. in the Neotropics: vertical stratification within colonies. J Arachnol 38:446\u2013451","journal-title":"J Arachnol"},{"key":"180_CR31","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","volume":"69","author":"S Mirjalili","year":"2014","unstructured":"Mirjalili S, Mirjalili SM, Lewis A (2014) Grey wolf optimizer. Adv Eng Softw 69:46\u201361","journal-title":"Adv Eng Softw"},{"key":"180_CR32","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder JA, Mead R (1965) A simplex method for function minimization. Comput J 7:308\u2013313","journal-title":"Comput J"},{"key":"180_CR33","doi-asserted-by":"publisher","unstructured":"Nemhauser GL, Rinnooy Kan AHG, Todd MJ (1989) Preface. Optimization, v -ix. doi: 10.1016\/s0927-0507(89)01001-7","DOI":"10.1016\/s0927-0507(89)01001-7"},{"key":"180_CR34","doi-asserted-by":"publisher","unstructured":"Parsopoulos KE, Vrahatis MN (2005) Unified particle swarm optimization for tackling operations research problems. In: Proceeding of IEEE 2005 swarm Intelligence Symposium. Pasadena. pp 53\u201359","DOI":"10.1109\/SIS.2005.1501602"},{"issue":"3","key":"180_CR35","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MCS.2002.1004010","volume":"22","author":"MK Passino","year":"2002","unstructured":"Passino MK (2002) Biomimicry of bacterial foraging for distributed optimization and control. Control Syst IEEE 22(3):52\u201367","journal-title":"Control Syst IEEE"},{"key":"180_CR36","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1111\/j.1439-0310.1992.tb00826.x","volume":"90","author":"A Pasquet","year":"1991","unstructured":"Pasquet A (1991) Cooperation and prey capture efficiency in a social spider. Anelosimus eximius (Araneae, Theridiidae). Ethology 90:121\u2013133","journal-title":"Ethology"},{"key":"180_CR37","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10479-007-0224-y","volume":"156","author":"YG Petalas","year":"2007","unstructured":"Petalas YG, Parsopoulos KE, Vrahatis MN (2007) Memetic particle swarm optimization. Ann oper Res 156:99\u2013127","journal-title":"Ann oper Res"},{"key":"180_CR38","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1023\/B:JOTA.0000006685.60019.3e","volume":"119","author":"E Polak","year":"2003","unstructured":"Polak E, Royset JO, Womersley RS (2003) Algorithms with adaptive smoothing for finite minimax problems. J Optim Theory Appl 119:459\u2013484","journal-title":"J Optim Theory Appl"},{"key":"180_CR39","doi-asserted-by":"publisher","unstructured":"Powell MJD (1978) A fast algorithm for nonlinearly constrained optimization calculations. In: Numerical Analysis, Lecture Notes in Math. 630. Springer, New York, pp 144\u2013157","DOI":"10.1007\/BFb0067703"},{"key":"180_CR40","volume-title":"Engineering optimization-theory and practice","author":"SS Rao","year":"1994","unstructured":"Rao SS (1994) Engineering optimization-theory and practice. Wiley, New Delhi"},{"key":"180_CR41","series-title":"Lecture notes in computer science notes in computer","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-58484-6_258","volume-title":"Parallel Problem solving from nature III","author":"G Rudolph","year":"1994","unstructured":"Rudolph G (1994) An evolutionary algorithm for integer programming. In: Davidor Y, Schwefel H-P, Manner R (eds) Parallel Problem solving from nature III, vol 866., Lecture notes in computer science notes in computerSpringer, Berlin, pp 139\u2013148"},{"key":"180_CR42","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1115\/1.2912596","volume":"112","author":"E Sandgen","year":"1990","unstructured":"Sandgen E (1990) Nonlinear integer and discrete programming in mechanical design optimization. J Mech Des (ASME) 112:223\u2013229","journal-title":"J Mech Des (ASME)"},{"key":"180_CR43","volume-title":"Evolution and optimum seeking","author":"HP Schwefel","year":"1995","unstructured":"Schwefel HP (1995) Evolution and optimum seeking. Wiley, New York"},{"key":"180_CR44","doi-asserted-by":"publisher","unstructured":"Storn R, Price K (1997) Differential evolutiona simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11:341\u2013359","DOI":"10.1023\/A:1008202821328"},{"key":"180_CR45","unstructured":"Teodorovic D, DellOrco M (2005) Bee colony optimization cooperative learning approach to complex transportation problems. In: Advanced OR and AI Methods in Transportation: Proceedings of 16th MiniEURO Conference and 10th Meeting of EWGT (13-16 September 2005). Publishing House of the Polish Operational and System Research, Poznan, pp 51\u201360"},{"issue":"4","key":"180_CR46","first-page":"111","volume":"11","author":"M Tuba","year":"2012","unstructured":"Tuba M, Bacanin N, Stanarevic N (2012) Adjusted artificial bee colony (ABC) algorithm for engineering problems. WSEAS Trans Comput 11(4):111\u2013120","journal-title":"WSEAS Trans Comput"},{"issue":"2","key":"180_CR47","first-page":"62","volume":"11","author":"M Tuba","year":"2012","unstructured":"Tuba M, Subotic M, Stanarevic N (2012) Performance of a modified cuckoo search algorithm for unconstrained optimization problems. WSEAS Trans Syst 11(2):62\u201374","journal-title":"WSEAS Trans Syst"},{"key":"180_CR48","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.ins.2012.10.012","volume":"223","author":"H Wang","year":"2013","unstructured":"Wang H, Sun H, Li C, Rahnamayan S, Jeng-shyang P (2013) Diversity enhanced particle swarm optimization with neighborhood. Inf Sci 223:119\u2013135","journal-title":"Inf Sci"},{"key":"180_CR49","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.asoc.2014.01.038","volume":"18","author":"Y Wang","year":"2014","unstructured":"Wang Y, Li HX, Huang T, Li L (2014) Differential evolution based on covariance matrix learning and bimodal distribution parameter setting. Appl Soft Comput 18:232\u2013247","journal-title":"Appl Soft Comput"},{"key":"180_CR50","doi-asserted-by":"publisher","unstructured":"Wang Y, Wang BC, Li HX, Yen GG (2015) Incorporating objective function information into the feasibility rule for constrained evolutionary optimization. IEEE Trans Cybernet, 1\u201315. doi: 10.1109\/TCYB.2015.2493239","DOI":"10.1109\/TCYB.2015.2493239"},{"key":"180_CR51","unstructured":"Wilson B (1963) A simplicial algorithm for concave programming. PhD thesis, Harvard University"},{"key":"180_CR52","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1023\/A:1011211101714","volume":"20","author":"S Xu","year":"2001","unstructured":"Xu S (2001) Smoothing method for minimax problems. Comput Optim Appl 20:267\u2013279","journal-title":"Comput Optim Appl"},{"issue":"2","key":"180_CR53","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1504\/IJBIC.2010.032124","volume":"2","author":"XS Yang","year":"2010","unstructured":"Yang XS (2010) Firefly algorithm, stochastic test functions and design optimization. Int J Bio-Inspired Comput 2(2):78\u201384","journal-title":"Int J Bio-Inspired Comput"},{"key":"180_CR54","unstructured":"Yang XS, Deb S (2009) Cuckoo search via levy ights. In: Nature and biologically inspired computing, 2009. NaBIC 2009. World Congress on. IEEE, pp 210\u2013214"},{"key":"180_CR55","doi-asserted-by":"publisher","unstructured":"Yang XS (2010) A new metaheuristic bat-inspired algorithm. Studies in computational intelligence, pp 65\u201374. doi: 10.1007\/978-3-642-12538-6_6","DOI":"10.1007\/978-3-642-12538-6_6"},{"key":"180_CR56","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/BF01933221","volume":"30","author":"S Zuhe","year":"1990","unstructured":"Zuhe S, Neumaier A, Eiermann MC (1990) Solving minimax problems by interval methods. BIT 30:742\u2013751","journal-title":"BIT"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-016-0180-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-016-0180-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-016-0180-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-016-0180-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,4]],"date-time":"2022-06-04T07:16:24Z","timestamp":1654326984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-016-0180-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,16]]},"references-count":56,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["180"],"URL":"https:\/\/doi.org\/10.1007\/s12293-016-0180-7","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,16]]}}}