The Design of a Multi-Period and Multi-Echelon Perishable Goods Supply Network under Uncertainty

Creative Commons License

Meidute-Kavaliauskiene I., YILDIRIM F., Ghorbani S., Činčikaitė R.

Sustainability (Switzerland), cilt.14, sa.4, 2022 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 14 Sayı: 4
  • Basım Tarihi: 2022
  • Doi Numarası: 10.3390/su14042472
  • Dergi Adı: Sustainability (Switzerland)
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus, Aerospace Database, CAB Abstracts, Communication Abstracts, Food Science & Technology Abstracts, Geobase, INSPEC, Metadex, Veterinary Science Database, Directory of Open Access Journals, Civil Engineering Abstracts
  • Anahtar Kelimeler: perishable supply chain, location-routing, multi-objective optimisation
  • İstanbul Ticaret Üniversitesi Adresli: Evet

Özet

The value of superior supply network design is becoming increasingly important, especially in the perishable supply chain. Due to the recent developments in perishable products, perishable product supply chain (PPSC) management has attracted many researchers. The purpose of this study was to present a multi-period and multi-echelon perishable supply chain with regards to procurement time, cycle cost, and customer satisfaction. This study presented a new form of location-routing in a supply chain network for perishable products, accounting for environmental considerations, cost, procurement time, and customer satisfaction, such that the total costs, delivery time, and the emission of pollutants in the network were minimized while customer satisfaction was maximized. We formulated the problem as a multi-objective, nonlinear, mixed-integer program and the hybrid approach was proposed to solve the model. The mean error of the proposed algorithm for the objective function compared to the exact method in solving the sample problems was less than 3.4%. The computational results revealed the efficiency of the proposed algorithm for a wide range of issues of various sizes.