Loading...

Distribution Problem in Heterogeneous Networks with the Assumption of Flexibility in the Delivery of Goods

Fakhimi, Ramin | 2014

587 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 46335 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineerign
  6. Advisor(s): Shavandi, Hasan
  7. Abstract:
  8. In this research, we consider a network of distiribution channels and a central warehouse to deliver the products to distribution centers. We assume the price of products are fixed and the central warehouse is authorized to change the delivery amount for each DC in a reasonable interval. The main idea is authorizing the central warehouse to be flexible in delivery of ordered amounts of DCs in a reasonable interval in order to reduce the transportation cost and then maximizing the profit.
    The problem is formulated as a linear integer programming model and the properties of optimal solution is analyzed. Based on the properties of the model a solution algorithm is developed to solve the model. The algorithm includes generating initial solutions, Tabu Search algorithm, and improvement algorithm for final solutions. The Tabu Search algorithm consists three processes for producing neighborhood. Furthermore, a heuristic approach is considered for improving the dispatching of products based on the properties of optimal solution. The performance of proposed algorithm is analyzed against IBM ILOG CPLEX 12.4. The results show the reasonable performance of proposed algorithm. Finally, a sensitivity analysis is done for problem parameters and managerial insights are analyzed
  9. Keywords:
  10. Vehicle Routing Problem ; Split Delivery ; Traveling Salesman Problem ; Heuristic Algorithm ; Tabu Search Algorithm ; K-Split Cycle

 Digital Object List

 Bookmark

No TOC