Univrsity of Tehran Press Industrial Management Journal 3115-7386 9 2 2017 07 23 A developed model and heuristic algorithm for inventory routing problem in a cold chain with pharmaceutical products ارائۀ مدل ریاضی مسیریابی ـ موجودی چند‌محصوله برای اقلام دارویی در زنجیرۀ تأمین سرد و روش حل ابتکاری مبتنی بر جست‌وجوی همسایگی انطباقی 383 407 64592 10.22059/imj.2017.127742.1006884 EN Parizad Vakili MA Student in Industrial Engineering, Iran University of Science and Technology, Tehran, Iran Seyyed-Mahdi Hosseini-Motlagh Assistant Prof., Iran University of Science and Technology, Tehran, Iran MohammadReza Gholamian Assistant Prof., Iran University of Science and Technology, Tehran, Iran Abbas Jokar PhD Candidate of Economic and Social Systems, Iran University of Science and Technology, Tehran, Iran Journal Article 2015 07 12 Inventory routing problem considers inventory allocation and routing problems simultaneously, in which the replenishment policies and routing arrangement are determined by the supplier under the vendor managed inventory mode. In this paper we study deterministic inventory routing problem in a pharmaceutical supply chain with a distributor and multiple geographically dispersed retailers. Two types of products are considered, first refrigerated which need temperature-controlled vehicles to be delivered and second non-refrigerated. Therefor our problem is defined in a cold chain which is a temperature-controlled supply chain. Vehicles capacity and holding capacity of retailers is consist of refrigerated and non-refrigerated parts. We propose a mixed integer linear programming (MILP) model. The objective is to minimize the sum of transportation and inventory costs. We also propose an adaptive large neighborhood search heuristic to solve the problem. In the initialization phase of the algorithm, a two phase heuristic algorithm is proposed. We used standard data sets to demonstrate the performance of the proposed algorithm. https://imj.ut.ac.ir/article_64592_cadde68714725f33555f82578ffffc9a.pdf