<![CDATA[This study optimizes tourist routes across 14 destinations in the city of Medan using the Biogeography-Based Optimization (BBO) algorithm. The problem is formulated as a closed-path Traveling Salesman Problem (TSP) with an extension allowing for flexibility in freely selecting the starting point. The route is determined based on the distance between two locations, where the distance is assumed to be asymmetric to account for real-world urban road conditions such as one-way systems, while ignoring traffic conditions and other costs. Simulation results show that even though the starting point is freely determined, the BBO algorithm is still able to consistently produce routes that are close to optimal with stable convergence. The main contribution of this study is the provision of an adaptive and realistic route planning model to support tourism information systems in urban areas.]]>
Copyrights © 2026
