Lecture25-3-22-2002

Lecture-2002 - MAE 552 Heuristic Optimization Lecture 25 Topic Tabu Search A Simple Illustration of Tabu Search A Simple Version of the short term

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
MAE 552 – Heuristic Optimization Lecture 25 March 22, 2002 Topic: Tabu Search
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
A Simple Illustration of Tabu Search A Simple Version of the short term memory component of the Tabu Search is illustrated in this example. The problem is known as a minimum spanning tree problem The minimum spanning tree (MST) of a graph defines the cheapest subset of edges that keeps the graph in one connected component. Telephone companies are particularly interested in minimum spanning trees, because the minimum spanning tree of a set of sites defines the wiring scheme that connects the sites using as little wire as possible.
Background image of page 2
A Simple Illustration of Tabu Search Legal Spanning Tree Illegal Spanning Tree
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
A Simple Illustration of Tabu Search A solution can be represented in terms of a vector indicating whether or not an edge appears in the solution. X 1 [6] X 3 [18] X 7 [12] X 5 [0] X 4 [2] X 2 [9] X 6 [8] This solution is (0,1,0,1,1,0,1) and F=23
Background image of page 4
A Simple Illustration of Tabu Search Additionally there are constraints imposed on this problem.
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/09/2011 for the course MAE 522 taught by Professor Hacker during the Spring '10 term at SUNY Buffalo.

Page1 / 12

Lecture-2002 - MAE 552 Heuristic Optimization Lecture 25 Topic Tabu Search A Simple Illustration of Tabu Search A Simple Version of the short term

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online