MULTIOBJECTIVE MATHEMATICAL MODELS AND SOLUTION APPROACHES FOR HETEROGENEOUS FIXED FLEET VEHICLE ROUTING PROBLEMS

ALPASLAN TAKAN M., Kasimbeyii R.

Journal of Industrial and Management Optimization, cilt.17, sa.4, ss.2073-2095, 2021 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 17 Sayı: 4
  • Basım Tarihi: 2021
  • Doi Numarası: 10.3934/jimo.2020059
  • 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, Compendex, Computer & Applied Sciences, MathSciNet, zbMATH
  • Sayfa Sayıları: ss.2073-2095
  • Anahtar Kelimeler: multiob jective optimization, tabu search algorithm, Vehicle routing problem
  • Bilecik Şeyh Edebali Üniversitesi Adresli: Evet

Özet

In this paper, we study three types of heterogeneous fixed fleet vehicle routing problems, which are capacitated vehicle routing problem, open vehicle routing problem and split delivery vehicle routing problem. We propose new multiob jective linear binary and mixed integer programming models for these problems, where the first ob jective is the minimization of a total routing and usage costs for vehicles, and the second one is the vehicle type minimization, respectively. The proposed mathematical models are all illustrated on test problems, which are investigated in two groups: small-sized problems and the large-sized ones. The small-sized test problems are first scalarized by using the weighted sum scalarization method, and then GAMS software is used to compute efficient solutions. The large-sized test problems are solved by utilizing the tabu search algorithm.