PROBLEMS: 1.Mr. Bill Mart is working at M-mart. He is a manager of western area of NY. There are 4 stores(1, 2, 3 and 4) in his area. He has to visit every store exactly only once to check the stores in his area and come back to the starting store. Write a program so that your program automatically find the minimum-cost tour using Backtracking Algorithm to visit every store and come back to the starting store even if you change the problem specification. Use a bounding function to reduce the searching space. Provide a user interface so that James Bill can choose his starting store. [url removed, login to view] the function f(x) = x^2, where x is in the interval [0 ??" 31], we want to find x that maximize the function using Genetic Algorithm. Write a program and find the x. Show the process of operations (selection, cross-over, mutation) for the first generation. Show the result(best chromosome and the average value) of each generation.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site).
The program needs to run on [url removed, login to view] or visual studio c++. It should be done by 30th Nov. The graph for some reason on the travelling salesperson is not copying and so I can provide it as an attached file if anybody is interested...I will be running it on windows XP. thanks