{"id":"https://openalex.org/W4415974494","doi":"https://doi.org/10.1016/j.procs.2025.09.218","title":"Crossover Meta-Operator Based on Operator Sequences for the Firefighter Problem","display_name":"Crossover Meta-Operator Based on Operator Sequences for the Firefighter Problem","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4415974494","doi":"https://doi.org/10.1016/j.procs.2025.09.218"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2025.09.218","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.218","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.procs.2025.09.218","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055411368","display_name":"Krzysztof Michalak","orcid":"https://orcid.org/0000-0003-4994-9930"},"institutions":[{"id":"https://openalex.org/I305801656","display_name":"Wroclaw University of Economics and Business","ror":"https://ror.org/013sm1c65","country_code":"PL","type":"education","lineage":["https://openalex.org/I305801656"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Krzysztof Michalak","raw_affiliation_strings":["Department of Information Technologies, Wroc\u0142aw University of Economics and Business, Wroc\u0142aw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Technologies, Wroc\u0142aw University of Economics and Business, Wroc\u0142aw, Poland","institution_ids":["https://openalex.org/I305801656"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055411368"],"corresponding_institution_ids":["https://openalex.org/I305801656"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.49039747,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"270","issue":null,"first_page":"975","last_page":"984"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.24629999697208405,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.24629999697208405,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.2393999993801117,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.23849999904632568,"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/crossover","display_name":"Crossover","score":0.9488000273704529},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.7050999999046326},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5996000170707703},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3919999897480011},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.3287999927997589}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.9488000273704529},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.753600001335144},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.7050999999046326},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5996000170707703},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4641999900341034},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3919999897480011},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36230000853538513},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3287999927997589},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2953000068664551},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2865999937057495},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2685999870300293}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.procs.2025.09.218","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.218","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.procs.2025.09.218","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.218","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320335596","display_name":"Wroclawskie Centrum Sieciowo-Superkomputerowe, Politechnika Wroclawska","ror":"https://ror.org/03fqwqm07"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W234161904","https://openalex.org/W2105854030","https://openalex.org/W4301229630"],"related_works":[],"abstract_inverted_index":{"The":[0,71,117],"Firefighter":[1],"Problem":[2],"is":[3,57,82,99],"a":[4,10,21,53,85],"graph-based":[5],"optimization":[6,90],"problem":[7,30,94,131],"in":[8,40,120],"which":[9,33,41,59,105],"threat":[11],"called":[12],"\u2018fire\u2019":[13],"has":[14,113],"to":[15,28,36,47,103,107,114,147],"be":[16,48,115,141],"prevented":[17],"from":[18],"spreading":[19],"on":[20,92,134],"graph":[22,25,45],"by":[23,61,76,101],"protecting":[24],"vertices.":[26,149],"Solutions":[27],"this":[29,51,97,121],"are":[31,34,46],"permutations,":[32],"used":[35,100,142],"determine":[37],"the":[38,44,68,89,110],"order":[39],"vertices":[42,138],"of":[43,73,78,88],"protected.":[49],"In":[50],"paper,":[52],"crossover":[54,64,80,111],"meta-operator":[55],"Seq-X":[56,102],"proposed":[58],"works":[60],"applying":[62],"various":[63],"operators":[65,81],"available":[66],"for":[67,130,143],"permutation-based":[69],"representation.":[70],"quality":[72],"solutions":[74,129],"generated":[75],"sequences":[77],"different":[79],"analyzed":[83],"during":[84],"preliminary":[86],"run":[87],"algorithm":[91],"small":[93],"instances":[95,132],"and":[96],"information":[98,125],"decide":[104],"operator":[106],"select":[108],"when":[109,127],"operation":[112],"performed.":[116],"experiments":[118],"described":[119],"paper":[122],"show":[123],"that":[124],"collected":[126],"optimizing":[128],"based":[133],"graphs":[135,144],"with":[136,145],"1000":[137],"can":[139],"effectively":[140],"up":[146],"10000":[148]},"counts_by_year":[],"updated_date":"2026-08-29T07:29:34.045763","created_date":"2025-11-06T00:00:00"}