Journal of Heuristics最新文献

筛选
英文 中文
Vehicle routing for the urgent delivery of face shields during the COVID-19 pandemic. 新冠肺炎大流行期间紧急运送面罩的车辆路线
IF 1.1 4区 计算机科学
Journal of Heuristics Pub Date : 2020-01-01 Epub Date: 2020-08-18 DOI: 10.1007/s10732-020-09456-8
Joaquín Pacheco, Manuel Laguna
{"title":"Vehicle routing for the urgent delivery of face shields during the COVID-19 pandemic.","authors":"Joaquín Pacheco, Manuel Laguna","doi":"10.1007/s10732-020-09456-8","DOIUrl":"10.1007/s10732-020-09456-8","url":null,"abstract":"<p><p>The speed by which the COVID-19 pandemic spread throughout the world caught some national and local governments unprepared. Healthcare systems found themselves struggling to increase capacity and procure key supplies, such as personal protective equipment. Protective face shields became essential for healthcare professionals. However, most hospitals and healthcare facilities did not have them in adequate quantities. The urgency of producing and delivering face shields increased as the number of COVID-19 cases rapidly multiplied. This was the situation that we encountered in the city and province of Burgos (Spain). Since there was no time to wait for a large manufacturer to produce face shields, private citizens and small companies volunteered to make them using technologies such as 3D printers. Nonprofits, citizens, and governments agencies volunteered to deliver materials to the face shield makers and to pick up and deliver the face shields to health centers and other locations where they were needed. This resulted in a vehicle routing problem with some special characteristics that made it different from models used for commercial purposes. We describe the development of a heuristic to find feasible and efficient routes for this problem. We highlight the advantages of using heuristics in an emergency context like the one triggered by the COVID-19 pandemic. In particular, the heuristic approach allowed us to design, implement, test, and delivery a routing system in less than 1 week from the time that the local government contacted us with what they described as a logistics nightmare.</p>","PeriodicalId":54810,"journal":{"name":"Journal of Heuristics","volume":"26 1","pages":"619-635"},"PeriodicalIF":1.1,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7431282/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42247092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A hybrid genetic algorithm for the traveling salesman problem with drone 无人机旅行商问题的混合遗传算法
IF 2.7 4区 计算机科学
Journal of Heuristics 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区 计算机科学
Journal of Heuristics 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
Focus distance-aware lifetime maximization of video camera-based wireless sensor networks 基于视频摄像机的无线传感器网络的焦距感知寿命最大化
IF 2.7 4区 计算机科学
Journal of Heuristics 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区 计算机科学
Journal of Heuristics 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区 计算机科学
Journal of Heuristics 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区 计算机科学
Journal of Heuristics 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区 计算机科学
Journal of Heuristics 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区 计算机科学
Journal of Heuristics 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区 计算机科学
Journal of Heuristics 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
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书