Ziyaret aralıklandırma politikalı ve aktarmalı üretim rotalama problemleri için matematiksel programlamatabanlı sezgisel yöntemler

The production routing problem (PRP) is an integrated operational planning problem that combines the two well-known optimization problems, vehicle routing problem (VRP) and lot-sizing problem (LSP). The purpose of this thesis is to integrate the visit spacing policy (VSP) and the concept of transshipments into the PRP. The reason behind considering the VSP in the context of the PRP is to ensure the service consistency. The VSP is especially important to provide higher quality service to the retailers. In this thesis, we extend the basic version of the PRP by taking into consideration the VSP. For its solution, an iterative matheuristic algorithm (MA) is proposed. The proposed MA is tested on a set of randomly generated problem instances with VSP as well as on standard PRP and the inventory routing problem (IRP) with the VSP benchmark instances. The results indicate the effectiveness of the algorithm. In order to achieve the second purpose of this thesis, we extend the classical version of the PRP by considering transshipments, either from supplier to retailers or between retailers, to further reduce the total cost. To solve the problem, we develop a mathematical programming heuristic. The algorithm is applied to two sets of randomly generated problem instances. The results show the effectiveness of the proposed approach. Moreover, an extensive computational study is performed to reveal the effect of the transshipments on the overall cost.