Opportunistic Self Organizing Migrating Algorithm for RealTime Dynamic Traveling Salesman Problem
This topic contains 0 replies, has 1 voice, and was last updated by arXiv 1 year, 7 months ago.

Opportunistic Self Organizing Migrating Algorithm for RealTime Dynamic Traveling Salesman Problem
Self Organizing Migrating Algorithm (SOMA) is a metaheuristic algorithm based on the selforganizing behavior of individuals in a simulated social environment. SOMA performs iterative computations on a population of potential solutions in the given search space to obtain an optimal solution. In this paper, an Opportunistic Self Organizing Migrating Algorithm (OSOMA) has been proposed that introduces a novel strategy to generate perturbations effectively. This strategy allows the individual to span across more possible solutions and thus, is able to produce better solutions. A comprehensive analysis of OSOMA on multidimensional unconstrained benchmark test functions is performed. OSOMA is then applied to solve realtime Dynamic Traveling Salesman Problem (DTSP). The problem of realtime DTSP has been stipulated and simulated using realtime data from Google Maps with a varying costmetric between any two cities. Although DTSP is a very common and intuitive model in the real world, its presence in literature is still very limited. OSOMA performs exceptionally well on the problems mentioned above. To substantiate this claim, the performance of OSOMA is compared with SOMA, Differential Evolution and Particle Swarm Optimization.
Opportunistic Self Organizing Migrating Algorithm for RealTime Dynamic Traveling Salesman Problem
by Shubham Dokania, Sunyam Bagga, Rohit Sharma
https://arxiv.org/pdf/1709.03793v1.pdf
You must be logged in to reply to this topic.