Proceedings of the Genetic and Evolutionary Computation Conference Companion最新文献

筛选
英文 中文
An optimization strategy for the complex large-scale stockpile blending problem 大型复杂库存混合问题的优化策略
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3528967
Yue Xie, Aneta Neumann, F. Neumann
{"title":"An optimization strategy for the complex large-scale stockpile blending problem","authors":"Yue Xie, Aneta Neumann, F. Neumann","doi":"10.1145/3520304.3528967","DOIUrl":"https://doi.org/10.1145/3520304.3528967","url":null,"abstract":"The Large-scale stockpile blending problem is a decision problem that seeks to maximize valued materials in the final productions by determining a schedule for blending materials from stockpiles and generating parcels. The resource capacities constraints are imposed for all stockpiles subject to a long-term mine schedule, and the downstream side and customer demand impose parcel characteristics constraints. We adopt an existing continuous nonlinear model of the stockpile blending problem and introduce an optimization strategy for the large-scale stockpile blending problem to tackle the complex problem. The optimization strategy splits the problem into several unit problems, and the solution to each unit problem is dependent on each other. An evolutionary algorithm is first used to solve each unit problem. Then a selection operator is implemented to select a set of solutions and inheres to the next unit problem. This paper investigates the performance of different selection operators implemented in the optimization strategy and different evolutionary algorithms for solving unit problems.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125557638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Evolvable hybrid ensembles for musical genre classification
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3528792
Daniel Kostrzewa, Michał Ciszyński, Robert Brzeski
{"title":"Evolvable hybrid ensembles for musical genre classification","authors":"Daniel Kostrzewa, Michał Ciszyński, Robert Brzeski","doi":"10.1145/3520304.3528792","DOIUrl":"https://doi.org/10.1145/3520304.3528792","url":null,"abstract":"The possibility of classifying musical songs according to their musical genre is becoming more challenging because of the millions of songs included in online databases. Therefore, reliable and efficient methods need to be developed that will automatically solve this task. In this article, the mentioned task is accomplished using sets of classifiers. The authors' contribution to the development of automatic musical genre recognition is using hybrid ensembles formed from deep neural networks and classical classifiers and the optimization process executed on the voting process of individual classifiers. Finally, differential evolution algorithms have been used to improve the classification quality further. The proposed evolutionary algorithm shows improvement in comparison with other optimization methods.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126766897","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Ant colony optimization with shortest distance biased dispatch for visiting constrained multiple traveling salesmen problem 基于最短距离偏差调度的蚁群优化求解有约束的多旅行商问题
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3528911
Cong Bao, Qiang Yang, Xudong Gao, Zhen Lu, Jinchao Zhang
{"title":"Ant colony optimization with shortest distance biased dispatch for visiting constrained multiple traveling salesmen problem","authors":"Cong Bao, Qiang Yang, Xudong Gao, Zhen Lu, Jinchao Zhang","doi":"10.1145/3520304.3528911","DOIUrl":"https://doi.org/10.1145/3520304.3528911","url":null,"abstract":"The visiting constrained multiple traveling salesmen problem (VCMTSP) aims to minimize the total traveling cost of all salesmen by taking the accessibility of cities to salesmen into consideration. To solve this challenging problem, this paper devises a shortest distance biased dispatch (SDBD) scheme based on the accessibility of cities and a pheromone diffusion strategy for ant colony optimization (ACO). Specifically, this algorithm maintains a population of ant teams to construct feasible solutions. Each team maintains multiple ants with each ant responsible for constructing the route of one salesman to generate a feasible solution. During the solution construction of an ant team, the multiple ants construct the routes of all salesmen city by city in parallel based on the devised dispatch scheme. To further improve the solution quality, the 2-opt local search operation is integrated to further optimize the routes of all salesmen. Experiments conducted on several VCMTSP instances generated from the TSPLIB benchmark set demonstrate the effectiveness of the proposed algorithm.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126788875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Distributed evolution strategies for large-scale optimization 大规模优化的分布式进化策略
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3528784
Qiqi Duan, Guochen Zhou, Chang Shao, Yijun Yang, Yuhui Shi
{"title":"Distributed evolution strategies for large-scale optimization","authors":"Qiqi Duan, Guochen Zhou, Chang Shao, Yijun Yang, Yuhui Shi","doi":"10.1145/3520304.3528784","DOIUrl":"https://doi.org/10.1145/3520304.3528784","url":null,"abstract":"As their underlying models are becoming larger and data-driven, an increasing number of modern real-world applications can be mathematically formulated as large-scale continuous optimization. In this paper, we propose a distributed evolution strategy (DES) for large-scale black-box optimization (specifically with memory-costly function evaluations), running on the mainstream clustering computing platform. In order to amortize the memory cost, DES utilizes the distributed shared memory to support parallelism of function evaluations. For better fitting into the scalable computing architecture of interest, DES adopts the well-known island model to distribute one low-rank version of covariance matrix adaptation (CMA), because the quadratic complexity of the standard CMA is not well scalable. For a proper trade-off between exploration and exploitation, DES needs to, on-the-fly, adjust strategy parameters at two time-scale levels. Experiments show its efficiency on most of test functions chosen.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"461 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125811214","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Evolutionary operation setting for outcome accumulation type evolutionary rule discovery method 结果累积型演化规则发现方法的演化操作设置
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3528974
Shogo Matsuno, K. Shimada
{"title":"Evolutionary operation setting for outcome accumulation type evolutionary rule discovery method","authors":"Shogo Matsuno, K. Shimada","doi":"10.1145/3520304.3528974","DOIUrl":"https://doi.org/10.1145/3520304.3528974","url":null,"abstract":"Association rule analysis has been widely employed as a basic technique for data mining. Extensive research has also been conducted to apply evolutionary computing techniques to the field of data mining. This study presents a method to evaluate the settings of evolutionary operations in evolutionary rule discovery method, which is characterized by the execution of overall problem solving through the acquisition and accumulation of small results. Since the purpose of population evolution is different from that of general evolutionary computation methods that aim at discovering elite individuals, we examined the difference in the concept of settings during evolution and the evaluation of evolutionary computation by visualizing the progress and efficiency of problem solving. The rule discovery method (GNMiner) is characterized by reflecting acquired information in evolutionary operations; this study determines the relationship between the settings of evolutionary operations and the progress of each task execution stage and the achievement of the final result. This study obtains knowledge on the means of setting up evolutionary operations for efficient rule-set discovery by introducing an index to visualize the efficiency of outcome accumulation. This implies the possibility of setting up dynamic evolutionary operations in the outcome accumulation-type evolutionary computation in future studies.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115318877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A hyper-heuristic approach for artificial teeth scheduling 一种超启发式的人工牙调度方法
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3528938
Felix Winter, Nysret Musliu
{"title":"A hyper-heuristic approach for artificial teeth scheduling","authors":"Felix Winter, Nysret Musliu","doi":"10.1145/3520304.3528938","DOIUrl":"https://doi.org/10.1145/3520304.3528938","url":null,"abstract":"Finding efficient machine schedules in the area of teeth manufacturing is a challenging task, as complex constraints need to be fulfilled and multiple cost objectives should be minimized. This paper investigates a hyper-heuristic solution approach for the artificial teeth scheduling problem which originates from real-life production sites. We propose low-level heuristic strategies which can be utilized by state-of-the-art selection-based hyper-heuristic strategies to efficiently solve large problem instances. An extensive set of experiments on the benchmark instances shows that the proposed approach can improve results for several realistic scenarios.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115323074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Implementing the cumulative difference plot in the IOHanalyzer 在IOHanalyzer中实现累积差值图
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3534050
Etor Arza, Josu Ceberio, Ekhine Irurozki, Aritz Pérez
{"title":"Implementing the cumulative difference plot in the IOHanalyzer","authors":"Etor Arza, Josu Ceberio, Ekhine Irurozki, Aritz Pérez","doi":"10.1145/3520304.3534050","DOIUrl":"https://doi.org/10.1145/3520304.3534050","url":null,"abstract":"The IOHanalyzer is a web-based framework that enables an easy visualization and comparison of the quality of stochastic optimization algorithms. IOHanalyzer offers several graphical and statistical tools analyze the results of such algorithms. In this work, we implement the cumulative difference plot in the IOHanalyzer. The cumulative difference plot [1] is a graphical approach that compares two samples through the first-order stochastic dominance. It improves upon other graphical approaches with the ability to distinguish between a small magnitude of difference and high uncertainty.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"370 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121663922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
KDE-GAN: enhancing evolutionary GAN with knowledge distillation and transfer learning KDE-GAN:利用知识蒸馏和迁移学习增强进化GAN
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3528966
Zhe Yu Liu, A. Song, Nasser R. Sabar
{"title":"KDE-GAN: enhancing evolutionary GAN with knowledge distillation and transfer learning","authors":"Zhe Yu Liu, A. Song, Nasser R. Sabar","doi":"10.1145/3520304.3528966","DOIUrl":"https://doi.org/10.1145/3520304.3528966","url":null,"abstract":"Generative Adversarial Networks (GAN) is a powerful algorithm to reconstruct artificial data that is similar to a set of given data. Evolutionary GAN (E-GAN) is a state-of-the-art variant of GAN. E-GAN combines evolutionary elements such as mutation, fitness evaluation and selection to address vanishing gradient and mode collapse problems of classic GAN. This paper further improves E-GAN by proposing Knowledge Distillation and Knowledge Transfer. The new method, known as Knowledge Distillation E-GAN (KDE-GAN), incorporates the student-teacher architecture and fine-tuning of transfer learning to help the evolutionary GAN training process. Our experiments on benchmark data sets show that KDE-GAN can improve performance and efficiency. Knowledge distillation and knowledge transfer can indeed accelerate the learning process yet reach better FIDs (Frechet Inception Distance).","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121665613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Modifying the quantum-assisted genetic algorithm 修改量子辅助遗传算法
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3534034
Thomas Gabor, M. Lachner, Nico Kraus, Christoph Roch, Jonas Stein, Daniel Ratke, Claudia Linnhoff-Popien
{"title":"Modifying the quantum-assisted genetic algorithm","authors":"Thomas Gabor, M. Lachner, Nico Kraus, Christoph Roch, Jonas Stein, Daniel Ratke, Claudia Linnhoff-Popien","doi":"10.1145/3520304.3534034","DOIUrl":"https://doi.org/10.1145/3520304.3534034","url":null,"abstract":"Based on the quantum-assisted genetic algorithm (QAGA) [11] and related approaches we introduce several modifications of QAGA to search for more promising solvers on (at least) graph coloring problems, knapsack problems, Boolean satisfiability problems, and an equal combination of these three. We empirically test the efficiency of these algorithmic changes on a purely classical version of the algorithm (simulated-annealing-assisted genetic algorithm, SAGA) and verify the benefit of selected modifications when using quantum annealing hardware. Our results point towards an inherent benefit of a simpler and more flexible algorithm design.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121827871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Benchmarking ϵMAg-ES and BP-ϵMAg-ES on the bbob-constrained testbed 在筒子约束测试台上对ϵMAg-ES和BP-ϵMAg-ES进行基准测试
Proceedings of the Genetic and Evolutionary Computation Conference Companion Pub Date : 2022-07-09 DOI: 10.1145/3520304.3534010
Michael Hellwig, H. Beyer
{"title":"Benchmarking ϵMAg-ES and BP-ϵMAg-ES on the bbob-constrained testbed","authors":"Michael Hellwig, H. Beyer","doi":"10.1145/3520304.3534010","DOIUrl":"https://doi.org/10.1145/3520304.3534010","url":null,"abstract":"The ϵMAg Evolution Strategie and its bi-population version (BP-ϵMAg-ES), which performed well on the CEC 2018 and CEC 2020 benchmark sets, are evaluated using the COCO bbob-constrained 2.6.2 benchmark release. Furthermore, the performance of Matlab's fmincon is considered as a baseline algorithm. Unlike the results of the CEC competitions, the outcomes obtained on the COCO 2.6.2 test set do not reveal any advantage of using a bi-population approach. The reasons for these observations needs still to be investigated in future research.","PeriodicalId":216331,"journal":{"name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123791644","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书