A Hybrid Firefly and Local Search Algorithms to Solve Orienteering Problems

Abstract

A satisfied customer is a goal for every tourism agency who put efforts designing a tour route for its customers. The resulting problem often called an orienteering problem attempts to design a route that maximizes customer's value for all destinations. We propose a firefly algorithm combined with a hybrid of local search algorithms to solve the problem. Our finding however suggests that firefly algorithms cannot outperform Ant Colony (AC) and Genetic Algorithm (GA).