Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 42774 (01)
- University: Sharif University of Technology
- Department: Industrial Engineering
- Advisor(s): Haji, Rasoul
- Abstract:
- Hub and Spoke networks come into play when considering direct link between all origins and destinations is either impossible or expensive in a transportation system. In this kind of problems, some nodes are chosen as hub from all origin and destination nodes to collect flows and then distribute them. Implementing hub network leads to minimizing transportation cost, sorting flows and conveying them in economies of scale. Otherwise, shipping flows directly may cause decreasing the travelling distance and the delivery time consequently. In this dissertation, combination of hub network and direct shipment is investigated. To obtain the optimal hub locations and direct links between non-hub nodes which minimize the total transportation cost, an integer programming formulation is presented. A real sample data are considered for evaluating the efficiency and performance of model. Experiment results show that the mixed transportation system can save 7.43% total travelling distance or transportation costs on average as compared with usual hub network. Furthermore, due to high complexity of problem and run time of exact solver (CPLEX), a hybrid heuristic algorithm by combining two Simulated Annealing algorithms is developed for solving this problem. The proposed algorithm, in comparison with exact algorithm (CPLEX), can find optimal solutions for small size problems and promising results for large size problems in less time.
- Keywords:
- Transportation Network ; Location ; Tangent Path ; Simulated Annealing Method ; Single Allocation ; P-hub Media Problem
Digital Object List
-
محتواي پايان نامه
- view
Bookmark