发布求助
文献互助 智能选刊 最新文献

Metaheuristics and Nature Inspired Computing最新文献

筛选
英文 中文
Multi Phase Methodology for Solving the Multi Depot Vehicle Routing Problem with Limited Supply Capacity at the Depots 求解有限供给能力下多车场车辆路径问题的多阶段方法
Metaheuristics and Nature Inspired Computing Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-94216-8_15
J. de Prado, Sandro Moscatelli, P. Piñeyro, Libertad Tansini, Omar Viera
{"title":"Multi Phase Methodology for Solving the Multi Depot Vehicle Routing Problem with Limited Supply Capacity at the Depots","authors":"J. de Prado, Sandro Moscatelli, P. Piñeyro, Libertad Tansini, Omar Viera","doi":"10.1007/978-3-030-94216-8_15","DOIUrl":"https://doi.org/10.1007/978-3-030-94216-8_15","url":null,"abstract":"","PeriodicalId":366141,"journal":{"name":"Metaheuristics and Nature Inspired Computing","volume":"9 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":"127366701","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 New Learnheuristic: Binary SARSA - Sine Cosine Algorithm (BS-SCA) 一种新的启发式学习算法:二元SARSA -正弦余弦算法(BS-SCA)
Metaheuristics and Nature Inspired Computing Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-94216-8_10
Marcelo Becerra-Rozas, José Lemus-Romani, Broderick Crawford, Ricardo Soto, Felipe Cisternas-Caneo, Andrés Trujillo Embry, Máximo Arnao Molina, Diego Tapia, Mauricio Castillo, J. Rubio
{"title":"A New Learnheuristic: Binary SARSA - Sine Cosine Algorithm (BS-SCA)","authors":"Marcelo Becerra-Rozas, José Lemus-Romani, Broderick Crawford, Ricardo Soto, Felipe Cisternas-Caneo, Andrés Trujillo Embry, Máximo Arnao Molina, Diego Tapia, Mauricio Castillo, J. Rubio","doi":"10.1007/978-3-030-94216-8_10","DOIUrl":"https://doi.org/10.1007/978-3-030-94216-8_10","url":null,"abstract":"","PeriodicalId":366141,"journal":{"name":"Metaheuristics and Nature Inspired Computing","volume":"6 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":"126678864","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
Visualizing Crossover Rate Influence in Differential Evolution with Expected Fitness Improvement 期望适应度改善的差异进化中交叉率影响的可视化
Metaheuristics and Nature Inspired Computing Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-94216-8_9
V. Stanovov, S. Akhmedova, E. Semenkin
{"title":"Visualizing Crossover Rate Influence in Differential Evolution with Expected Fitness Improvement","authors":"V. Stanovov, S. Akhmedova, E. Semenkin","doi":"10.1007/978-3-030-94216-8_9","DOIUrl":"https://doi.org/10.1007/978-3-030-94216-8_9","url":null,"abstract":"","PeriodicalId":366141,"journal":{"name":"Metaheuristics and Nature Inspired Computing","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":"126147949","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
Metaheuristics and Nature Inspired Computing: 8th International Conference, META 2021, Marrakech, Morocco, October 27-30, 2021, Proceedings 元启发式和自然启发计算:第八届国际会议，META 2021，摩洛哥马拉喀什，2021年10月27日至30日，论文集
Metaheuristics and Nature Inspired Computing Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-94216-8
{"title":"Metaheuristics and Nature Inspired Computing: 8th International Conference, META 2021, Marrakech, Morocco, October 27-30, 2021, Proceedings","authors":"","doi":"10.1007/978-3-030-94216-8","DOIUrl":"https://doi.org/10.1007/978-3-030-94216-8","url":null,"abstract":"","PeriodicalId":366141,"journal":{"name":"Metaheuristics and Nature Inspired Computing","volume":"39 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":"125888520","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 Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications 基于大邻域搜索的移动应用服务点分布协同优化方法
Metaheuristics and Nature Inspired Computing Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-94216-8_1
Thomas Jatschka, Tobias Rodemann, G. Raidl
{"title":"A Large Neighborhood Search for a Cooperative Optimization Approach to Distribute Service Points in Mobility Applications","authors":"Thomas Jatschka, Tobias Rodemann, G. Raidl","doi":"10.1007/978-3-030-94216-8_1","DOIUrl":"https://doi.org/10.1007/978-3-030-94216-8_1","url":null,"abstract":"","PeriodicalId":366141,"journal":{"name":"Metaheuristics and Nature Inspired Computing","volume":"19 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":"116578129","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
Extended Path-Relinking Method for p-location Problem p-定位问题的扩展路径链接方法
Metaheuristics and Nature Inspired Computing Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-94216-8_6
J. Janáček, Marek Kvet
{"title":"Extended Path-Relinking Method for p-location Problem","authors":"J. Janáček, Marek Kvet","doi":"10.1007/978-3-030-94216-8_6","DOIUrl":"https://doi.org/10.1007/978-3-030-94216-8_6","url":null,"abstract":"","PeriodicalId":366141,"journal":{"name":"Metaheuristics and Nature Inspired Computing","volume":"20 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":"124488258","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学术文献互助群
群 号：481959085
Book学术官方微信