Scribd
Upload
71 views11 pages

Optimization Techniques: J. Fisher

The document discusses optimization techniques and their applications. It defines an optimization problem as seeking to minimize undesirable factors or maximize desirable ones subject to constraints. It then describes the problem formulation process and lists some common applications, including routing in computer networks using Dijkstra's shortest path algorithm. Dijkstra's algorithm and its pseudocode are explained. Modeling examples are provided for the shortest path problem, traveling salesman problem, minimum spanning trees, and spreading of infectious diseases. Finally, applications to power systems are mentioned but not detailed.

Uploaded by

Daniel Nimabwaya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
71 views11 pages

Optimization Techniques: J. Fisher

The document discusses optimization techniques and their applications. It defines an optimization problem as seeking to minimize undesirable factors or maximize desirable ones subject to constraints. It then describes the problem formulation process and lists some common applications, including routing in computer networks using Dijkstra's shortest path algorithm. Dijkstra's algorithm and its pseudocode are explained. Modeling examples are provided for the shortest path problem, traveling salesman problem, minimum spanning trees, and spreading of infectious diseases. Finally, applications to power systems are mentioned but not detailed.

Uploaded by

Daniel Nimabwaya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Lecture 2

OPTIMIZATION TECHNIQUES
J. Fisher
Definition
• An optimization problem is a mathematical model where main
objective is to minimize undesirable things (e.g. cost, energy loss,
errors, etc.) or maximize desirable things (e.g. profit, quality,
efficiency, etc.), subject to some constraints.
PROBLEM FORMULATION OF OPTIMIZATION
• The problem formulation of any optimization problem can be
thought of as a sequence of steps and they are:
Choosing design variables (control and state variables)
Formulating constraints
Formulating objective functions
Setting up variable limits
Choosing an algorithm to solve the problem
Solving the problem to obtain the optimal solution
Application of Optimizations
Routing in a computer network

Applying Dijkstra's algorithm (or Dijkstra's Shortest Path First


algorithm, SPF algorithm) is an algorithm for finding the shortest
paths between nodes in a graph, which may represent, for example,
road networks.
It was conceived by computer scientist Edsger W. Dijkstra in 1956 and
published three years later.

It is used in the routing and many other applications.


Dijkstra's shortest path algorithm.
Given a graph and a source vertex
in the graph, find shortest paths
from source to all vertices in the
given graph. Dijkstra's algorithm is
very similar to Prim's algorithm for
minimum spanning tree.
Using the Dijkstra algorithm, it is possible to
determine the shortest distance (or the least
effort / lowest cost) between a start node and
any other node in a graph.

The idea of the algorithm is to continuously


calculate the shortest distance beginning from
a starting point, and to exclude longer
distances when making an update. It consists
of the following steps:
E.W. Dijkstra (1930-2002)
Dijkstra’s Algorithm: Pseudocode
• Initialize the cost of each node to 
• Initialize the cost of the source to 0
• While there are unknown nodes left in the graph
• Select an unknown node b with the lowest cost
• Mark b as known
• For each node a adjacent to b
• a’s cost = min(a’s old cost, b’s cost + cost of (b, a))
Modelling of SPF Using Dijkstra’s Algorithm
Modelling Demonstration Using Grin Software Tool

Demo on SPF
Travelling Salesman
Minimum Spanning Tree
Traveling Salesman Problem (TSP)

 The traveling salesman problem consists of a salesman and a set of


cities.

The salesman has to visit each one of the cities starting from a
certain one (e.g. the hometown) and returning to the same city.

The challenge of the problem is that the traveling salesman wants


to minimize the total length of the trip.
Demo
Modelling Spread of Infectious Diseases
• A simple epidemic model the spread of the disease starts from an
infected person.

• The person directly spreads the disease to two susceptible persons.


... The process is continued until everyone is infected.

• Apply the SIR model


Application to Power Systems

See Next Presentation Slides

You might also like