{"id":"https://openalex.org/W4286218436","doi":"https://doi.org/10.1201/9781003205326-8","title":"Accelerating Optimization Using Vectorized Moth-Flame Optimizer (vMFO)","display_name":"Accelerating Optimization Using Vectorized Moth-Flame Optimizer (vMFO)","publication_year":2022,"publication_date":"2022-07-19","ids":{"openalex":"https://openalex.org/W4286218436","doi":"https://doi.org/10.1201/9781003205326-8"},"language":"en","primary_location":{"id":"doi:10.1201/9781003205326-8","doi":"https://doi.org/10.1201/9781003205326-8","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781003205326-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306463075","display_name":"CRC Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320584","host_organization_name":"CRC Press","host_organization_lineage":["https://openalex.org/P4310320584","https://openalex.org/P4310320547"],"host_organization_lineage_names":["CRC Press","Taylor & Francis"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Moth-Flame Optimization Algorithm","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W4286219624","display_name":"Handbook of Moth-Flame Optimization Algorithm"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/10072/420349","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091419232","display_name":"AmirPouya Hemmasian","orcid":"https://orcid.org/0000-0001-8205-523X","observed_orcids":["https://orcid.org/0000-0001-8205-523X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amir Pouya Hemmasian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029940599","display_name":"Kazem Meidani","orcid":"https://orcid.org/0000-0001-8441-8700","observed_orcids":["https://orcid.org/0000-0001-8441-8700"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kazem Meidani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091500375","display_name":"Seyedali Mirjalili","orcid":"https://orcid.org/0000-0002-1443-9458","observed_orcids":["https://orcid.org/0000-0002-1443-9458"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Seyedali Mirjalili","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5008745801","display_name":"Amir Barati Farimani","orcid":"https://orcid.org/0000-0002-2952-8576","observed_orcids":["https://orcid.org/0000-0002-2952-8576"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amir Barati Farimani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23015791,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"97","last_page":"109"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9994999766349792,"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.9994999766349792,"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":9.999999747378752e-05,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/moth-flame-optimization","display_name":"moth-flame optimization","score":0.8190000057220459},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.9120000004768372},{"id":"https://openalex.org/keywords/vectorization","display_name":"vectorization","score":0.7120000123977661},{"id":"https://openalex.org/keywords/optimization-acceleration","display_name":"optimization acceleration","score":0.5979999899864197}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4369826316833496}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1201/9781003205326-8","doi":"https://doi.org/10.1201/9781003205326-8","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781003205326-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306463075","display_name":"CRC Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320584","host_organization_name":"CRC Press","host_organization_lineage":["https://openalex.org/P4310320584","https://openalex.org/P4310320547"],"host_organization_lineage_names":["CRC Press","Taylor & Francis"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Moth-Flame Optimization Algorithm","raw_type":"book-chapter"},{"id":"pmh:oai:research-repository.griffith.edu.au:10072/420349","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10072/420349","pdf_url":null,"source":{"id":"https://openalex.org/S7407064376","display_name":"Griffith Research Online","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Book chapter"}],"best_oa_location":{"id":"pmh:oai:research-repository.griffith.edu.au:10072/420349","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10072/420349","pdf_url":null,"source":{"id":"https://openalex.org/S7407064376","display_name":"Griffith Research Online","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Book chapter"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W6941516228","https://openalex.org/W3208598234","https://openalex.org/W4398787548","https://openalex.org/W6930489865","https://openalex.org/W4286216297","https://openalex.org/W2985638660","https://openalex.org/W2729946294","https://openalex.org/W4200359834","https://openalex.org/W4210540274","https://openalex.org/W3012058698"],"abstract_inverted_index":{"In":[0],"this":[1],"chapter,":[2],"Moth-Flame":[3,31],"Optimization":[4],"(MFO)":[5],"algorithm":[6,56],"is":[7],"discussed":[8],"and":[9,23,57],"improved":[10],"from":[11],"the":[12,21,42,52,55,67],"computational":[13],"cost":[14],"point":[15],"of":[16,20,41,44,54],"view.":[17],"While":[18],"many":[19],"adjustments":[22],"improvements":[24],"on":[25,51],"an":[26],"optimization":[27],"algorithm,":[28],"such":[29],"as":[30],"Optimizer":[32],"(MFO),":[33],"aim":[34],"to":[35],"enhance":[36],"its":[37],"performance":[38],"in":[39],"terms":[40],"accuracy":[43],"optimal":[45],"solutions":[46],"obtained,":[47],"here":[48],"we":[49],"concentrate":[50],"implementation":[53],"show":[58],"how":[59],"a":[60],"vectorized":[61],"MFO":[62],"(vMFO)":[63],"can":[64],"significantly":[65],"boost":[66],"computation":[68],"time.":[69]},"counts_by_year":[],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2022-07-21T00:00:00"}