Abstract Film-copy Deliverer Problem (short for the FDP) can be regarded as a new extension of traveling salesman problem. It has been proven that FDP is a NP hard problem and several heuristic algorithms have been reported. In this paper, we develop an implementation of genetic algorithms to solve this problem. A deliverer tour can be represented as a walk on a graph, which is a natural coding scheme. A subtour preservation crossover is proposed in order to maintain building blocks in the offspring in much the same manner as Holland described. Mutation is designed with local search techniques intending to generate the improved offspring. The proposed procedure is tested on randomly generated problems and the results show that genetic algorithms can be a promising way for this problem.
[1]
G. Laporte.
The traveling salesman problem: An overview of exact and approximate algorithms
,
1992
.
[2]
Mehdi Behzad,et al.
Graphs and Digraphs
,
1981,
The Mathematical Gazette.
[3]
Zbigniew Michalewicz,et al.
Genetic Algorithms + Data Structures = Evolution Programs
,
1996,
Springer Berlin Heidelberg.
[4]
John H. Holland,et al.
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence
,
1992
.
[5]
Lei Zhang,et al.
Remodeling the film copy deliverer problem
,
1994,
Proceedings of IEEE International Conference on Systems, Man and Cybernetics.