Loading...

Inventory-Routing Problem with Roaming Delivery Locations

Talebi, Masoumeh | 2022

53 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 55530 (01)
  4. University: Sharif University of Technology
  5. Department: Industrial Engineering
  6. Advisor(s): Akbari Jokar, Mohammad Reza
  7. Abstract:
  8. Many researches in the literature have emphasized on the combination of different supply chain decisions in order to reduce the overall costs of the system. On the other hand, the advancement of technology and the necessities of modern life have created conditions that expect more realistic assumptions that are in line with these conditions to be considered in supply chain problems. One of these assumptions is the mobility of the customer's location during the planning period, which is discussed in this research. In other words, in this research, a single-period single-item inventory routing problem is considered with roaming delivery locations. In fact, in this research, a mathematical modeling is presented for the aforementioned problem, and then two meta-heuristic algorithms are proposed to solve it. The parameters of both algorithms were adjusted by Taguchi method and the best values for them were obtained. The results of the implementation of these algorithms indicate that the genetic algorithm and the particle swarm optimization in small-sized problems can generate solutions close to the optimal solution, which is 0.89% and 2.20% away from it, respectively. On the other hand, for large-sized problems, the genetic algorithm provides better solutions, which is on average 5.6% better than the answer generated by the particle swarm algorithm.
  9. Keywords:
  10. Roaming Delivery Locations ; Genetic Algorithm ; Taguchi Method ; Particles Swarm Optimization (PSO) ; Inventory-Routing Problem (IRP) ; Supply Chain

 Digital Object List

 Bookmark

No TOC