اذهب إلى المحتوى
  • 0

Solving a Travelling Salesman Problem (TSP) Using Genetic Algorithm (GA) ابغى الحل

السؤال

نشر

Solving a Travelling Salesman Problem (TSP) Using Genetic Algorithm (GA)

Q1- Describe briefly the Travelling Salesman Problem.

Q2- Genetic Algorithm brief introduction.

Q3- Download the source code (any programming language that you want) that

uses GA for solving TSP. Run the code and show some outputs through

taking screen shots of your program.

Q4- Based on the program code describe how following are represented

 Gene:

 Individual (chromosome):

 Population:

 Selecting the 1st Generation of Parents:

 Fitness function:

 Crossover operator:

 Mutation operator:

 Termination condition:

Q5- Provide the references that you refer in your assignment as well as the source code.

    

Recommended Posts

انضم إلى النقاش

يمكنك أن تنشر الآن وتسجل لاحقًا. إذا كان لديك حساب، فسجل الدخول الآن لتنشر باسم حسابك.

زائر
أجب على هذا السؤال...

×   لقد أضفت محتوى بخط أو تنسيق مختلف.   Restore formatting

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   جرى استعادة المحتوى السابق..   امسح المحرر

×   You cannot paste images directly. Upload or insert images from URL.

  • إعلانات

  • تابعنا على



×
×
  • أضف...