Loading...
Search
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
Digital Object List
Bookmark
Review List- Type of Document: Ph.D. Dissertation
- Language: Farsi
- Document No: 52282 (01)
- University: Sharif University of Technology
- Department: Industrial Engineering
- Advisor(s): Eshghi, Kourosh
- Abstract:
- In today's life, we look at each other, seeing different networks, such as power networks, telecommunication networks, transportation networks (freeways, roads, streets), rail networks, air service networks, shipping networks, Logistics networks (networks of construction and distribution), computer networks, Internet networks (e-commerce, banking networks), airline reservation networks, social networks and so on. In all of these networks, an entity such as man, product, car, electricity, message, information, aircraft, etc. from one source into a destination is moved according to the network's purposes and objectives.This thesis analyzes the sensitivity analysis and optimization of network flow problems. This thesis consists of two main parts. In the first section, an analysis of the sensitivity analysis of the network flow problems, especially shortest path problem, minimum spanning tree problem and the maximal flow problem. In this section, a new concept called the Transposition Matrix is presented in the sensitivity analysis of the shortest path all pairs problem. All methods of sensitivity analysis provided have a simple structure and method of execution.In the second section, optimization (development and improvement of algorithms) Is represented. In this section, two attractive Cascade Algorithm are proposed, one for the shortest path all pairs problem, called named Cascade Rectangle Algorithm and other the Cascade rectangles Algorithm (Complementary Rectangles Algorithm ) for the maximal flow all pairs problem with the augmenting approach. Cascading Rectangle Algorithm is designed to calculate the shortest distance and route and the Cascade Rectangles Algorithm to calculate the maximum flow and path between all pairs in cycled directed network.
Cascade Rectangle Algorithm and Cascade Rectangles Algorithm with the worst case time complexity, O(n^3) are very attractive and fast - Keywords:
- Network Flows ; Shortest Path ; Minimum Spanning Tree ; Maximum Flow ; Cascade Rectangle Algorithm ; Sensitivity Analysis
-
محتواي کتاب
- view