Abstract

Discrete optimization algorithms exist for analysis of network optimization of flow problems. Computer programs written from these algorithms can be used for local area network analysis of point-to-point computer networks, transportation networks, resource allocation, distribution, and production scheduling. One aspect of a network that can be optimized using discrete optimization algorithms is the length of the path that data will take when traveling through the network. One node in the network signifies the source node and a second node is the sink or destination. The object is to find the shortest path between the two nodes. The definition of shortest path depends on the quantity analyzed in the network. "Shortest path" can represent the fastest path, most cost-efficient path, most fuel-efficient path, etc. Also, different levels of computation may be required. It may be necessary to find the shortest path between two nodes in a network, the shortest path between a source node and all other nodes in a network, or the shortest path between all pairs of nodes in a network. The complexity, performance, and results of different optimization methods can be compared using a series of network models. A comparison of the algorithms researched and results of the computer analysis will be shown.

Library of Congress Subject Headings

Mathematical optimization; Algorithms; Network analysis (Planning)

Publication Date

9-11-1991

Document Type

Thesis

Department, Program, or Center

Computer Engineering (KGCOE)

Advisor

Chang, Tony

Advisor/Committee Member

Matteson, Ronald

Advisor/Committee Member

Heliotis, James

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: QA402.5 .H64 1991

Campus

RIT – Main Campus

Download

Share

COinS