首页 > 最新文献

Journal of Heuristics最新文献

英文 中文
A matheuristic for the stochastic facility location problem 随机设施选址问题的数学模型
IF 2.7 4区 计算机科学 Q1 Mathematics
Journal of Heuristics
Pub Date : 2021-02-26 DOI: 10.1007/s10732-021-09468-y
Renata Turkeš, K. Sörensen, D. Cuervo
{"title":"A matheuristic for the stochastic facility location problem","authors":"Renata Turkeš, K. Sörensen, D. Cuervo","doi":"10.1007/s10732-021-09468-y","DOIUrl":"https://doi.org/10.1007/s10732-021-09468-y","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2021-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09468-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49018211","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
Enhancing large neighbourhood search heuristics for Benders’ decomposition 增强Benders分解的大邻域搜索启发式算法
IF 2.7 4区 计算机科学 Q1 Mathematics
Journal of Heuristics
Pub Date : 2021-02-23 DOI: 10.1007/s10732-021-09467-z
Stephen J. Maher
{"title":"Enhancing large neighbourhood search heuristics for Benders’ decomposition","authors":"Stephen J. Maher","doi":"10.1007/s10732-021-09467-z","DOIUrl":"https://doi.org/10.1007/s10732-021-09467-z","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2021-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09467-z","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49462992","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
Reference point based evolutionary multi-objective optimization algorithms with convergence properties using KKTPM and ASF metrics 基于KKTPM和ASF度量的具有收敛性的基于参考点的进化多目标优化算法
IF 2.7 4区 计算机科学 Q1 Mathematics
Journal of Heuristics
Pub Date : 2021-02-19 DOI: 10.1007/s10732-021-09470-4
M. Abouhawwash, K. Deb
{"title":"Reference point based evolutionary multi-objective optimization algorithms with convergence properties using KKTPM and ASF metrics","authors":"M. Abouhawwash, K. Deb","doi":"10.1007/s10732-021-09470-4","DOIUrl":"https://doi.org/10.1007/s10732-021-09470-4","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2021-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09470-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45000607","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
Analysis of Bayesian Network Learning Techniques for a Hybrid Multi-objective Bayesian Estimation of Distribution Algorithm: a case study on MNK Landscape 混合多目标贝叶斯分布估计贝叶斯网络学习技术分析——以MNK景观为例
IF 2.7 4区 计算机科学 Q1 Mathematics
Journal of Heuristics
Pub Date : 2021-02-06 DOI: 10.1007/s10732-021-09469-x
M. Martins, Mohamed El Yafrani, M. Delgado, R. Lüders, Roberto Santana, H. Siqueira, H. G. Akcay, B. Ahiod
{"title":"Analysis of Bayesian Network Learning Techniques for a Hybrid Multi-objective Bayesian Estimation of Distribution Algorithm: a case study on MNK Landscape","authors":"M. Martins, Mohamed El Yafrani, M. Delgado, R. Lüders, Roberto Santana, H. Siqueira, H. G. Akcay, B. Ahiod","doi":"10.1007/s10732-021-09469-x","DOIUrl":"https://doi.org/10.1007/s10732-021-09469-x","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2021-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09469-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48946169","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}
引用次数: 9
Augmented intuition: a bridge between theory and practice 增强直觉:理论与实践之间的桥梁
IF 2.7 4区 计算机科学 Q1 Mathematics
Journal of Heuristics
Pub Date : 2021-01-31 DOI: 10.1007/s10732-020-09465-7
P. Moscato, Luke Mathieson, Mohammad Nazmul Haque
{"title":"Augmented intuition: a bridge between theory and practice","authors":"P. Moscato, Luke Mathieson, Mohammad Nazmul Haque","doi":"10.1007/s10732-020-09465-7","DOIUrl":"https://doi.org/10.1007/s10732-020-09465-7","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2021-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09465-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41626874","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
Weighted proximity search 加权接近搜索
IF 2.7 4区 计算机科学 Q1 Mathematics
Journal of Heuristics
Pub Date : 2021-01-30 DOI: 10.1007/s10732-021-09466-0
Filipe Rodrigues, A. Agra, L. M. Hvattum, C. Requejo
{"title":"Weighted proximity search","authors":"Filipe Rodrigues, A. Agra, L. M. Hvattum, C. Requejo","doi":"10.1007/s10732-021-09466-0","DOIUrl":"https://doi.org/10.1007/s10732-021-09466-0","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2021-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-021-09466-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48924990","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
Anisotropic Q-learning and waiting estimation based real-time routing for automated guided vehicles at container terminals 基于各向异性q学习和等待估计的集装箱码头自动导引车实时路由
IF 2.7 4区 计算机科学 Q1 Mathematics
Journal of Heuristics
Pub Date : 2021-01-13 DOI: 10.1007/s10732-020-09463-9
Pengfei Zhou, Li Lin, Kap-Hwan Kim
{"title":"Anisotropic Q-learning and waiting estimation based real-time routing for automated guided vehicles at container terminals","authors":"Pengfei Zhou, Li Lin, Kap-Hwan Kim","doi":"10.1007/s10732-020-09463-9","DOIUrl":"https://doi.org/10.1007/s10732-020-09463-9","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09463-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42298565","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
A max-conflicts based heuristic search for the stable marriage problem with ties and incomplete lists 基于最大冲突的不完全列表约束下稳定婚姻问题的启发式搜索
IF 2.7 4区 计算机科学 Q1 Mathematics
Journal of Heuristics
Pub Date : 2021-01-06 DOI: 10.1007/s10732-020-09464-8
Hoang Huu Viet, Nguyen Thi Uyen, SeungGwan Lee, TaeChoong Chung, Le Hong Trang

In this paper, we propose a heuristic search algorithm based on maximum conflicts to find a weakly stable matching of maximum size for the stable marriage problem with ties and incomplete lists. The key idea of our approach is to define a heuristic function based on the information extracted from undominated blocking pairs from the men’s point of view. By choosing a man corresponding to the maximum value of the heuristic function, we aim to not only remove all the blocking pairs formed by the man but also reject as many blocking pairs as possible for an unstable matching from the women’s point of view to obtain a solution of the problem as quickly as possible. Experiments show that our algorithm is efficient in terms of both execution time and solution quality for solving the problem.

本文提出了一种基于最大冲突的启发式搜索算法，用于寻找带不完全链表的稳定婚姻问题的最大大小弱稳定匹配。我们的方法的关键思想是定义一个启发式函数，该函数基于从男性的角度从非支配阻塞对中提取的信息。通过选择启发式函数最大值所对应的男性，我们不仅要去除男性形成的所有阻塞对，而且要从女性的角度尽可能多地拒绝不稳定匹配的阻塞对，以尽快得到问题的解。实验表明，该算法在求解问题的执行时间和求解质量方面都是有效的。
{"title":"A max-conflicts based heuristic search for the stable marriage problem with ties and incomplete lists","authors":"Hoang Huu Viet, Nguyen Thi Uyen, SeungGwan Lee, TaeChoong Chung, Le Hong Trang","doi":"10.1007/s10732-020-09464-8","DOIUrl":"https://doi.org/10.1007/s10732-020-09464-8","url":null,"abstract":"<p>In this paper, we propose a heuristic search algorithm based on maximum conflicts to find a weakly stable matching of maximum size for the stable marriage problem with ties and incomplete lists. The key idea of our approach is to define a heuristic function based on the information extracted from undominated blocking pairs from the men’s point of view. By choosing a man corresponding to the maximum value of the heuristic function, we aim to not only remove all the blocking pairs formed by the man but also reject as many blocking pairs as possible for an unstable matching from the women’s point of view to obtain a solution of the problem as quickly as possible. Experiments show that our algorithm is efficient in terms of both execution time and solution quality for solving the problem.\u0000</p>","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2021-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138527656","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
CMSA algorithm for solving the prioritized pairwise test data generation problem in software product lines 求解软件产品线中优先成对测试数据生成问题的CMSA算法
IF 2.7 4区 计算机科学 Q1 Mathematics
Journal of Heuristics
Pub Date : 2020-11-10 DOI: 10.1007/s10732-020-09462-w
Javier Ferrer, F. Chicano, José Antonio Ortega-Toro
{"title":"CMSA algorithm for solving the prioritized pairwise test data generation problem in software product lines","authors":"Javier Ferrer, F. Chicano, José Antonio Ortega-Toro","doi":"10.1007/s10732-020-09462-w","DOIUrl":"https://doi.org/10.1007/s10732-020-09462-w","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09462-w","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226565","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
Iterated local search for single machine total weighted tardiness batch scheduling 单机总加权延迟批量调度的迭代局部搜索
IF 2.7 4区 计算机科学 Q1 Mathematics
Journal of Heuristics
Pub Date : 2020-11-09 DOI: 10.1007/s10732-020-09461-x
Eduardo Queiroga, Rian G. S. Pinheiro, Quentin Christ, A. Subramanian, A. Pessoa
{"title":"Iterated local search for single machine total weighted tardiness batch scheduling","authors":"Eduardo Queiroga, Rian G. S. Pinheiro, Quentin Christ, A. Subramanian, A. Pessoa","doi":"10.1007/s10732-020-09461-x","DOIUrl":"https://doi.org/10.1007/s10732-020-09461-x","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":null,"pages":null},"PeriodicalIF":2.7,"publicationDate":"2020-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09461-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41386945","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}
引用次数: 14
首页 上一页 下一页 尾页
类型
全部 化学•材料 生命科学 医学 物理 工程技术 环境•农林 材料科学 地球科学 法学 管理学 化学 环境科学与生态学 计算机科学 教育学 经济学 农林科学 人文科学 生物学 数学 物理与天体物理 心理学 综合性期刊 其他 工业工程 理学 历史学 农学 文学 信息工程
数据库
全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley
期刊
Journal of Heuristics
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们：info@booksci.cn
Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1