Solve the film-copy deliverer problem using ant colony system

The film-copy deliverer problem (FDP) was presented in 1993. Since then, there has been two main algorithms to solve it: in the first algorithm, one transforms FDP into TSP and then solves it; in the second one uses a special genetic algorithm established by Cheng, R.W. & Gen, M. in 1995. In this paper, the limitations of these two algorithms are firstly analyzed, such as the dimensional increase and the local optimization, etc. And then, a novel heuristic algorithm based on ant colony system (ACS) is presented to solve the FDP, in which some new strategies such as adding new parameters and killing artificial ants are introduced. A randomly generated FDP is given. The experimental results show that the proposed algorithm is effective for solving FDP.

[1]  Lei Zhang,et al.  Genetic computing for the film copy deliverer problem , 1995, 1995 IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21st Century.

[2]  Mitsuo Gen,et al.  Film-copy deliverer problem using genetic algorithms , 1995 .

[3]  Lei Zhang,et al.  Remodeling the film copy deliverer problem , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

[4]  M Dorigo,et al.  Ant colonies for the travelling salesman problem. , 1997, Bio Systems.

[5]  Corso Elvezia,et al.  Ant colonies for the traveling salesman problem , 1997 .

[6]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[7]  Lei Zhang,et al.  On polynomial-approximated solutions to the film copy deliverer problem , 1996, 1996 IEEE International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems (Cat. No.96CH35929).