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

Journal of Heuristics最新文献

筛选
英文 中文
A reduced cost-based restriction and refinement matheuristic for stochastic network design problem 随机网络设计问题的一种基于降低成本的约束和改进数学方法
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-10-24 DOI: 10.1007/s10732-020-09460-y
Fatemeh Sarayloo, T. Crainic, W. Rei
{"title":"A reduced cost-based restriction and refinement matheuristic for stochastic network design problem","authors":"Fatemeh Sarayloo, T. Crainic, W. Rei","doi":"10.1007/s10732-020-09460-y","DOIUrl":"https://doi.org/10.1007/s10732-020-09460-y","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2020-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09460-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44195320","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}
引用次数: 4
Local search for the maximum k-plex problem 最大k-丛问题的局部搜索
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-10-08 DOI: 10.1007/s10732-020-09459-5
W. Pullan
{"title":"Local search for the maximum k-plex problem","authors":"W. Pullan","doi":"10.1007/s10732-020-09459-5","DOIUrl":"https://doi.org/10.1007/s10732-020-09459-5","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2020-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09459-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46927453","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
Multi-level evolution strategies for high-resolution black-box control 高分辨率黑箱控制的多级进化策略
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-10-04 DOI: 10.1007/s10732-021-09483-z
O. M. Shir, Xi Xing, H. Rabitz
{"title":"Multi-level evolution strategies for high-resolution black-box control","authors":"O. M. Shir, Xi Xing, H. Rabitz","doi":"10.1007/s10732-021-09483-z","DOIUrl":"https://doi.org/10.1007/s10732-021-09483-z","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2020-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09483-z","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46309130","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
Reactive VNS algorithm for the maximum k-subset intersection problem 最大k-子集交集问题的反应VNS算法
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-09-04 DOI: 10.1007/s10732-020-09452-y
F. C. S. Dias, W. A. Tavares, José Robertty de Freitas Costa
{"title":"Reactive VNS algorithm for the maximum k-subset intersection problem","authors":"F. C. S. Dias, W. A. Tavares, José Robertty de Freitas Costa","doi":"10.1007/s10732-020-09452-y","DOIUrl":"https://doi.org/10.1007/s10732-020-09452-y","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2020-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09452-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47679269","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
Matheuristics to optimize refueling and maintenance planning of nuclear power plants 优化核电站换料和维修计划的数学
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-09-02 DOI: 10.1007/s10732-020-09450-0
N. Dupin, E. Talbi
{"title":"Matheuristics to optimize refueling and maintenance planning of nuclear power plants","authors":"N. Dupin, E. Talbi","doi":"10.1007/s10732-020-09450-0","DOIUrl":"https://doi.org/10.1007/s10732-020-09450-0","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2020-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09450-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226541","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}
引用次数: 11
Vehicle routing for the urgent delivery of face shields during the COVID-19 pandemic 新冠肺炎大流行期间紧急运送面罩的车辆路线
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-08-18 DOI: 10.1007/s10732-020-09456-8
Joaquín A. Pacheco, M. Laguna
{"title":"Vehicle routing for the urgent delivery of face shields during the COVID-19 pandemic","authors":"Joaquín A. Pacheco, M. Laguna","doi":"10.1007/s10732-020-09456-8","DOIUrl":"https://doi.org/10.1007/s10732-020-09456-8","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2020-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09456-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42247092","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}
引用次数: 23
An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships 平面存储位置分配问题的自适应大邻域搜索启发式算法:在滚装船舶配载规划中的应用
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-08-14 DOI: 10.1007/s10732-020-09451-z
Jone R. Hansen, K. Fagerholt, M. Stålhane, J. G. Rakke
{"title":"An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships","authors":"Jone R. Hansen, K. Fagerholt, M. Stålhane, J. G. Rakke","doi":"10.1007/s10732-020-09451-z","DOIUrl":"https://doi.org/10.1007/s10732-020-09451-z","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2020-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09451-z","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45495908","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}
引用次数: 8
Correction to: A genetic algorithm for finding realistic sea routes considering the weather 修正:一种遗传算法，用于寻找考虑天气的实际海上航线
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-07-23 DOI: 10.1007/s10732-020-09455-9
Stefan Kuhlemann, Kevin Tierney
{"title":"Correction to: A genetic algorithm for finding realistic sea routes considering the weather","authors":"Stefan Kuhlemann, Kevin Tierney","doi":"10.1007/s10732-020-09455-9","DOIUrl":"https://doi.org/10.1007/s10732-020-09455-9","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2020-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09455-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49050693","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}
引用次数: 11
A genetic algorithm for finding realistic sea routes considering the weather 一种遗传算法，用于寻找考虑天气的实际海上航线
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-07-23 DOI: 10.1007/s10732-020-09449-7
Stefan Kuhlemann, K. Tierney
{"title":"A genetic algorithm for finding realistic sea routes considering the weather","authors":"Stefan Kuhlemann, K. Tierney","doi":"10.1007/s10732-020-09449-7","DOIUrl":"https://doi.org/10.1007/s10732-020-09449-7","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2020-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09449-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46717603","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}
引用次数: 6
Bi-criteria multiple knapsack problem with grouped items 具有分组项目的双准则多背包问题
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2020-05-30 DOI: 10.1007/s10732-021-09476-y
F. Castillo-Zunino, P. Keskinocak
{"title":"Bi-criteria multiple knapsack problem with grouped items","authors":"F. Castillo-Zunino, P. Keskinocak","doi":"10.1007/s10732-021-09476-y","DOIUrl":"https://doi.org/10.1007/s10732-021-09476-y","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2020-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09476-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43729541","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
首页 上一页 下一页 尾页
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学术官方微信