The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...

The paper proposes routing algorithm for VANET (Vehicular AdHoc Network) based on Ad-hoc on Demand Distance Vector (AODV) and Optimize Link State Routing Algorithm (OLSR) protocol. The algorithm implemented enables the way for optimization of the routing parameters. The algorithm takes into account the merits and demerits of both the protocols in the city and highway scenarios to implement an e...