Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)最新文献_第2页

Distance functions for order-based encodings 基于顺序编码的距离函数

Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) Pub Date : 1997-04-13 DOI: 10.1109/ICEC.1997.592266

S. Ronald

引用次数: 34

A self-organizing system with cell-specialization 具有细胞特化的自组织系统

Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) Pub Date : 1997-04-13 DOI: 10.1109/ICEC.1997.592315

K. Nakano, K. Konishi, R. Ishiyama, Shiro Ikeda

引用次数: 3

Using a genetic algorithm for communication link partitioning 采用遗传算法对通信链路进行划分

Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) Pub Date : 1997-04-13 DOI: 10.1109/ICEC.1997.592377

Ju-Hyun Lee, Yanghee Choi, Byoung-Tak Zhang, Chongsang Kim

引用次数: 3

Fuzzy system design with a cascaded genetic algorithm 基于级联遗传算法的模糊系统设计

Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) Pub Date : 1997-04-13 DOI: 10.1109/ICEC.1997.592378

H. Heider, T. Drabe

引用次数: 13

A comparative study of GA and orthogonal experimental design 遗传算法与正交试验设计的比较研究

Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) Pub Date : 1997-04-13 DOI: 10.1109/ICEC.1997.592285

H. Tanaka

引用次数: 9

An empirical comparison of simulated annealing and genetic algorithms on NK fitness landscapes NK适应度景观模拟退火与遗传算法的实证比较

Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) Pub Date : 1997-04-13 DOI: 10.1109/ICEC.1997.592286

Lae-Jeong Park, D. Nam, C. Park, Sang-Hoon Oh

引用次数: 9

Computing by splicing: programmed and evolving splicing systems 通过剪接计算:程序化的和进化的剪接系统

Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) Pub Date : 1997-04-13 DOI: 10.1109/ICEC.1997.592313

G. Paun, G. Rozenberg, A. Salomaa

引用次数: 12

A multi-sexual genetic algorithm for multiobjective optimization 多目标优化的多性别遗传算法

Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) Pub Date : 1997-04-13 DOI: 10.1109/ICEC.1997.592269

Joanna Lis, A. E. Eiben

引用次数: 131

A society of hill-climbers 爬山者协会

Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) Pub Date : 1997-04-13 DOI: 10.1109/ICEC.1997.592329

M. Sebag, Marc Schoenauer

{"title":"A society of hill-climbers","authors":"M. Sebag, Marc Schoenauer","doi":"10.1109/ICEC.1997.592329","DOIUrl":"https://doi.org/10.1109/ICEC.1997.592329","url":null,"abstract":"The paper is concerned with function optimisation in binary search spaces. It focuses on how hill climbers can work together and/or use their past trials in order to speed up the search. A hill climber is viewed as a set of mutations. The challenge is twofold: one must determine how many bits should be mutated, and which bits should preferably be mutated, or in other words, which climbing directions are to be preferred. The latter question is addressed by recording the last worst trials of the hill climbers within an individual, called repoussoir. The hill climbers further explore the neighborhood of their current point so as to get away from the repoussoir. As to the former question, no definite answer is proposed. Nevertheless, we experimentally show that hill climbers behave quite differently depending on whether one sets a mutation rate p/sub m/ per bit, or sets the exact number M of bits to mutate per individual. Two algorithms describing societies of hill climbers, with or without memory of the past trials, are described. These are experimented on several 900-bit problems, and significantly outperform standard genetic algorithms and evolution strategies.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127787056","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}

引用次数: 35

Multi-chromosome mixed encodings for heterogeneous problems 异构问题的多染色体混合编码

Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97) Pub Date : 1997-04-13 DOI: 10.1109/ICEC.1997.592264

S. Ronald, S. Kirkby, Peter W. Eklund

{"title":"Multi-chromosome mixed encodings for heterogeneous problems","authors":"S. Ronald, S. Kirkby, Peter W. Eklund","doi":"10.1109/ICEC.1997.592264","DOIUrl":"https://doi.org/10.1109/ICEC.1997.592264","url":null,"abstract":"Genetic algorithms (GAs) are an effective optimisation tool for use on problems that have a large complex set of possible solutions. Traditionally, GAs have been mainly applied to problems with homogeneous structure, e.g. encodings with either a set of floating point numbers, a set of integers, a binary string, a permutation of symbols, or an expression tree. Recently, more attention has been devoted to more heterogeneous problems that require a compound encoding such as an expression tree, a set of integers, and a permutation of symbols. In the field of engineering these more complex problem types are common and each of the different components of the problem must be optimised concurrently. The paper presents a methodology for solving compound problems with a genetic algorithm. To illustrate this methodology a problem is presented that requires the simultaneous optimisation of a permutation as well as a set of integer values. The problem is a modified travelling salesperson problem where at each city the salesperson must choose a type of transport for the next leg of the journey. There are associated costs with each transport type that are a function of the distance of the leg of travel as well as the number of legs that a single mode of transport is utilised.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132540088","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}

引用次数: 9