การออกแบบและพัฒนาขั้นตอนวิธีแบบเมตาฮิวริสติก สำหรับการวางแผนการเดินทางท่องเที่ยวที่คำนึงถึงเวลาเป็นสำคัญ

Abstract

บทคัดย่อไม่สมบูรณ์

The development of a metaheuristic algorithm for travel routing problem under the limited time constraint

This paper presents the development of a metaheuristic algorithm for travelling the routing problem under the limited time constraint. The objective of this study is to develop the algorithm for travelling the planning in order to balance the limited time and the requested destinations by facilitating travelers to reach destinations as much as possible under the limited time constraint. This paper proposed the hybrid algorithm between simulated annealing algorithm (SA) and DijkstraXs algorithm for the selected initial solution process. The performance of the proposed algorithm was compared with the classical SA algorithm. The experimental results indicated that the CPU time and the quality of solution of our hybrid algorithm is explicit better, especially in the large size of destinations dataset.