Please use this identifier to cite or link to this item:
Full metadata record
|dc.description.abstract||© 2017 IEEE. Healthcare staff routing to provide healthcare service to the patients is one of the real-world scheduling problems similar to multiple travelling salesman problems (MTSP). Healthcare staff members provide daily medical services at patients' homes. The service provider authority has to schedule these staff in an effective and efficient way so that it achieves the minimum total cost. The aim of this study is to propose an Adaptive Local Search based on Genetic Algorithm (GA) to solve Healthcare Staff Routing Problem. Two new types of Adaptive Local Searches have been proposed to explore the optimal solutions. Also, Immigrant Scheme has been applied to improve the performance of the proposed GA. With this feature, we make an effort to motivate the GA to replace population occasionally by calling the best GA chromosome when the GA struggles at the local optimal solution. By the proposed algorithm, an effective routing schedule for staff members is generated. Our empirical study demonstrates that the proposed GA with Adaptive Local Search and Immigrant Scheme outperforms its rival methods in terms of the sum of distances.||en_US|
|dc.subject||Arts and Humanities||en_US|
|dc.title||Healthcare Staff Routing Problem using adaptive Genetic Algorithms with Adaptive Local Search and Immigrant Scheme||en_US|
|article.title.sourcetitle||2nd Joint International Conference on Digital Arts, Media and Technology 2017: Digital Economy for Sustainable Growth, ICDAMT 2017||en_US|
|article.stream.affiliations||University of the West of Scotland||en_US|
|article.stream.affiliations||Chiang Mai University||en_US|
|article.stream.affiliations||Phramongkutklao College of Medicine||en_US|
|Appears in Collections:||CMUL: Journal Articles|
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.