{"id":"https://openalex.org/W1971065907","doi":"https://doi.org/10.1109/cybconf.2013.6617447","title":"Constraint handling in Firefly Algorithm","display_name":"Constraint handling in Firefly Algorithm","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W1971065907","doi":"https://doi.org/10.1109/cybconf.2013.6617447","mag":"1971065907"},"language":"en","primary_location":{"id":"doi:10.1109/cybconf.2013.6617447","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cybconf.2013.6617447","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Cybernetics (CYBCO)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078408765","display_name":"Aditya M. Deshpande","orcid":"https://orcid.org/0000-0003-0387-4304"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aditya M. Deshpande","raw_affiliation_strings":["Optimization and Agent Technology (OAT) Research Lab, Maharashtra Institute of Technology, Pune, India","Optimization & Agent Technol. (OAT) Res. Lab., Maharashtra Inst. of Technol., Pune, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Optimization and Agent Technology (OAT) Research Lab, Maharashtra Institute of Technology, Pune, India","institution_ids":[]},{"raw_affiliation_string":"Optimization & Agent Technol. (OAT) Res. Lab., Maharashtra Inst. of Technol., Pune, India","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064962013","display_name":"Gaurav Mohan Phatnani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gaurav Mohan Phatnani","raw_affiliation_strings":["Optimization and Agent Technology (OAT) Research Lab, Maharashtra Institute of Technology, Pune, India","Optimization & Agent Technol. (OAT) Res. Lab., Maharashtra Inst. of Technol., Pune, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Optimization and Agent Technology (OAT) Research Lab, Maharashtra Institute of Technology, Pune, India","institution_ids":[]},{"raw_affiliation_string":"Optimization & Agent Technol. (OAT) Res. Lab., Maharashtra Inst. of Technol., Pune, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080691948","display_name":"Anand J. Kulkarni","orcid":"https://orcid.org/0000-0001-6242-9492"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anand J. Kulkarni","raw_affiliation_strings":["Optimization and Agent Technology (OAT) Research Lab, Maharashtra Institute of Technology, Pune, India","Optimization & Agent Technol. (OAT) Res. Lab., Maharashtra Inst. of Technol., Pune, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Optimization and Agent Technology (OAT) Research Lab, Maharashtra Institute of Technology, Pune, India","institution_ids":[]},{"raw_affiliation_string":"Optimization & Agent Technol. (OAT) Res. Lab., Maharashtra Inst. of Technol., Pune, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7237,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.91569901,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"186","last_page":"190"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/firefly-algorithm","display_name":"Firefly algorithm","score":0.7971270084381104},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.7008675932884216},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6392791867256165},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.6205419301986694},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5921424627304077},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5702815651893616},{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.5212284326553345},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.510982871055603},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5062986612319946},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.45947331190109253},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4050276577472687},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2168334424495697},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.2144644856452942},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2039344310760498}],"concepts":[{"id":"https://openalex.org/C154982244","wikidata":"https://www.wikidata.org/wiki/Q5451844","display_name":"Firefly algorithm","level":3,"score":0.7971270084381104},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7008675932884216},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6392791867256165},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.6205419301986694},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5921424627304077},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5702815651893616},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.5212284326553345},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.510982871055603},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5062986612319946},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.45947331190109253},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4050276577472687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2168334424495697},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.2144644856452942},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2039344310760498},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cybconf.2013.6617447","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cybconf.2013.6617447","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE International Conference on Cybernetics (CYBCO)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W31859035","https://openalex.org/W148552177","https://openalex.org/W157343755","https://openalex.org/W1487678510","https://openalex.org/W1511275332","https://openalex.org/W1523741643","https://openalex.org/W1596914020","https://openalex.org/W1955291487","https://openalex.org/W1985121026","https://openalex.org/W1995628573","https://openalex.org/W1998714713","https://openalex.org/W2007779276","https://openalex.org/W2007864618","https://openalex.org/W2017398816","https://openalex.org/W2023742369","https://openalex.org/W2038659300","https://openalex.org/W2042594698","https://openalex.org/W2056605897","https://openalex.org/W2074593431","https://openalex.org/W2101630530","https://openalex.org/W2145479420","https://openalex.org/W2149737638","https://openalex.org/W2151554678","https://openalex.org/W2161029074","https://openalex.org/W2166220592","https://openalex.org/W2348980703","https://openalex.org/W2401938522","https://openalex.org/W6601274237","https://openalex.org/W6605980648","https://openalex.org/W6606346658","https://openalex.org/W6713031549"],"related_works":["https://openalex.org/W3005690382","https://openalex.org/W2553122398","https://openalex.org/W2557745602","https://openalex.org/W1523741643","https://openalex.org/W1955291487","https://openalex.org/W2361792200","https://openalex.org/W4283382030","https://openalex.org/W2945396167","https://openalex.org/W2076297169","https://openalex.org/W2897904533"],"abstract_inverted_index":{"Most":[0],"of":[1,23,38,45,66,100],"the":[2,17,36,39,51,64,83,95],"contemporary":[3],"nature-/bio-inspired":[4],"techniques":[5,26,55,87],"are":[6,21,88,111],"unconstrained":[7],"algorithms.":[8,30],"Their":[9],"performance":[10,37],"may":[11],"get":[12],"affected":[13],"when":[14,48],"dealing":[15],"with":[16,50,92],"constrained":[18,53],"problems.":[19],"There":[20],"number":[22],"constraint":[24,85],"handling":[25,54,86],"developed":[27],"for":[28],"these":[29],"This":[31],"paper":[32],"intends":[33],"to":[34,94],"compare":[35],"emerging":[40],"metaheuristic":[41],"swarm":[42],"optimization":[43],"technique":[44],"Firefly":[46],"Algorithm":[47],"incorporated":[49],"generalized":[52],"such":[56],"as":[57],"penalty":[58],"function":[59],"method,":[60],"feasibility-based":[61],"rule":[62],"and":[63,90,107],"combination":[65],"both,":[67],"i.e.":[68],"combined":[69],"approach.":[70],"Seven":[71],"well":[72],"known":[73],"test":[74],"problems":[75],"have":[76],"been":[77],"solved.":[78],"The":[79,103],"results":[80],"obtained":[81],"using":[82],"three":[84],"compared":[89],"discussed":[91],"regard":[93],"robustness,":[96],"computational":[97],"cost,":[98],"rate":[99],"convergence,":[101],"etc.":[102],"associated":[104],"strengths,":[105],"weaknesses":[106],"future":[108],"research":[109],"directions":[110],"also":[112],"discussed.":[113]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}