Recent Advances in Evolutionary Computation for Combinatorial Optimization最新文献

筛选
英文 中文
Recent Advances in Evolutionary Computation for Combinatorial Optimization 组合优化的进化计算新进展
Recent Advances in Evolutionary Computation for Combinatorial Optimization Pub Date : 2008-10-10 DOI: 10.1007/978-3-540-70807-0
C. Cotta, Jano van Hemert
{"title":"Recent Advances in Evolutionary Computation for Combinatorial Optimization","authors":"C. Cotta, Jano van Hemert","doi":"10.1007/978-3-540-70807-0","DOIUrl":"https://doi.org/10.1007/978-3-540-70807-0","url":null,"abstract":"","PeriodicalId":250958,"journal":{"name":"Recent Advances in Evolutionary Computation for Combinatorial Optimization","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122319132","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}
引用次数: 59
Reducing the Size of Travelling Salesman Problem Instances by Fixing Edges 通过固定边减少旅行商问题实例的大小
Recent Advances in Evolutionary Computation for Combinatorial Optimization Pub Date : 2007-04-11 DOI: 10.1007/978-3-540-70807-0_15
Thomas Fischer, P. Merz
{"title":"Reducing the Size of Travelling Salesman Problem Instances by Fixing Edges","authors":"Thomas Fischer, P. Merz","doi":"10.1007/978-3-540-70807-0_15","DOIUrl":"https://doi.org/10.1007/978-3-540-70807-0_15","url":null,"abstract":"","PeriodicalId":250958,"journal":{"name":"Recent Advances in Evolutionary Computation for Combinatorial Optimization","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130819246","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}
引用次数: 10
An Evolutionary Algorithm for the Solution of Two-Variable Word Equations in Partially Commutative Groups 部分可交换群中两变量词方程的一种进化算法
Recent Advances in Evolutionary Computation for Combinatorial Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-70807-0_1
M. J. Craven
{"title":"An Evolutionary Algorithm for the Solution of Two-Variable Word Equations in Partially Commutative Groups","authors":"M. J. Craven","doi":"10.1007/978-3-540-70807-0_1","DOIUrl":"https://doi.org/10.1007/978-3-540-70807-0_1","url":null,"abstract":"","PeriodicalId":250958,"journal":{"name":"Recent Advances in Evolutionary Computation for Combinatorial Optimization","volume":"23 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":"121422191","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
A Hybrid Optimization Framework for Cutting and Packing Problems 切割和包装问题的混合优化框架
Recent Advances in Evolutionary Computation for Combinatorial Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-70807-0_6
Napoleão Nepomuceno, P. Pinheiro, André L. V. Coelho
{"title":"A Hybrid Optimization Framework for Cutting and Packing Problems","authors":"Napoleão Nepomuceno, P. Pinheiro, André L. V. Coelho","doi":"10.1007/978-3-540-70807-0_6","DOIUrl":"https://doi.org/10.1007/978-3-540-70807-0_6","url":null,"abstract":"","PeriodicalId":250958,"journal":{"name":"Recent Advances in Evolutionary Computation for Combinatorial Optimization","volume":"305 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":"122803482","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}
引用次数: 20
Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem 工程随机局部搜索算法:基于估计的概率旅行商问题局部搜索实例研究
Recent Advances in Evolutionary Computation for Combinatorial Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-70807-0_4
Prasanna Balaprakash, M. Birattari, T. Stützle
{"title":"Engineering Stochastic Local Search Algorithms: A Case Study in Estimation-Based Local Search for the Probabilistic Travelling Salesman Problem","authors":"Prasanna Balaprakash, M. Birattari, T. Stützle","doi":"10.1007/978-3-540-70807-0_4","DOIUrl":"https://doi.org/10.1007/978-3-540-70807-0_4","url":null,"abstract":"","PeriodicalId":250958,"journal":{"name":"Recent Advances in Evolutionary Computation for Combinatorial Optimization","volume":"48 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120903767","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
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem 背包约束最大生成树问题的拉格朗日分解/进化混合算法
Recent Advances in Evolutionary Computation for Combinatorial Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-70807-0_5
Sandro Pirkwieser, G. Raidl, Jakob Puchinger
{"title":"A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem","authors":"Sandro Pirkwieser, G. Raidl, Jakob Puchinger","doi":"10.1007/978-3-540-70807-0_5","DOIUrl":"https://doi.org/10.1007/978-3-540-70807-0_5","url":null,"abstract":"","PeriodicalId":250958,"journal":{"name":"Recent Advances in Evolutionary Computation for Combinatorial Optimization","volume":"63 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":"128548276","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
Different Codifications and Metaheuristic Algorithms for the Resource Renting Problem with Minimum and Maximum Time Lags 最小和最大时滞资源租用问题的不同编码和元启发式算法
Recent Advances in Evolutionary Computation for Combinatorial Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-70807-0_12
Francisco Ballestín
{"title":"Different Codifications and Metaheuristic Algorithms for the Resource Renting Problem with Minimum and Maximum Time Lags","authors":"Francisco Ballestín","doi":"10.1007/978-3-540-70807-0_12","DOIUrl":"https://doi.org/10.1007/978-3-540-70807-0_12","url":null,"abstract":"","PeriodicalId":250958,"journal":{"name":"Recent Advances in Evolutionary Computation for Combinatorial Optimization","volume":"29 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":"116731064","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
A Hybrid Genetic Algorithm for the DNA Fragment Assembly Problem DNA片段组装问题的混合遗传算法
Recent Advances in Evolutionary Computation for Combinatorial Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-70807-0_7
E. Alba, Gabriel Luque
{"title":"A Hybrid Genetic Algorithm for the DNA Fragment Assembly Problem","authors":"E. Alba, Gabriel Luque","doi":"10.1007/978-3-540-70807-0_7","DOIUrl":"https://doi.org/10.1007/978-3-540-70807-0_7","url":null,"abstract":"","PeriodicalId":250958,"journal":{"name":"Recent Advances in Evolutionary Computation for Combinatorial Optimization","volume":"49 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":"124184584","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}
引用次数: 27
Parallel Memetic Algorithms for Independent Job Scheduling in Computational Grids 计算网格中独立作业调度的并行模因算法
Recent Advances in Evolutionary Computation for Combinatorial Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-70807-0_14
F. Xhafa, Bernat Duran
{"title":"Parallel Memetic Algorithms for Independent Job Scheduling in Computational Grids","authors":"F. Xhafa, Bernat Duran","doi":"10.1007/978-3-540-70807-0_14","DOIUrl":"https://doi.org/10.1007/978-3-540-70807-0_14","url":null,"abstract":"","PeriodicalId":250958,"journal":{"name":"Recent Advances in Evolutionary Computation for Combinatorial Optimization","volume":"9 4 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":"133955513","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}
引用次数: 22
Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem 基于收缩的启发式算法提高图着色问题求解的效率
Recent Advances in Evolutionary Computation for Combinatorial Optimization Pub Date : 1900-01-01 DOI: 10.1007/978-3-540-70807-0_11
I. Juhos, Jano van Hemert
{"title":"Contraction-Based Heuristics to Improve the Efficiency of Algorithms Solving the Graph Colouring Problem","authors":"I. Juhos, Jano van Hemert","doi":"10.1007/978-3-540-70807-0_11","DOIUrl":"https://doi.org/10.1007/978-3-540-70807-0_11","url":null,"abstract":"","PeriodicalId":250958,"journal":{"name":"Recent Advances in Evolutionary Computation for Combinatorial Optimization","volume":"2672 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":"125493213","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}
引用次数: 3
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学术文献互助群
群 号:481959085
Book学术官方微信