{"id":"https://openalex.org/W2148259137","doi":"https://doi.org/10.1109/cisda.2009.5356525","title":"Minimizing risk on a fleet mix problem with a multiobjective evolutionary algorithm","display_name":"Minimizing risk on a fleet mix problem with a multiobjective evolutionary algorithm","publication_year":2009,"publication_date":"2009-07-01","ids":{"openalex":"https://openalex.org/W2148259137","doi":"https://doi.org/10.1109/cisda.2009.5356525","mag":"2148259137"},"language":"en","primary_location":{"id":"doi:10.1109/cisda.2009.5356525","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cisda.2009.5356525","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications","raw_type":"proceedings-article"},"type":"article","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/A5015287855","display_name":"Michael D. Mazurek","orcid":"https://orcid.org/0000-0003-3254-1250"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Michael Mazurek","raw_affiliation_strings":["Mathematical Physics, University of Waterloo, Canada"],"affiliations":[{"raw_affiliation_string":"Mathematical Physics, University of Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111912631","display_name":"Slawomir Wesolkowski","orcid":null},"institutions":[{"id":"https://openalex.org/I1297460800","display_name":"Defence Research and Development Canada","ror":"https://ror.org/00hgy8d33","country_code":"CA","type":"funder","lineage":["https://openalex.org/I1297460800","https://openalex.org/I1336338359","https://openalex.org/I2802286613"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Slawomir Wesolkowski","raw_affiliation_strings":["DRDC CORA in Ottawa, Canada"],"affiliations":[{"raw_affiliation_string":"DRDC CORA in Ottawa, Canada","institution_ids":["https://openalex.org/I1297460800"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015287855"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":2.0567,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.8723644,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"49","issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9983999729156494,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.991599977016449,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.7294612526893616},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6576603651046753},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6532074809074402},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6271418333053589},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.6214258074760437},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.6125482320785522},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5909029841423035},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5583022832870483},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5459408760070801},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.5394156575202942},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.5080442428588867},{"id":"https://openalex.org/keywords/duration","display_name":"Duration (music)","score":0.4115796685218811},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2602669894695282},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.17656245827674866},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13965031504631042}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7294612526893616},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6576603651046753},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6532074809074402},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6271418333053589},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.6214258074760437},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.6125482320785522},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5909029841423035},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5583022832870483},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5459408760070801},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.5394156575202942},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.5080442428588867},{"id":"https://openalex.org/C112758219","wikidata":"https://www.wikidata.org/wiki/Q16038819","display_name":"Duration (music)","level":2,"score":0.4115796685218811},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2602669894695282},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.17656245827674866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13965031504631042},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cisda.2009.5356525","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cisda.2009.5356525","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W130710483","https://openalex.org/W642949223","https://openalex.org/W1513946764","https://openalex.org/W1595498733","https://openalex.org/W1985093013","https://openalex.org/W2015970599","https://openalex.org/W2025753535","https://openalex.org/W2054032246","https://openalex.org/W2096609603","https://openalex.org/W2124035050","https://openalex.org/W2126105956","https://openalex.org/W2140777138","https://openalex.org/W2152150600","https://openalex.org/W2183097058","https://openalex.org/W2981221597","https://openalex.org/W3023540311","https://openalex.org/W4229889435","https://openalex.org/W4292691288","https://openalex.org/W6663629377","https://openalex.org/W6685954587"],"related_works":["https://openalex.org/W1963790170","https://openalex.org/W1994686097","https://openalex.org/W2073298047","https://openalex.org/W2033790662","https://openalex.org/W2090178682","https://openalex.org/W2586328217","https://openalex.org/W2049264236","https://openalex.org/W2001591765","https://openalex.org/W4241467429","https://openalex.org/W2906115061"],"abstract_inverted_index":{"We":[0,44],"apply":[1],"the":[2,14,33,38,74,85],"non-dominated":[3],"sorting":[4],"genetic":[5],"algorithm-II":[6],"(NSGA-II)":[7],"to":[8,42,61,94],"perform":[9],"a":[10,22,28,53,88],"multiobjective":[11],"optimization":[12],"of":[13,35,49,55,76],"stochastic":[15],"fleet":[16,30,39,78],"estimation":[17],"(SaFE)":[18],"model.":[19],"SaFE":[20],"is":[21,40],"Monte":[23],"Carlo-based":[24],"model":[25],"which":[26,57],"generates":[27],"vehicle":[29],"based":[31],"on":[32,70],"set":[34],"requirements":[36],"that":[37,87],"supposed":[41],"accomplish.":[43],"search":[45],"for":[46,52],"Pareto-optimal":[47],"combinations":[48],"valid":[50],"platform-assignments":[51],"list":[54],"tasks,":[56],"can":[58],"be":[59,92],"applied":[60],"complete":[62],"scenarios":[63],"output":[64],"by":[65],"SaFE.":[66],"Solutions":[67],"are":[68],"evaluated":[69],"three":[71],"objectives,":[72],"with":[73],"goal":[75],"minimizing":[77],"cost,":[79],"total":[80],"task":[81],"duration":[82],"time,":[83],"and":[84],"risk":[86],"solution":[89],"will":[90],"not":[91],"able":[93],"accomplish":[95],"possible":[96],"future":[97],"scenarios.":[98]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}