It's UWAweek 49


This forum is provided to promote discussion amongst students enrolled in CITS3001 Algorithms, Agents and Artificial Intelligence.

Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!"  followup message.

How do I ask a good question?
Displaying selected article
Showing 1 of 292 articles.
Currently 1 other person reading this forum.

 UWA week 32 (2nd semester, week 3) ↓
SVG not supported

Login to reply

6:48pm Thu 10th Aug, ANONYMOUS

Hi, the 2opt in the lecture says this Consider an iterative improvement algorithm that, in every iteration, examines every pair of edges in a tour, and performs an exchange if it would improve the tour Which sounds more like checking all vertices where city1 != city2 and seeing if a swap improves the tour. But the one described on wikipedia involves reversing a section a time, and checking if that improves the tour, are these the same?

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  5:07AM Sep 06 2023
Privacy policy