Solving vehicle routing problem with time windows using metaheuristic approaches

Aydinalp, Zeynep; Özgen, Doğan

doi:10.1108/ijicc-01-2022-0021

Solving vehicle routing problem with time windows using metaheuristic approaches

Atıf İçin Kopyala

Aydinalp Z., Özgen D.

International Journal of Intelligent Computing and Cybernetics, cilt.2022, sa.2022, ss.1-10, 2022 (ESCI)

Yayın Türü: Makale / Tam Makale
Cilt numarası: 2022 Sayı: 2022
Basım Tarihi: 2022
Doi Numarası: 10.1108/ijicc-01-2022-0021
Dergi Adı: International Journal of Intelligent Computing and Cybernetics
Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus, Compendex, MathSciNet
Sayfa Sayıları: ss.1-10
Yıldız Teknik Üniversitesi Adresli: Evet

Özet

Drugs are strategic products with essential functions in human health. An optimum design of the pharmaceutical supply chain is critical to avoid economic damage and adverse effects on human health. The vehicle-routing problem, focused on finding the lowest-cost routes with available vehicles and constraints, such as time constraints and road length, is an important aspect of this. In this paper, the vehicle routing problem (VRP) for a pharmaceutical company in Turkey is discussed.