Document Type
Thesis
Date of Award
9-30-1990
Degree Name
Master of Science in Electrical Engineering - (M.S.)
Department
Electrical and Computer Engineering
First Advisor
Irving Y. Wang
Second Advisor
Edwin Hou
Third Advisor
MengChu Zhou
Abstract
A random, heuristic search called Simulated Annealing is adapted to decompose the state transition lattice of Non-Product Form Queuing Models. Simulated Annealing Algorithm has been successfully applied to a number of optimization problem such as The Traveling Salesman Problem, Graph Partionning, Physical Computer Design, VLSI Chip Design, Image Processing,... etc. It has the advantage over other gradient descent techniques to solve the combinatorial problems. The solution can escape from local minimum by adding Boltzmann Distribution Factor to the algorithm. Most lattice of non-product form queuing models can be decomposed into Solvable Subsets through this algorithm, and solvable subset is the key to save computational effort. Some Queueing models like Erlang Queue, ISDN Protocol, Priority Queue will be discussed in the document. The decomposition result tends to a global optimum if the Energy Function of a problem is carefully defined.
Recommended Citation
Lin, Jr-Chin, "Decomposing non-product form queuing lattices through simulated annealing" (1990). Theses. 2840.
https://digitalcommons.njit.edu/theses/2840
