首页 > 最新文献

Journal of Heuristics最新文献

英文 中文
Focus distance-aware lifetime maximization of video camera-based wireless sensor networks 基于视频摄像机的无线传感器网络的焦距感知寿命最大化
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2019-09-27 DOI: 10.1007/s10732-019-09428-7
A. Rossi, Ashutosh Kumar Singh, M. Sevaux
{"title":"Focus distance-aware lifetime maximization of video camera-based wireless sensor networks","authors":"A. Rossi, Ashutosh Kumar Singh, M. Sevaux","doi":"10.1007/s10732-019-09428-7","DOIUrl":"https://doi.org/10.1007/s10732-019-09428-7","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"5 - 30"},"PeriodicalIF":2.7,"publicationDate":"2019-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-019-09428-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44247890","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
A comparative study of multi-objective machine reassignment algorithms for data centres 数据中心多目标机器再分配算法的比较研究
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2019-09-20 DOI: 10.1007/s10732-019-09427-8
Takfarinas Saber, X. Gandibleux, Michael O’Neill, Liam Murphy, Anthony Ventresque
{"title":"A comparative study of multi-objective machine reassignment algorithms for data centres","authors":"Takfarinas Saber, X. Gandibleux, Michael O’Neill, Liam Murphy, Anthony Ventresque","doi":"10.1007/s10732-019-09427-8","DOIUrl":"https://doi.org/10.1007/s10732-019-09427-8","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"28 7 1","pages":"119 - 150"},"PeriodicalIF":2.7,"publicationDate":"2019-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-019-09427-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226356","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
Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem 混合车队异构叫车问题的混合自适应大邻域搜索算法
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2019-09-09 DOI: 10.1007/s10732-019-09424-x
M. Masmoudi, M. Hosny, E. Demir, E. Pesch
{"title":"Hybrid adaptive large neighborhood search algorithm for the mixed fleet heterogeneous dial-a-ride problem","authors":"M. Masmoudi, M. Hosny, E. Demir, E. Pesch","doi":"10.1007/s10732-019-09424-x","DOIUrl":"https://doi.org/10.1007/s10732-019-09424-x","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"26 1","pages":"83 - 118"},"PeriodicalIF":2.7,"publicationDate":"2019-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-019-09424-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41942778","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}
引用次数: 22
The vehicle routing problem with cross-docking and resource constraints 具有交叉停靠和资源约束的车辆路径问题
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2019-08-29 DOI: 10.1007/s10732-019-09423-y
P. Grangier, M. Gendreau, Fabien Lehuédé, Louis-Martin Rousseau
{"title":"The vehicle routing problem with cross-docking and resource constraints","authors":"P. Grangier, M. Gendreau, Fabien Lehuédé, Louis-Martin Rousseau","doi":"10.1007/s10732-019-09423-y","DOIUrl":"https://doi.org/10.1007/s10732-019-09423-y","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"27 1","pages":"31 - 61"},"PeriodicalIF":2.7,"publicationDate":"2019-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-019-09423-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49305223","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}
引用次数: 19
Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances 用于在多个问题实例上对多种算法进行实验比较的样本量计算
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2019-08-05 DOI: 10.1007/s10732-020-09454-w
F. Campelo, E. Wanner
{"title":"Sample size calculations for the experimental comparison of multiple algorithms on multiple problem instances","authors":"F. Campelo, E. Wanner","doi":"10.1007/s10732-020-09454-w","DOIUrl":"https://doi.org/10.1007/s10732-020-09454-w","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"26 1","pages":"851 - 883"},"PeriodicalIF":2.7,"publicationDate":"2019-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09454-w","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45952695","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 coordinated production and transportation scheduling problem with minimum sum of order delivery times 以最小订单交付时间协调生产和运输调度问题
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2019-07-25 DOI: 10.1007/s10732-019-09420-1
Ling Liu, Wenli Li, Kunpeng Li, X. Zou
{"title":"A coordinated production and transportation scheduling problem with minimum sum of order delivery times","authors":"Ling Liu, Wenli Li, Kunpeng Li, X. Zou","doi":"10.1007/s10732-019-09420-1","DOIUrl":"https://doi.org/10.1007/s10732-019-09420-1","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"26 1","pages":"33 - 58"},"PeriodicalIF":2.7,"publicationDate":"2019-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-019-09420-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226322","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}
引用次数: 16
Predicting effective control parameters for differential evolution using cluster analysis of objective function features 利用目标函数特征聚类分析预测差分进化的有效控制参数
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2019-06-20 DOI: 10.1007/s10732-019-09419-8
S. P. Walton, M. R. Brown
{"title":"Predicting effective control parameters for differential evolution using cluster analysis of objective function features","authors":"S. P. Walton, M. R. Brown","doi":"10.1007/s10732-019-09419-8","DOIUrl":"https://doi.org/10.1007/s10732-019-09419-8","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"25 1","pages":"1015 - 1031"},"PeriodicalIF":2.7,"publicationDate":"2019-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-019-09419-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226250","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
Dynamic heuristic acceleration of linearly approximated SARSA(λdocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$lambda 线性逼近SARSA的动态启发式加速(λdocumentclass[12pt]{minimal} uspackage {amsmath} uspackage {wasysym} uspackage {amsfonts} uspackage {amssymb} uspackage {amssysy} uspackage {mathrsfs} uspackage {upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$lambda)
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2019-05-03 DOI: 10.1007/s10732-019-09408-x
S. Bromuri
{"title":"Dynamic heuristic acceleration of linearly approximated SARSA(λdocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} begin{document}$$lambda","authors":"S. Bromuri","doi":"10.1007/s10732-019-09408-x","DOIUrl":"https://doi.org/10.1007/s10732-019-09408-x","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"25 1","pages":"901 - 932"},"PeriodicalIF":2.7,"publicationDate":"2019-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-019-09408-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226086","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
Cascading failures in complex networks caused by overload attacks 过载攻击导致的复杂网络级联故障
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2019-05-02 DOI: 10.1007/s10732-019-09413-0
V. Turau, C. Weyer
{"title":"Cascading failures in complex networks caused by overload attacks","authors":"V. Turau, C. Weyer","doi":"10.1007/s10732-019-09413-0","DOIUrl":"https://doi.org/10.1007/s10732-019-09413-0","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"25 1","pages":"837 - 859"},"PeriodicalIF":2.7,"publicationDate":"2019-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-019-09413-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52226225","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 multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs 无向图哈密顿补全问题的多起点局部搜索算法
IF 2.7 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2019-04-24 DOI: 10.1007/s10732-020-09447-9
Jorik Jooken, Pieter Leyman, P. De Causmaecker
{"title":"A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs","authors":"Jorik Jooken, Pieter Leyman, P. De Causmaecker","doi":"10.1007/s10732-020-09447-9","DOIUrl":"https://doi.org/10.1007/s10732-020-09447-9","url":null,"abstract":"","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"26 1","pages":"743 - 769"},"PeriodicalIF":2.7,"publicationDate":"2019-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10732-020-09447-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41720334","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
期刊
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