Constrained multiple travelling salesman problem based on genetic algorithm and its application

Constrained multiple travelling salesman problem based on genetic algorithm and its application

0.00 Avg rating0 Votes
Article ID: iaor20014201
Country: China
Volume: 12
Issue: 2
Start Page Number: 67
End Page Number: 69
Publication Date: Jun 2000
Journal: Journal of Chongqing University of Posts and Telecommunications
Authors:
Keywords: genetic algorithms
Abstract:

Constrained vehicle scheduling problems are discussed in this paper. The model and the genetic algorithm solution of Constrained Multiple Travelling Salesmen Problem are presented. It is shown by simulation that the performance of the genetic algorithm is very good.

Reviews

Required fields are marked *. Your email address will not be published.