OOSP (Off-On Sources Problem)

Complicated uncertain problems and their solutions that are often inspired by nature are created in various areas of basic and engineering sciences to help people. In this paper the introduced issue is a simulation of the real world to solve computational problems using optimization algorithms. In the proposed problem a person in a city considers some sources as daily visits and starts from a source and visits all the sources in the same day. Every day a number of sources are turned off and they cannot be visited in the same day. At the end of specific number of days that person should be able to minimize the number of visits and visit them as least as possible. This problem is simulated in MATLAB simulation software as offline and the theoretical solution is presented by heuristic.

کلیدواژه ها:

Problem ، Algorithm ، Source ، Node ، cycle