AM-74 - Interchange heuristics

You are currently viewing an archived version of Topic . If updates or revisions have been published you can find them at .

Learning Objectives: 
  • Define alternatives to the Tietz and Bart heuristic
  • Outline the Tietz and Bart interchange heuristic
  • Describe the process whereby an element within a random solution is exchanged, and if it improves the solution, it is accepted, and if not, it is rejected and another element is tried until no improvement occurs in the objective function value