Random Gravitation lEmulation Search Algorithm (R GES) in Schedu ling Traveling alesperson Problem

this article proposes a new algorithm for finding a good filihlzfliia approximate set of non—dominated solutions to tackle the generalized traveling salesperson problem. Random gravitational emulation search algorithm (RGES) is presented to solve the traveling salesman problem. The algorithm is based on random search concepts and uses two parameters. speed and force of gravity in physics. The proposed algorithm is compared with genetic algorithm, and experimental results show that the proposed algorithm has better performance and less runtime to be answered.

کلیدواژه ها:

gravitational emulation search ، force of gravity ، traveling salesperson problem