Discrete bat algorithm for solving minimum ratio traveling salesman problem.

This paper studied minimum ratio traveling salesman problem (MRTSP), which objective function was the ratio between the total distances and total benefits, and presented a discrete bat algorithm for solving MRTSP. In this improved bat algorithm, on the one hand, it redefined the subtraction operator of location and location, the multiplication operator of real number and location, and the addition operator of velocity and location. On the other hand, it introduced the reversing the city subsequence in order to perform the route's local search. The experimental results show that this improved bat algorithm is feasible and can effectively solve the MRTSP instances. [ABSTRACT FROM AUTHOR]