Ilias S. Kotsireas, Panos M. Pardalos, Dimitris E. Simos
{"title":"Preface: Selected revised papers from the LION 15 conference","authors":"Ilias S. Kotsireas, Panos M. Pardalos, Dimitris E. Simos","doi":"10.1007/s10472-023-09838-1","DOIUrl":"10.1007/s10472-023-09838-1","url":null,"abstract":"","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 2-3","pages":"107 - 108"},"PeriodicalIF":1.2,"publicationDate":"2023-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09838-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9527531","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}
Shaowen Lan, Wenjuan Fan, Shanlin Yang, Panos M. Pardalos
{"title":"Physician scheduling problem in Mobile Cabin Hospitals of China during Covid-19 outbreak","authors":"Shaowen Lan, Wenjuan Fan, Shanlin Yang, Panos M. Pardalos","doi":"10.1007/s10472-023-09834-5","DOIUrl":"10.1007/s10472-023-09834-5","url":null,"abstract":"<div><p>In this paper, we investigate a novel physician scheduling problem in the Mobile Cabin Hospitals (MCH) which are constructed in Wuhan, China during the outbreak of the Covid-19 pandemic. The shortage of physicians and the surge of patients brought great challenges for physicians scheduling in MCH. The purpose of the studied problem is to get an approximately optimal schedule that reaches the minimum workload for physicians on the premise of satisfying the service requirements of patients as much as possible. We propose a novel hybrid algorithm integrating particle swarm optimization (PSO) and variable neighborhood descent (VND) (named as PSO-VND) to find the approximate global optimal solution. A self-adaptive mechanism is developed to choose the updating operators dynamically during the procedures. Based on the special features of the problem, three neighborhood structures are designed and searched in VND to improve the solution. The experimental comparisons show that the proposed PSO-VND has a significant performance increase than the other competitors.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"91 2-3","pages":"349 - 372"},"PeriodicalIF":1.2,"publicationDate":"2023-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09834-5.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9517769","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}