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

International Workshop on Hybrid Metaheuristics最新文献

筛选
英文 中文
Hybridization of Stochastic Tunneling with (Quasi)-Infinite Time-Horizon Tabu Search 随机隧道与(拟)无限时界禁忌搜索的杂交
International Workshop on Hybrid Metaheuristics Pub Date : 2018-12-18 DOI: 10.1007/978-3-030-05983-5_9
K. Hamacher
{"title":"Hybridization of Stochastic Tunneling with (Quasi)-Infinite Time-Horizon Tabu Search","authors":"K. Hamacher","doi":"10.1007/978-3-030-05983-5_9","DOIUrl":"https://doi.org/10.1007/978-3-030-05983-5_9","url":null,"abstract":"","PeriodicalId":307092,"journal":{"name":"International Workshop on Hybrid Metaheuristics","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133802870","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 Efficient Heuristic to the Traveling Salesperson Problem with Hotel Selection 旅游销售人员酒店选择问题的有效启发式研究
International Workshop on Hybrid Metaheuristics Pub Date : 2018-12-18 DOI: 10.1007/978-3-030-05983-5_3
M. M. Sousa, L. Ochi, S. Martins
{"title":"An Efficient Heuristic to the Traveling Salesperson Problem with Hotel Selection","authors":"M. M. Sousa, L. Ochi, S. Martins","doi":"10.1007/978-3-030-05983-5_3","DOIUrl":"https://doi.org/10.1007/978-3-030-05983-5_3","url":null,"abstract":"","PeriodicalId":307092,"journal":{"name":"International Workshop on Hybrid Metaheuristics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134338708","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
Stochastic Local Search Algorithms for the Direct Aperture Optimisation Problem in IMRT IMRT直接孔径优化问题的随机局部搜索算法
International Workshop on Hybrid Metaheuristics Pub Date : 2018-12-18 DOI: 10.1007/978-3-030-05983-5_8
Leslie Pérez Cáceres, Ignacio Araya, Denisse Soto, Guillermo Cabrera-Guerrero
{"title":"Stochastic Local Search Algorithms for the Direct Aperture Optimisation Problem in IMRT","authors":"Leslie Pérez Cáceres, Ignacio Araya, Denisse Soto, Guillermo Cabrera-Guerrero","doi":"10.1007/978-3-030-05983-5_8","DOIUrl":"https://doi.org/10.1007/978-3-030-05983-5_8","url":null,"abstract":"","PeriodicalId":307092,"journal":{"name":"International Workshop on Hybrid Metaheuristics","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116543205","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
Fixed set search applied to the traveling salesman problem 固定集搜索应用于旅行商问题
International Workshop on Hybrid Metaheuristics Pub Date : 2018-09-06 DOI: 10.1007/978-3-030-05983-5_5
R. Jovanovic, M. Tuba, S. Voß
{"title":"Fixed set search applied to the traveling salesman problem","authors":"R. Jovanovic, M. Tuba, S. Voß","doi":"10.1007/978-3-030-05983-5_5","DOIUrl":"https://doi.org/10.1007/978-3-030-05983-5_5","url":null,"abstract":"","PeriodicalId":307092,"journal":{"name":"International Workshop on Hybrid Metaheuristics","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125703643","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}
引用次数: 17
Generic CP-Supported CMSA for Binary Integer Linear Programs 二进制整数线性规划的通用cp支持的CMSA
International Workshop on Hybrid Metaheuristics Pub Date : 2018-05-30 DOI: 10.1007/978-3-030-05983-5_1
C. Blum, H. Santos
{"title":"Generic CP-Supported CMSA for Binary Integer Linear Programs","authors":"C. Blum, H. Santos","doi":"10.1007/978-3-030-05983-5_1","DOIUrl":"https://doi.org/10.1007/978-3-030-05983-5_1","url":null,"abstract":"","PeriodicalId":307092,"journal":{"name":"International Workshop on Hybrid Metaheuristics","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117332831","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
Multi-chaotic Approach for Particle Acceleration in PSO 粒子群中粒子加速的多混沌方法
International Workshop on Hybrid Metaheuristics Pub Date : 2016-06-08 DOI: 10.1007/978-3-319-39636-1_6
Michal Pluhacek, R. Šenkeřík, Adam Viktorin, I. Zelinka
{"title":"Multi-chaotic Approach for Particle Acceleration in PSO","authors":"Michal Pluhacek, R. Šenkeřík, Adam Viktorin, I. Zelinka","doi":"10.1007/978-3-319-39636-1_6","DOIUrl":"https://doi.org/10.1007/978-3-319-39636-1_6","url":null,"abstract":"","PeriodicalId":307092,"journal":{"name":"International Workshop on Hybrid Metaheuristics","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116670366","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
Investigating Edge-Reordering Procedures in a Tabu Search Algorithm for the Capacitated Arc Routing Problem 电容电弧布线问题禁忌搜索算法中边重排序过程的研究
International Workshop on Hybrid Metaheuristics Pub Date : 2016-06-08 DOI: 10.1007/978-3-319-39636-1_5
Wasin Padungwech, Jonathan M. Thompson, Rhyd Lewis
{"title":"Investigating Edge-Reordering Procedures in a Tabu Search Algorithm for the Capacitated Arc Routing Problem","authors":"Wasin Padungwech, Jonathan M. Thompson, Rhyd Lewis","doi":"10.1007/978-3-319-39636-1_5","DOIUrl":"https://doi.org/10.1007/978-3-319-39636-1_5","url":null,"abstract":"","PeriodicalId":307092,"journal":{"name":"International Workshop on Hybrid Metaheuristics","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114722638","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
The Capacitated m Two-Node Survivable Star Problem: A Hybrid Metaheuristic Approach 有能力双节点生存星问题:一种混合元启发式方法。
International Workshop on Hybrid Metaheuristics Pub Date : 2016-06-08 DOI: 10.1007/978-3-319-39636-1_13
Gabriel Bayá, Antonio Mauttone, F. Robledo, P. Romero
{"title":"The Capacitated m Two-Node Survivable Star Problem: A Hybrid Metaheuristic Approach","authors":"Gabriel Bayá, Antonio Mauttone, F. Robledo, P. Romero","doi":"10.1007/978-3-319-39636-1_13","DOIUrl":"https://doi.org/10.1007/978-3-319-39636-1_13","url":null,"abstract":"","PeriodicalId":307092,"journal":{"name":"International Workshop on Hybrid Metaheuristics","volume":"163 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116195531","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
Tabu Search Hybridized with Multiple Neighborhood Structures for the Frequency Assignment Problem 混合多邻域结构的禁忌搜索频率分配问题
International Workshop on Hybrid Metaheuristics Pub Date : 2016-06-08 DOI: 10.1007/978-3-319-39636-1_12
Khaled Alrajhi, Jonathan M. Thompson, Wasin Padungwech
{"title":"Tabu Search Hybridized with Multiple Neighborhood Structures for the Frequency Assignment Problem","authors":"Khaled Alrajhi, Jonathan M. Thompson, Wasin Padungwech","doi":"10.1007/978-3-319-39636-1_12","DOIUrl":"https://doi.org/10.1007/978-3-319-39636-1_12","url":null,"abstract":"","PeriodicalId":307092,"journal":{"name":"International Workshop on Hybrid Metaheuristics","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114188643","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
Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers 具有小交叉数的最小次3的唯一哈密顿图
International Workshop on Hybrid Metaheuristics Pub Date : 2016-06-08 DOI: 10.1007/978-3-319-39636-1_1
Benedikt Klocker, H. Fleischner, G. Raidl
{"title":"Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers","authors":"Benedikt Klocker, H. Fleischner, G. Raidl","doi":"10.1007/978-3-319-39636-1_1","DOIUrl":"https://doi.org/10.1007/978-3-319-39636-1_1","url":null,"abstract":"","PeriodicalId":307092,"journal":{"name":"International Workshop on Hybrid Metaheuristics","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117273923","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
首页 上一页 下一页 尾页
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学术官方微信