In java, in the TSP Lab framework, you will program an extension of the swap neighborhood. This extension is called String Exchange. It takes to parameters : k1 and k2. In a string exchange neighborhood, the position of k1 consecutive vertices is exchanged with the position of k2 consecutive vertices (see the image at the end of this email for a String echange with k1 = 3 and k2= 4).
You will use your neighborhood function in the LocalSearchDescent Algorithm and propose some benchmark on 5 instances of your choice. In this benchmark, start from a solution given by a Clarke and Wright algorithm followed by a local search descent with 2-opt. Then apply your Sring exchange neighborhood. Compare various values of k1 and k2.
Please check the attached image below.
I will share more files with the selected freelancer.
Budget: $60 AUD
Deadline: 3 days
I have read the project description fully.
I am expert in JAVA programming.
I can complete your task deadline with 100 % perfectly.
I can assure you that you will get your job done exceptionally well as you may have expected.
Please contact me to discuss more about the project.
Dear, sir.
I have read your proposal carefully and I am interested in your project.
I am an expert in JAVA and JAVA FX.
Thanks.
Waiting for your reply.