The Differential Evolution Algorithm for the Travelling Salesman Problem with Time Windows

Creative Commons License

Keskinturk T.

International Conference on Social Science and Health (ICSSH 2013), Los-Angeles, Şili, 30 Ocak 2012 - 31 Ocak 2013, cilt.19, ss.31-35 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 19
  • Basıldığı Şehir: Los-Angeles
  • Basıldığı Ülke: Şili
  • Sayfa Sayıları: ss.31-35
  • İstanbul Üniversitesi Adresli: Evet

Özet

In this paper we studythe differential evolution algorithm meta-heuristic to solve the travelling salesman problem with time windows. To create an initial population of the problem we use time windows. For every costumer we generate a random number in those time intervals. These time variables represent the visiting time of the related costumer. Our results for the benchmark problems show that with this initial population process and differential evolution algorithm that it could be a good alternative for the travelling salesman problem with time windows. In addition to describing the method, the experimental results of the benchmark test problems are presented.

In this paper we study the differential evolution algorithm meta-heuristic to solve the travelling salesman problem with time windows. To create an initial population of the problem we use time windows. For every costumer we generate a random number in those time intervals. These time variables represent the visiting time of the related costumer. Our results for the benchmark problems show that with this initial population process and differential evolution algorithm that it could be a good alternative for the travelling salesman problem with time windows. In addition to describing the method, the experimental results of the benchmark test problems are presented.