การแก้ปัญหาการจัดส่งเลือดด้วยวิธีไฮบริดการค้นหาแบบนกกาเหว่า

Abstract

This research proposes the hybrid method between Cuckoo Search, Tabu Search and Neighborhood Search that called the hybrid cuckoo search. The proposed algorithm solves blood routing problem from Chiang Mai blood donation center to hospitals in the responsible area. The aim of this research is to minimize the distances for blood transportation. There are three sizes of comparing dataset to measure the hybrid cuckoo search performance. The design of the experiment and the variance analysis were used to find the appropriate parameters. The hybrid cuckoo search can get the better solution than the Genetic algorithm, Cuckoo search and artificial chemical reaction optimization algorithm in the large problem by 150, 16 and 12 km, respectively.