@inproceedings{10.1007/978-3-319-12027-0_30,
    abstract = "© Springer International Publishing Switzerland 2014.In this paper, we study iSMS-EMOA, a recently proposed approach that improves the well-known S metric selection Evolutionary Multi-Objective Algorithm (SMS-EMOA). These two indicator-based multi-objective evolutionary algorithms rely on hypervolume contributions to select individuals. Here, we propose to define a probability of using a randomly selected individual within the iSMS-EMOA’s selection scheme. In order to calibrate the value of such probability, we use the EVOCA tuner. Our preliminary results indicate that we are able to save up to 33\% of computations of the contribution to hypervolume with respect to the original iSMS-EMOA, without any significant quality degradation in the solutions obtained. In fact, in some cases, the approach proposed here was even able to improve the quality of the solutions obtained by the original iSMS-EMOA.",
    year = "2014",
    title = "A more efficient selection sche in iSMS-EMOA",
    volume = "8864",
    pages = "371-380",
    doi = "10.1007/978-3-319-12027-0\_30",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"
}

{"_id":"c4iqhSezXc6ajQmkm","bibbaseid":"anonymous-amoreefficientselectionscheinismsemoa-2014","downloads":0,"creationDate":"2017-03-31T20:15:33.020Z","title":"A more efficient selection sche in iSMS-EMOA","author_short":null,"year":2014,"bibtype":"inproceedings","biburl":"https://1fichier.com/?j9cpurkmnv","bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"© Springer International Publishing Switzerland 2014.In this paper, we study iSMS-EMOA, a recently proposed approach that improves the well-known S metric selection Evolutionary Multi-Objective Algorithm (SMS-EMOA). These two indicator-based multi-objective evolutionary algorithms rely on hypervolume contributions to select individuals. Here, we propose to define a probability of using a randomly selected individual within the iSMS-EMOA’s selection scheme. In order to calibrate the value of such probability, we use the EVOCA tuner. Our preliminary results indicate that we are able to save up to 33% of computations of the contribution to hypervolume with respect to the original iSMS-EMOA, without any significant quality degradation in the solutions obtained. In fact, in some cases, the approach proposed here was even able to improve the quality of the solutions obtained by the original iSMS-EMOA.","year":"2014","title":"A more efficient selection sche in iSMS-EMOA","volume":"8864","pages":"371-380","doi":"10.1007/978-3-319-12027-0_30","booktitle":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","bibtex":"@inproceedings{10.1007/978-3-319-12027-0_30,\n abstract = \"© Springer International Publishing Switzerland 2014.In this paper, we study iSMS-EMOA, a recently proposed approach that improves the well-known S metric selection Evolutionary Multi-Objective Algorithm (SMS-EMOA). These two indicator-based multi-objective evolutionary algorithms rely on hypervolume contributions to select individuals. Here, we propose to define a probability of using a randomly selected individual within the iSMS-EMOA’s selection scheme. In order to calibrate the value of such probability, we use the EVOCA tuner. Our preliminary results indicate that we are able to save up to 33\\% of computations of the contribution to hypervolume with respect to the original iSMS-EMOA, without any significant quality degradation in the solutions obtained. In fact, in some cases, the approach proposed here was even able to improve the quality of the solutions obtained by the original iSMS-EMOA.\",\n year = \"2014\",\n title = \"A more efficient selection sche in iSMS-EMOA\",\n volume = \"8864\",\n pages = \"371-380\",\n doi = \"10.1007/978-3-319-12027-0\\_30\",\n booktitle = \"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\"\n}\n\n","key":"10.1007/978-3-319-12027-0_30","id":"10.1007/978-3-319-12027-0_30","bibbaseid":"anonymous-amoreefficientselectionscheinismsemoa-2014","urls":{},"downloads":0,"html":""},"search_terms":["more","efficient","selection","sche","isms","emoa"],"keywords":[],"authorIDs":[],"dataSources":["gKiCRHjjC2iGthGEx"]}