A MODEL AND TWO HEURISTIC METHODS FOR THE MULTI-PRODUCT INVENTORY-LOCATION-ROUTING PROBLEM WITH HETEROGENEOUS FLEET

Creative Commons License

Arslan O., İŞLEYEN S. K.

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, cilt.18, sa.2, ss.897-932, 2022 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 18 Sayı: 2
  • Basım Tarihi: 2022
  • Doi Numarası: 10.3934/jimo.2021002
  • Dergi Adı: JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, ABI/INFORM, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Computer & Applied Sciences, MathSciNet, zbMATH
  • Sayfa Sayıları: ss.897-932
  • Anahtar Kelimeler: Key words and phrases, Heuristic, inventory-location-routing problem, location-routing problem, logistics, supply chain, DISTRIBUTION NETWORK, DECISIONS, ALGORITHM
  • Gazi Üniversitesi Adresli: Evet

Özet

The Multi-Product Inventory-Location-Routing Problem with heterogeneous fleet considers a supply chain, which comprises multiple producers, potential distribution centers (DCs) with opening capacity levels and geographically scattered retailers each of which has deterministic demand over a discrete planning horizon. The goal is determining a set of DCs with their capacity levels to open, assigning retailers to the opened DCs, finding product quantities to be ordered by and distributed from opened DCs and determining the fleet and routes to satisfy the demands of retailers with minimum cost. A mixed-integer linear programming model is proposed to describe the problem, which is strengthened by two valid inequalities. Since the commercial solver can only solve the very small-sized instances within a reasonable time, two heuristic methods are developed. Results show that the proposed valid inequalities are effective and both methods provide important savings in acceptable run times compared to the commercial solver.