{"title":"一种用于家庭护理护士调度的模拟变态算法","authors":"M. Mutingi, C. Mbohwa","doi":"10.1109/IEEM.2014.7058657","DOIUrl":null,"url":null,"abstract":"Inspired by the biological concepts of metamorphosis evolution, this paper presents a novel simulated metamorphosis (SM) algorithm for solving the homecare nurse scheduling problem in a fuzzy environment. The algorithm is motivated by the need for interactive, multi-objective, and efficient optimization approaches to solving problems with fuzzy conflicting goals and constraints. The SM goes through initialization, growth, and maturation phases, mimicking the metamorphosis process. Initialization generates a candidate solution which successively goes through growth and maturation loops. Comparative computational tests on benchmark problems show that, when compared to other algorithms, SM is more efficient and effective, producing near-optimal solutions within reasonable computation times.","PeriodicalId":318405,"journal":{"name":"2014 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A novel simulated metamorphosis algorithm for homecare nurse scheduling\",\"authors\":\"M. Mutingi, C. Mbohwa\",\"doi\":\"10.1109/IEEM.2014.7058657\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Inspired by the biological concepts of metamorphosis evolution, this paper presents a novel simulated metamorphosis (SM) algorithm for solving the homecare nurse scheduling problem in a fuzzy environment. The algorithm is motivated by the need for interactive, multi-objective, and efficient optimization approaches to solving problems with fuzzy conflicting goals and constraints. The SM goes through initialization, growth, and maturation phases, mimicking the metamorphosis process. Initialization generates a candidate solution which successively goes through growth and maturation loops. Comparative computational tests on benchmark problems show that, when compared to other algorithms, SM is more efficient and effective, producing near-optimal solutions within reasonable computation times.\",\"PeriodicalId\":318405,\"journal\":{\"name\":\"2014 IEEE International Conference on Industrial Engineering and Engineering Management\",\"volume\":\"46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE International Conference on Industrial Engineering and Engineering Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEEM.2014.7058657\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Industrial Engineering and Engineering Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEM.2014.7058657","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A novel simulated metamorphosis algorithm for homecare nurse scheduling
Inspired by the biological concepts of metamorphosis evolution, this paper presents a novel simulated metamorphosis (SM) algorithm for solving the homecare nurse scheduling problem in a fuzzy environment. The algorithm is motivated by the need for interactive, multi-objective, and efficient optimization approaches to solving problems with fuzzy conflicting goals and constraints. The SM goes through initialization, growth, and maturation phases, mimicking the metamorphosis process. Initialization generates a candidate solution which successively goes through growth and maturation loops. Comparative computational tests on benchmark problems show that, when compared to other algorithms, SM is more efficient and effective, producing near-optimal solutions within reasonable computation times.