Advances in Metaheuristics for Hard Optimization最新文献

筛选
英文 中文
Learning Structure Illuminates Black Boxes - An Introduction to Estimation of Distribution Algorithms 学习结构照亮黑盒-介绍估计分布算法
Advances in Metaheuristics for Hard Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-72960-0_18
Jörn Grahl, S. Minner, P. Bosman
{"title":"Learning Structure Illuminates Black Boxes - An Introduction to Estimation of Distribution Algorithms","authors":"Jörn Grahl, S. Minner, P. Bosman","doi":"10.1007/978-3-540-72960-0_18","DOIUrl":"https://doi.org/10.1007/978-3-540-72960-0_18","url":null,"abstract":"","PeriodicalId":292506,"journal":{"name":"Advances in Metaheuristics for Hard Optimization","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122403318","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}
引用次数: 8
An Evolutionary Approach to Solve a Novel Mechatronic Multiobjective Optimization Problem 一种求解新型机电多目标优化问题的进化方法
Advances in Metaheuristics for Hard Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-72960-0_16
E. Mezura-Montes, E. Portilla-Flores, C. Coello, J. Álvarez-Gallegos, C. A. C. Villar
{"title":"An Evolutionary Approach to Solve a Novel Mechatronic Multiobjective Optimization Problem","authors":"E. Mezura-Montes, E. Portilla-Flores, C. Coello, J. Álvarez-Gallegos, C. A. C. Villar","doi":"10.1007/978-3-540-72960-0_16","DOIUrl":"https://doi.org/10.1007/978-3-540-72960-0_16","url":null,"abstract":"","PeriodicalId":292506,"journal":{"name":"Advances in Metaheuristics for Hard Optimization","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125431235","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}
引用次数: 7
Local Search Based on Genetic Algorithms 基于遗传算法的局部搜索
Advances in Metaheuristics for Hard Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-72960-0_10
C. García-Martínez, M. Lozano
{"title":"Local Search Based on Genetic Algorithms","authors":"C. García-Martínez, M. Lozano","doi":"10.1007/978-3-540-72960-0_10","DOIUrl":"https://doi.org/10.1007/978-3-540-72960-0_10","url":null,"abstract":"","PeriodicalId":292506,"journal":{"name":"Advances in Metaheuristics for Hard Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130881414","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}
引用次数: 41
A Parallel Ant Colony Optimization Algorithm Based on Crossover Operation 基于交叉操作的并行蚁群优化算法
Advances in Metaheuristics for Hard Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-72960-0_5
A. Kalinli, Fatih Sarikoc
{"title":"A Parallel Ant Colony Optimization Algorithm Based on Crossover Operation","authors":"A. Kalinli, Fatih Sarikoc","doi":"10.1007/978-3-540-72960-0_5","DOIUrl":"https://doi.org/10.1007/978-3-540-72960-0_5","url":null,"abstract":"","PeriodicalId":292506,"journal":{"name":"Advances in Metaheuristics for Hard Optimization","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123249816","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}
引用次数: 7
Four-bar Mechanism Synthesis for n Desired Path Points Using Simulated Annealing 用模拟退火法综合n个期望路径点的四杆机构
Advances in Metaheuristics for Hard Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-72960-0_2
H. Martinez-Alfaro
{"title":"Four-bar Mechanism Synthesis for n Desired Path Points Using Simulated Annealing","authors":"H. Martinez-Alfaro","doi":"10.1007/978-3-540-72960-0_2","DOIUrl":"https://doi.org/10.1007/978-3-540-72960-0_2","url":null,"abstract":"","PeriodicalId":292506,"journal":{"name":"Advances in Metaheuristics for Hard Optimization","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126328815","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}
引用次数: 21
Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization 约束全局优化中模拟退火、区间划分和混合算法的比较
Advances in Metaheuristics for Hard Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-72960-0_1
C. Pedamallu, L. Özdamar
{"title":"Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization","authors":"C. Pedamallu, L. Özdamar","doi":"10.1007/978-3-540-72960-0_1","DOIUrl":"https://doi.org/10.1007/978-3-540-72960-0_1","url":null,"abstract":"","PeriodicalId":292506,"journal":{"name":"Advances in Metaheuristics for Hard Optimization","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134312219","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
An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions 多阶段流水车间调度问题的反竞价算法:优化与相变
Advances in Metaheuristics for Hard Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-72960-0_6
Alberto V. Donati, V. Darley, B. Ramachandran
{"title":"An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions","authors":"Alberto V. Donati, V. Darley, B. Ramachandran","doi":"10.1007/978-3-540-72960-0_6","DOIUrl":"https://doi.org/10.1007/978-3-540-72960-0_6","url":null,"abstract":"","PeriodicalId":292506,"journal":{"name":"Advances in Metaheuristics for Hard Optimization","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125523310","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}
引用次数: 8
Some Guidelines for Genetic Algorithm Implementation in MINLP Batch Plant Design Problems 遗传算法在MINLP批处理工厂设计问题中的若干实现准则
Advances in Metaheuristics for Hard Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-72960-0_14
Antonin Ponsich, C. Azzaro‐Pantel, S. Domenech, L. Pibouleau
{"title":"Some Guidelines for Genetic Algorithm Implementation in MINLP Batch Plant Design Problems","authors":"Antonin Ponsich, C. Azzaro‐Pantel, S. Domenech, L. Pibouleau","doi":"10.1007/978-3-540-72960-0_14","DOIUrl":"https://doi.org/10.1007/978-3-540-72960-0_14","url":null,"abstract":"","PeriodicalId":292506,"journal":{"name":"Advances in Metaheuristics for Hard Optimization","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123671718","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}
引用次数: 11
Aligning Time Series with Genetically Tuned Dynamic Time Warping Algorithm 用遗传调谐动态时间翘曲算法对齐时间序列
Advances in Metaheuristics for Hard Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-72960-0_12
Pankaj Kumar, Ankur Gupta, V. Jayaraman, B. Kulkarni
{"title":"Aligning Time Series with Genetically Tuned Dynamic Time Warping Algorithm","authors":"Pankaj Kumar, Ankur Gupta, V. Jayaraman, B. Kulkarni","doi":"10.1007/978-3-540-72960-0_12","DOIUrl":"https://doi.org/10.1007/978-3-540-72960-0_12","url":null,"abstract":"","PeriodicalId":292506,"journal":{"name":"Advances in Metaheuristics for Hard Optimization","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126273956","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}
引用次数: 4
Designing Efficient Evolutionary Algorithms for Cluster Optimization: A Study on Locality 设计高效的聚类优化进化算法:局部性研究
Advances in Metaheuristics for Hard Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-72960-0_11
F. B. Pereira, J. Marques, T. Leitão, J. Tavares
{"title":"Designing Efficient Evolutionary Algorithms for Cluster Optimization: A Study on Locality","authors":"F. B. Pereira, J. Marques, T. Leitão, J. Tavares","doi":"10.1007/978-3-540-72960-0_11","DOIUrl":"https://doi.org/10.1007/978-3-540-72960-0_11","url":null,"abstract":"","PeriodicalId":292506,"journal":{"name":"Advances in Metaheuristics for Hard Optimization","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134089413","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}
引用次数: 29
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学术官方微信
小红书