By Topic

Solve the film-copy deliverer problem using ant colony system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zhi-Feng Hao ; Dept. of Appl. Math., South China Univ. of Technol., Guangzhou, China ; Han Huang ; Xiao-Wei Yang ; Yan-Chun Liang

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.

Published in:

Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on  (Volume:4 )

Date of Conference:

26-29 Aug. 2004