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

Journal of Heuristics最新文献

筛选
英文 中文
Delayed improvement local search 延迟改进本地搜索
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2021-06-29 DOI: 10.1007/s10732-021-09479-9
Heber F. Amaral, S. Urrutia, L. M. Hvattum
{"title":"Delayed improvement local search","authors":"Heber F. Amaral, S. Urrutia, L. M. Hvattum","doi":"10.1007/s10732-021-09479-9","DOIUrl":"https://doi.org/10.1007/s10732-021-09479-9","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"923 - 950"},"PeriodicalIF":2.7,"publicationDate":"2021-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09479-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44971248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An adaptive large neighbourhood search algorithm for diameter bounded network design problems 直径有界网络设计问题的自适应大邻域搜索算法
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2021-06-23 DOI: 10.1007/s10732-021-09481-1
Michele Garraffa, D. Mehta, B. O’Sullivan, Cemalettin Ozturk, L. Quesada
{"title":"An adaptive large neighbourhood search algorithm for diameter bounded network design problems","authors":"Michele Garraffa, D. Mehta, B. O’Sullivan, Cemalettin Ozturk, L. Quesada","doi":"10.1007/s10732-021-09481-1","DOIUrl":"https://doi.org/10.1007/s10732-021-09481-1","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"887 - 922"},"PeriodicalIF":2.7,"publicationDate":"2021-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09481-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48751745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dynamic pricing with demand disaggregation for hotel revenue management 基于需求分解的酒店收益管理动态定价
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2021-06-07 DOI: 10.1007/s10732-021-09480-2
A. M. Bandalouski, N. Egorova, M. Kovalyov, E. Pesch, Ş. Tarim
{"title":"Dynamic pricing with demand disaggregation for hotel revenue management","authors":"A. M. Bandalouski, N. Egorova, M. Kovalyov, E. Pesch, Ş. Tarim","doi":"10.1007/s10732-021-09480-2","DOIUrl":"https://doi.org/10.1007/s10732-021-09480-2","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"869 - 885"},"PeriodicalIF":2.7,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09480-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46985415","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem 多对多集线器位置路由问题的一种简单的超启发式方法
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2021-06-07 DOI: 10.1007/S10732-021-09477-X
Venkatesh Pandiri, Alok Singh
{"title":"A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem","authors":"Venkatesh Pandiri, Alok Singh","doi":"10.1007/S10732-021-09477-X","DOIUrl":"https://doi.org/10.1007/S10732-021-09477-X","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"791 - 868"},"PeriodicalIF":2.7,"publicationDate":"2021-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/S10732-021-09477-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Incomplete MaxSAT approaches for combinatorial testing 组合测试的不完全MaxSAT方法
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2021-05-26 DOI: 10.1007/s10732-022-09495-3
Carlos Ans'otegui, F. Manyà, J. Ojeda, Josep M. Salvia, Eduard Torres
{"title":"Incomplete MaxSAT approaches for combinatorial testing","authors":"Carlos Ans'otegui, F. Manyà, J. Ojeda, Josep M. Salvia, Eduard Torres","doi":"10.1007/s10732-022-09495-3","DOIUrl":"https://doi.org/10.1007/s10732-022-09495-3","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"28 1","pages":"377 - 431"},"PeriodicalIF":2.7,"publicationDate":"2021-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43048819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Heuristic-based allocation of supply constrained blood platelets in emerging economies 新兴经济体中供应受限血小板的启发式分配
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2021-04-28 DOI: 10.1007/s10732-021-09474-0
Fredrik Ødegaard, Sudipendra Nath Roy
{"title":"Heuristic-based allocation of supply constrained blood platelets in emerging economies","authors":"Fredrik Ødegaard, Sudipendra Nath Roy","doi":"10.1007/s10732-021-09474-0","DOIUrl":"https://doi.org/10.1007/s10732-021-09474-0","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"719 - 745"},"PeriodicalIF":2.7,"publicationDate":"2021-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09474-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43445389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A balance-first sequence-last algorithm to design RMS: a matheuristic with performance guaranty to balance reconfigurable manufacturing systems 一种平衡先序后的RMS设计算法:平衡可重构制造系统的性能保证数学方法
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2021-03-29 DOI: 10.1007/s10732-021-09473-1
Youssef Lahrichi, Laurent Deroussi, Nathalie Grangeon, Sylvie Norre
{"title":"A balance-first sequence-last algorithm to design RMS: a matheuristic with performance guaranty to balance reconfigurable manufacturing systems","authors":"Youssef Lahrichi, Laurent Deroussi, Nathalie Grangeon, Sylvie Norre","doi":"10.1007/s10732-021-09473-1","DOIUrl":"https://doi.org/10.1007/s10732-021-09473-1","url":null,"abstract":"<p>The Reconfigurable Transfer Line Balancing Problem (RTLB) is considered in this paper. This problem is quite recent and motivated by the growing need of reconfigurability in the new industry 4.0 context. The problem consists into allocating a set of operations necessary to machine a single part to different workstations placed into a serial line. Each workstation can contain multiple machines operating in parallel and the tasks allocated to a workstation should be sequenced since sequence-dependent setup times between operations are needed to perform tool changes. Besides, precedence constraints, inclusion, exclusion and accessibility constraints between operations are considered. In this article we propose an efficient matheuristic of type Balance First, Sequence Last (BFSL). This method is a two-step heuristic with a constructive phase and an improvement phase. It contains several components from exact methods (linear programming, constraint generation and dynamic programming) and metaheuristics (simulated annealing). In addition, we show that the constructive algorithm approximates the optimal solution when the setup times are bounded by the processing times and give an approximation ratio. The obtained results show the effectiveness of the proposed approach. The matheuristic clearly outperforms a genetic algorithm from literature on quite large benchmark instances.</p>","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"19 3","pages":""},"PeriodicalIF":2.7,"publicationDate":"2021-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138527663","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Heuristics for optimizing 3D mapping missions over swarm-powered ad-hoc clouds 基于群体自组织云的三维地图任务优化启发式算法
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2021-03-11 DOI: 10.1007/s10732-022-09502-7
L. R. Costa, Daniel Aloise, L. Gianoli, Andrea Lodi
{"title":"Heuristics for optimizing 3D mapping missions over swarm-powered ad-hoc clouds","authors":"L. R. Costa, Daniel Aloise, L. Gianoli, Andrea Lodi","doi":"10.1007/s10732-022-09502-7","DOIUrl":"https://doi.org/10.1007/s10732-022-09502-7","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"28 1","pages":"539 - 582"},"PeriodicalIF":2.7,"publicationDate":"2021-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47100543","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Special issue on matheuristics 数学特刊
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2021-03-11 DOI: 10.1007/s10732-021-09472-2
Y. Kergosien, J. Mendoza, V. T’kindt
{"title":"Special issue on matheuristics","authors":"Y. Kergosien, J. Mendoza, V. T’kindt","doi":"10.1007/s10732-021-09472-2","DOIUrl":"https://doi.org/10.1007/s10732-021-09472-2","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"1 - 3"},"PeriodicalIF":2.7,"publicationDate":"2021-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09472-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42762533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Qfold: a new modeling paradigm for the RNA folding problem Qfold：RNA折叠问题的新建模范式
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2021-03-06 DOI: 10.1007/s10732-021-09471-3
Mark W. Lewis, Amit Verma, T. Eckdahl
{"title":"Qfold: a new modeling paradigm for the RNA folding problem","authors":"Mark W. Lewis, Amit Verma, T. Eckdahl","doi":"10.1007/s10732-021-09471-3","DOIUrl":"https://doi.org/10.1007/s10732-021-09471-3","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"695 - 717"},"PeriodicalIF":2.7,"publicationDate":"2021-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09471-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44097223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
首页 上一页 下一页 尾页
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学术官方微信