{"id":"https://openalex.org/W2007987346","doi":"https://doi.org/10.1145/2739482.2764720","title":"Fast Pareto Front Approximation for Cloud Instance Pool Optimization","display_name":"Fast Pareto Front Approximation for Cloud Instance Pool Optimization","publication_year":2015,"publication_date":"2015-07-10","ids":{"openalex":"https://openalex.org/W2007987346","doi":"https://doi.org/10.1145/2739482.2764720","mag":"2007987346"},"language":"en","primary_location":{"id":"doi:10.1145/2739482.2764720","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739482.2764720","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation","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/A5003758754","display_name":"Ana Oprescu","orcid":"https://orcid.org/0000-0001-6376-0750"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ana-Maria Oprescu","raw_affiliation_strings":["VU University, Amsterdam, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"VU University, Amsterdam, Netherlands","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088772243","display_name":"Alexandra Filip","orcid":"https://orcid.org/0000-0002-7426-1081"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexandra (Vintila) Filip","raw_affiliation_strings":["VU University, Amsterdam, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"VU University, Amsterdam, Netherlands","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044478227","display_name":"Thilo Kielmann","orcid":"https://orcid.org/0000-0002-5966-7550"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thilo Kielmann","raw_affiliation_strings":["VU University, Amsterdam, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"VU University, Amsterdam, Netherlands","institution_ids":[]}]}],"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":2,"citation_normalized_percentile":{"value":0.08360855,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1443","last_page":"1444"},"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.9998999834060669,"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.9998999834060669,"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/T11276","display_name":"Solar Radiation and Photovoltaics","score":0.9933000206947327,"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9865000247955322,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.8034783601760864},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6791045069694519},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.6578892469406128},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.613246738910675},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5945549011230469},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.575207531452179},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.531109631061554},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5078209042549133},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.48371222615242004},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.47304123640060425},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4572145938873291},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4312545657157898},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2444947361946106},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.17834368348121643}],"concepts":[{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.8034783601760864},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6791045069694519},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.6578892469406128},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.613246738910675},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5945549011230469},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.575207531452179},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.531109631061554},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5078209042549133},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.48371222615242004},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.47304123640060425},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4572145938873291},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4312545657157898},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2444947361946106},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.17834368348121643},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2739482.2764720","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739482.2764720","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/54c3a804-0183-4c44-b1e6-bff7c9d1fa66","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/54c3a804-0183-4c44-b1e6-bff7c9d1fa66","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Oprescu, A M, Filip, A & Kielmann, T 2015, Fast Pareto Front Approximation for Cloud Instance Pool Optimization. in Genetic and Evolutionary Computation Conference (GECCO 2015). ACM.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.696.768","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.696.768","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.vu.nl/%7Ekielmann/papers/gecco15-short.pdf","raw_type":"text"},{"id":"pmh:oai:research.vu.nl:publications/54c3a804-0183-4c44-b1e6-bff7c9d1fa66","is_oa":false,"landing_page_url":"https://hdl.handle.net/1871.1/54c3a804-0183-4c44-b1e6-bff7c9d1fa66","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Oprescu, A M, Filip, A & Kielmann, T 2015, Fast Pareto Front Approximation for Cloud Instance Pool Optimization. in Genetic and Evolutionary Computation Conference (GECCO 2015). ACM.","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1500356961","https://openalex.org/W1502761295","https://openalex.org/W1607104331","https://openalex.org/W1927597696","https://openalex.org/W2001591765","https://openalex.org/W2015321644","https://openalex.org/W2022485595","https://openalex.org/W2085732010","https://openalex.org/W2118028531","https://openalex.org/W2120651609","https://openalex.org/W2127316065","https://openalex.org/W2497014164"],"related_works":["https://openalex.org/W1963790170","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/W2073147994","https://openalex.org/W1588199609"],"abstract_inverted_index":{"Computing":[0],"the":[1,59],"Pareto":[2,83,105],"Set":[3],"(PS)":[4],"of":[5,11,21,45,61],"optimal":[6],"cloud":[7,22,28],"schedules":[8],"in":[9],"terms":[10],"cost":[12],"and":[13,19,92,94],"makespan":[14],"for":[15,54],"a":[16,40,76],"given":[17],"application":[18],"set":[20],"instance":[23],"types":[24],"is":[25],"NP-complete.":[26],"Moreover,":[27],"instances'":[29],"volatility":[30],"requires":[31],"fast":[32],"PS":[33,90],"recomputations.":[34],"While":[35],"genetic":[36],"algorithms":[37],"(GA)":[38],"are":[39],"promising":[41],"approach,":[42],"little":[43],"knowledge":[44],"an":[46,64],"approximated":[47],"PS's":[48],"quality":[49,104],"leads":[50],"to":[51,87],"GAs":[52],"running":[53],"overly":[55],"many":[56],"generations,":[57],"contradicting":[58],"goal":[60],"quickly":[62],"computing":[63,102],"approximate":[65],"solution.":[66],"We":[67,85],"address":[68],"this":[69],"with":[70,75],"MOO-GA,":[71],"our":[72],"GA":[73],"enhanced":[74],"domain-tailored":[77],"termination":[78],"criteria":[79],"delivering":[80],"fast,":[81],"well-approximated":[82],"sets.":[84],"compare":[86],"NSGAIII":[88],"using":[89],"convergence":[91],"diversity,":[93],"computational":[95],"effort":[96],"metrics.":[97],"Results":[98],"show":[99],"MOO-GA":[100],"consistently":[101],"better":[103],"sets":[106],"within":[107],"one":[108],"second":[109],"on":[110],"average":[111],"(df=98,":[112],"p-value<10-3).":[113]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}