Application of Ant Colony Optimization for Solving Talent Scheduling Problem

In this work, the application of ant colony optimization for solving talent scheduling problem (tsp) is studied. The tsp is an NP-hard problem. In tsp the objective is to performscheduling of a set of independent activities of a project in such a way that the cost of keeping talents (actors) on the project site is minimized. The proposed method shows efficiency on solving this problem and good results is obtained on a set of benchmarks

کلیدواژه ها:

Ant colony optimization ، Talent scheduling problem ، scenes sequencing problem