Decomposing non-product form queueing lattices through autorouting with A* algorithm
Department of Electrical and Computer Engineering
Master of Science
Wang, Irving Y.
Direct solution techniques are expensive for the state transition lattice of a class of non-product form queuing modes. In this thesis, Autorouting with A* algorithm is adapted to decompose it as solvable subsets which can be solved sequentially and independently. Autorouting with A* algorithm is heuristics in problem solving. It also is one of a class of global optimization problems that are difficult to solve. Some queuing modes of type A will be decomposed in this thesis through Autorouting with A* algorithm.
njit-etd1991-014 (74 pages ~ 2,389 KB pdf)
|Download by Chapters:||
Front Matter (Title Page, Abstract, Table of Contents, etc. ~ 8 pages ~ 240 KB pdf)
Chapter 1: Introduction (1 pages ~ 90 KB pdf)
Chapter 2: Product and Non-product (10 pages ~ 435 KB pdf)
Chapter 3: Autorouting With the A * Algorithm (13 pages ~ 632 KB pdf)
Chapter 4: Adapted Autorouting With A * Algorithm to Non-Product Form Queueing Mode (6 pages ~ 258 KB pdf)
Chapter 5: Decomposition Results (17 pages ~ 396 KB pdf)
Chapter 6: Discussion and Conclusion (1 pages ~ 85 KB pdf)
Appendix: (15 pages ~ 451 KB pdf)
References: (2 pages ~ 101 KB pdf)
Please complete this Feedback Form to inform us about your experience using this website. It will assist us in better serving your information needs in the future. Thank You!
Created April 4, 2002