首页 > 最新文献

Journal of Heuristics最新文献

英文 中文
Distance-guided local search 距离引导本地搜索
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2020-05-26 DOI: 10.1007/s10732-020-09446-w
D. Porumbel, Jin-Kao Hao
{"title":"Distance-guided local search","authors":"D. Porumbel, Jin-Kao Hao","doi":"10.1007/s10732-020-09446-w","DOIUrl":"https://doi.org/10.1007/s10732-020-09446-w","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"26 1","pages":"711 - 741"},"PeriodicalIF":2.7,"publicationDate":"2020-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09446-w","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226528","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
Heuristic/meta-heuristic methods for restricted bin packing problem 受限装箱问题的启发式/元启发式方法
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2020-03-30 DOI: 10.1007/s10732-020-09444-y
Yu Fu, A. Banerjee
{"title":"Heuristic/meta-heuristic methods for restricted bin packing problem","authors":"Yu Fu, A. Banerjee","doi":"10.1007/s10732-020-09444-y","DOIUrl":"https://doi.org/10.1007/s10732-020-09444-y","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"35 1","pages":"637 - 662"},"PeriodicalIF":2.7,"publicationDate":"2020-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09444-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226509","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
Meta-heuristics for the one-dimensional cutting stock problem with usable leftover 带可用余量的一维切削料问题的元启发式
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2020-03-03 DOI: 10.1007/s10732-020-09443-z
S. V. Ravelo, C. N. Meneses, M. Santos
{"title":"Meta-heuristics for the one-dimensional cutting stock problem with usable leftover","authors":"S. V. Ravelo, C. N. Meneses, M. Santos","doi":"10.1007/s10732-020-09443-z","DOIUrl":"https://doi.org/10.1007/s10732-020-09443-z","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"26 1","pages":"585 - 618"},"PeriodicalIF":2.7,"publicationDate":"2020-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09443-z","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45230482","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
An automatic constructive matheuristic for the shift minimization personnel task scheduling problem 班值最小化人员任务调度问题的自动构造数学
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2020-02-13 DOI: 10.1007/s10732-020-09439-9
Reshma Chirayil Chandrasekharan, Pieter Smet, T. Wauters
{"title":"An automatic constructive matheuristic for the shift minimization personnel task scheduling problem","authors":"Reshma Chirayil Chandrasekharan, Pieter Smet, T. Wauters","doi":"10.1007/s10732-020-09439-9","DOIUrl":"https://doi.org/10.1007/s10732-020-09439-9","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"205 - 227"},"PeriodicalIF":2.7,"publicationDate":"2020-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09439-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226485","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
A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem 基于非支配排序的双目标行窃问题的自定义随机密钥遗传算法
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2020-02-11 DOI: 10.1007/s10732-020-09457-7
Jonatas B. C. Chagas, Julian Blank, Markus Wagner, M. Souza, K. Deb
{"title":"A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem","authors":"Jonatas B. C. Chagas, Julian Blank, Markus Wagner, M. Souza, K. Deb","doi":"10.1007/s10732-020-09457-7","DOIUrl":"https://doi.org/10.1007/s10732-020-09457-7","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"267 - 301"},"PeriodicalIF":2.7,"publicationDate":"2020-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09457-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45294267","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
MIP neighborhood search heuristics for a service network design problem with design-balanced requirements 具有设计平衡需求的服务网络设计问题的MIP邻域搜索启发式
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2020-02-04 DOI: 10.1007/s10732-020-09437-x
N. Katayama
{"title":"MIP neighborhood search heuristics for a service network design problem with design-balanced requirements","authors":"N. Katayama","doi":"10.1007/s10732-020-09437-x","DOIUrl":"https://doi.org/10.1007/s10732-020-09437-x","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"26 1","pages":"475 - 502"},"PeriodicalIF":2.7,"publicationDate":"2020-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09437-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226461","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
The convex hull heuristic for nonlinear integer programming problems with linear constraints and application to quadratic 0–1 problems 线性约束非线性整数规划问题的凸壳启发式及其在二次0-1问题中的应用
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2020-01-06 DOI: 10.1007/s10732-019-09433-w
M. Guignard, Aykut Ahlatçioglu
{"title":"The convex hull heuristic for nonlinear integer programming problems with linear constraints and application to quadratic 0–1 problems","authors":"M. Guignard, Aykut Ahlatçioglu","doi":"10.1007/s10732-019-09433-w","DOIUrl":"https://doi.org/10.1007/s10732-019-09433-w","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"251 - 265"},"PeriodicalIF":2.7,"publicationDate":"2020-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-019-09433-w","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226422","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
Learning fine-grained search space pruning and heuristics for combinatorial optimization 用于组合优化的细粒度搜索空间修剪和启发式学习
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2020-01-05 DOI: 10.1007/s10732-023-09512-z
Juho Lauri, Sourav Dutta, Marco Grassia, Deepak Ajwani
{"title":"Learning fine-grained search space pruning and heuristics for combinatorial optimization","authors":"Juho Lauri, Sourav Dutta, Marco Grassia, Deepak Ajwani","doi":"10.1007/s10732-023-09512-z","DOIUrl":"https://doi.org/10.1007/s10732-023-09512-z","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"29 1","pages":"313 - 347"},"PeriodicalIF":2.7,"publicationDate":"2020-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49477957","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
A hybrid genetic algorithm for the traveling salesman problem with drone 无人机旅行商问题的混合遗传算法
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2019-11-13 DOI: 10.1007/s10732-019-09431-y
Quang Minh Ha, Y. Deville, Quang Dung Pham, Minh Hoàng Hà
{"title":"A hybrid genetic algorithm for the traveling salesman problem with drone","authors":"Quang Minh Ha, Y. Deville, Quang Dung Pham, Minh Hoàng Hà","doi":"10.1007/s10732-019-09431-y","DOIUrl":"https://doi.org/10.1007/s10732-019-09431-y","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"26 1","pages":"219 - 247"},"PeriodicalIF":2.7,"publicationDate":"2019-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-019-09431-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226395","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}
引用次数: 95
Heuristics for a vehicle routing problem with information collection in wireless networks 无线网络中具有信息收集的车辆路由问题的启发式算法
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2019-10-24 DOI: 10.1007/s10732-019-09429-6
Luis Ernesto Flores Luyo, A. Agra, R. Figueiredo, Eladio Ocaña Anaya
{"title":"Heuristics for a vehicle routing problem with information collection in wireless networks","authors":"Luis Ernesto Flores Luyo, A. Agra, R. Figueiredo, Eladio Ocaña Anaya","doi":"10.1007/s10732-019-09429-6","DOIUrl":"https://doi.org/10.1007/s10732-019-09429-6","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"26 1","pages":"187 - 217"},"PeriodicalIF":2.7,"publicationDate":"2019-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-019-09429-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226371","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
期刊
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