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

Journal of Heuristics最新文献

筛选
英文 中文
A systematic approach to parameter optimization and its application to flight schedule simulation software 一种系统的参数优化方法及其在航班调度仿真软件中的应用
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2022-07-05 DOI: 10.1007/s10732-022-09501-8
A. Brownlee, M. Epitropakis, J. Mulder, M. Paelinck, E. Burke
{"title":"A systematic approach to parameter optimization and its application to flight schedule simulation software","authors":"A. Brownlee, M. Epitropakis, J. Mulder, M. Paelinck, E. Burke","doi":"10.1007/s10732-022-09501-8","DOIUrl":"https://doi.org/10.1007/s10732-022-09501-8","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2022-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42828780","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
Fixed set search applied to the multi-objective minimum weighted vertex cover problem 固定集搜索在多目标最小加权顶点覆盖问题中的应用
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2022-05-12 DOI: 10.1007/s10732-022-09499-z
R. Jovanovic, Antonio P. Sanfilippo, S. Voß
{"title":"Fixed set search applied to the multi-objective minimum weighted vertex cover problem","authors":"R. Jovanovic, Antonio P. Sanfilippo, S. Voß","doi":"10.1007/s10732-022-09499-z","DOIUrl":"https://doi.org/10.1007/s10732-022-09499-z","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2022-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48119717","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}
引用次数: 7
Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems 求解稀疏二次型无约束二元优化问题时加速禁忌搜索的数据结构
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2022-04-27 DOI: 10.1007/s10732-022-09498-0
Ricardo N. Liang, Eduardo A. J. Anacleto, C. N. Meneses
{"title":"Data structures for speeding up Tabu Search when solving sparse quadratic unconstrained binary optimization problems","authors":"Ricardo N. Liang, Eduardo A. J. Anacleto, C. N. Meneses","doi":"10.1007/s10732-022-09498-0","DOIUrl":"https://doi.org/10.1007/s10732-022-09498-0","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2022-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46608451","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
Weighted iterated local branching for mathematical programming problems with binary variables 二元变量数学规划问题的加权迭代局部分支
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2022-04-16 DOI: 10.1007/s10732-022-09496-2
Filipe Rodrigues, A. Agra, L. M. Hvattum, C. Requejo
{"title":"Weighted iterated local branching for mathematical programming problems with binary variables","authors":"Filipe Rodrigues, A. Agra, L. M. Hvattum, C. Requejo","doi":"10.1007/s10732-022-09496-2","DOIUrl":"https://doi.org/10.1007/s10732-022-09496-2","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2022-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48716073","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 heuristic search based on diversity for solving combinatorial problems 一种求解组合问题的基于多样性的启发式搜索
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2022-04-04 DOI: 10.1007/s10732-022-09494-4
Francisco Casas, Claudio E. Torres, Ignacio Araya
{"title":"A heuristic search based on diversity for solving combinatorial problems","authors":"Francisco Casas, Claudio E. Torres, Ignacio Araya","doi":"10.1007/s10732-022-09494-4","DOIUrl":"https://doi.org/10.1007/s10732-022-09494-4","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2022-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42461638","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
Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches 自动算法选择:从基于特征到无特征的方法
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2022-03-24 DOI: 10.1007/s10732-022-09505-4
M. Alissa, Kevin Sim, E. Hart
{"title":"Automated Algorithm Selection: from Feature-Based to Feature-Free Approaches","authors":"M. Alissa, Kevin Sim, E. Hart","doi":"10.1007/s10732-022-09505-4","DOIUrl":"https://doi.org/10.1007/s10732-022-09505-4","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2022-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45386508","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}
引用次数: 5
Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks 在无向边加权图中寻找固定长度的电路和循环:在街道网络中的应用
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2022-03-23 DOI: 10.1007/s10732-022-09493-5
Rhyd Lewis, P. Corcoran
{"title":"Finding fixed-length circuits and cycles in undirected edge-weighted graphs: an application with street networks","authors":"Rhyd Lewis, P. Corcoran","doi":"10.1007/s10732-022-09493-5","DOIUrl":"https://doi.org/10.1007/s10732-022-09493-5","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2022-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46203598","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 “The Eighth International Symposium on Information and Communication Technology—SoICT 2017” “第八届信息与通信技术国际研讨会2017”特刊
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2022-03-04 DOI: 10.1007/s10732-022-09492-6
I. Ide, Huynh Thi Thanh Binh
{"title":"Special issue on “The Eighth International Symposium on Information and Communication Technology—SoICT 2017”","authors":"I. Ide, Huynh Thi Thanh Binh","doi":"10.1007/s10732-022-09492-6","DOIUrl":"https://doi.org/10.1007/s10732-022-09492-6","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2022-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46869673","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
Ride matching and vehicle routing for on-demand mobility services 按需出行服务的乘车匹配和车辆路线
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2022-02-19 DOI: 10.1007/s10732-022-09491-7
Sepide Lotfi, K. Abdelghany
{"title":"Ride matching and vehicle routing for on-demand mobility services","authors":"Sepide Lotfi, K. Abdelghany","doi":"10.1007/s10732-022-09491-7","DOIUrl":"https://doi.org/10.1007/s10732-022-09491-7","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2022-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47888990","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 GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem 一种改进禁忌搜索的求解k-子集最大交集问题的GRASP算法
IF 2.7 4区 计算机科学
Journal of Heuristics Pub Date : 2022-02-01 DOI: 10.1007/s10732-022-09490-8
A. Casado, S. Pérez-Peló, J. Sánchez-Oro, A. Duarte
{"title":"A GRASP algorithm with Tabu Search improvement for solving the maximum intersection of k-subsets problem","authors":"A. Casado, S. Pérez-Peló, J. Sánchez-Oro, A. Duarte","doi":"10.1007/s10732-022-09490-8","DOIUrl":"https://doi.org/10.1007/s10732-022-09490-8","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226608","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学术官方微信