Loading...

Competitive Hub Location for Time Definite Transportation

Farhani, Mahsa | 2016

500 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 49039 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Eshghi, Kourosh
  7. Abstract:
  8. In the recent years, the existing pressure in order to decrease the expenses and increase in giving service level led to the position in which the outsourcing of different sectors of unimportant actions is welcomed by manufacturing companies or the ones offering service. Since the logistic costs are crocial for companies' budget, the conveyance of logistics is a center of attention in recent years. In such a competitive situation, logistic service providers have to provide high quality with low price services, in which both the cost and service offering level to customers depend on the configuration of flow transmission of physical network. The use of hub network has great benefits for such companies and makes the location problem very important issue in logistics. This research presents time definite models for hub location problem in a competitive environment. In this problems decision makers sequentionally enter the market and the aim of each competitor is to maximize its own market share based on the existing budget. In addition, there are time windows customer damands and some other constraints in the model. The problem is modeled as a Stackelberg game in which the first decision maker is the leader and the latter is the follower. The presented model for the first decision maker is a bilevel programming problem. To solve the small-size problems of the leader model, an enumeration algorithm is proposed and then hybrid algorithms are applied to solve the medium and big size instances of this problem. In addition, a mixed integer linear programming is provided for the next decision maker who enters the market. Finally, optimization software of CPLEX and the simulated annealing algorithm are used for solving problems of the follower problem
  9. Keywords:
  10. Bilevel Programming ; Hub Location Problem ; Stackelberg Game ; Competitive Location ; Time Difinite Transportation

 Digital Object List

 Bookmark

No TOC