Heuristic solution approaches for the cumulative capacitated vehicle routing problem

ÖZSOYDAN F. B., SİPAHİOĞLU A.

OPTIMIZATION, cilt.62, sa.10, ss.1321-1340, 2013 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 62 Sayı: 10
  • Basım Tarihi: 2013
  • Doi Numarası: 10.1080/02331934.2013.841158
  • Dergi Adı: OPTIMIZATION
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1321-1340
  • Anahtar Kelimeler: cumulative capacitated vehicle routing problem, genetic algorithm, tabu search algorithm, particle swarm optimization, PARTICLE SWARM OPTIMIZATION, TABU SEARCH ALGORITHM, EFFECTIVE EVOLUTIONARY ALGORITHM, SCHEDULING PROBLEM, GENETIC ALGORITHM, MINIMUM, DEPOT
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

Cumulative capacitated vehicle routing problem (CCVRP) is an extension of the well-known capacitated vehicle routing problem, where the objective is minimization of sum of the arrival times at nodes instead of minimizing the total tour cost. This type of routing problem arises when a priority is given to customer needs or dispatching vital goods supply after a natural disaster. This paper focuses on comparing the performances of neighbourhood and population-based approaches for the new problem CCVRP. Genetic algorithm (GA), an evolutionary algorithm using particle swarm optimization mechanism with GA operators, and tabu search (TS) are compared in terms of required CPU time and obtained objective values. In addition, a nearest neighbourhood-based initial solution technique is also proposed within the paper. To the best of authors' knowledge, this paper constitutes a base for comparisons along with GA, and TS for further possible publications on the new problem CCVRP.