Multiobjective problem modeling of the capacitated vehicle routing problem with urgency in a pandemic period

Creative Commons License

Altinoz M., Altınöz Ö. T.

NEURAL COMPUTING & APPLICATIONS, cilt.35, sa.5, ss.3865-3882, 2023 (SCI-Expanded) identifier identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 35 Sayı: 5
  • Basım Tarihi: 2023
  • Doi Numarası: 10.1007/s00521-022-07921-y
  • Dergi Adı: NEURAL COMPUTING & APPLICATIONS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, PASCAL, Applied Science & Technology Source, Biotechnology Research Abstracts, Compendex, Computer & Applied Sciences, Index Islamicus, INSPEC, zbMATH
  • Sayfa Sayıları: ss.3865-3882
  • Anahtar Kelimeler: Vehicle routing problem, Multiobjective optimization algorithm, Many objective optimization algorithm, Optimization, GENETIC ALGORITHM, OPTIMIZATION
  • Ankara Üniversitesi Adresli: Evet

Özet

This research is based on the capacitated vehicle routing problem with urgency where each vertex corresponds to a medical facility with a urgency level and the traveling vehicle could be contaminated. This contamination is defined as the infectiousness rate, which is defined for each vertex and each vehicle. At each visited vertex, this rate for the vehicle will be increased. Therefore time-total distance it is desired to react to vertex as fast as possible- and infectiousness rate are main issues in the problem. This problem is solved with multiobjective optimization algorithms in this research. As a multiobjective problem, two objectives are defined for this model: the time and the infectiousness, and will be solved using multiobjective optimization algorithms which are nondominated sorting genetic algorithm (NSGAII), grid-based evolutionary algorithm GrEA, hypervolume estimation algorithm HypE, strength Pareto evolutionary algorithm shift-based density estimation SPEA2-SDE, and reference points-based evolutionary algorithm.