Hybridizing local searching with genetic algorithms for the job sequencing and tool switching problem with non-identical parallel machines

Cura T.

Expert Systems with Applications, cilt.223, 2023 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 223
  • Basım Tarihi: 2023
  • Doi Numarası: 10.1016/j.eswa.2023.119908
  • Dergi Adı: Expert Systems with Applications
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, PASCAL, Aerospace Database, Applied Science & Technology Source, Communication Abstracts, Computer & Applied Sciences, INSPEC, Metadex, Public Affairs Index, Civil Engineering Abstracts
  • Anahtar Kelimeler: Genetic algorithms, Hybrid heuristic, Local search, Scheduling, Tool switching
  • İstanbul Üniversitesi Adresli: Evet

Özet

The job sequencing and tool switching problem (SSP) is an old and highly studied problem. However, the SSP with non-identical parallel machines (SSP-NPM) is a new generalization of this problem. Since the SSP-NPM has been very recently introduced, the number of solution methods for this problem is low. Additionally, exact solution methods are mostly insufficient to find a good solution within a reasonable computational time since this problem is NP-hard. Therefore, heuristic approaches are more appropriate, especially when solving large-size problems. Thus, this study presents a new hybrid algorithm that is a combination of a genetic algorithm (GA) and a local search (LS) technique. Both of these methods are greatly preferred by authors for solving job scheduling problems. Thereby, this study combines their strengths to solve the SSP-NPM. Two versions of the proposed method are tested with benchmark instances. These versions differ in terms of their tool optimization policies: the first uses the well-known “keep tool needed soonest” (KTNS) policy, while the second uses the “randomly remove tool” (RRT) policy. Computational experiments showed that combining some of the features of GA and LS methods for the SSP-NPM contributed greatly to the quality of the solution. Two versions of the proposed hybrid method were compared to a mixed-integer programming model and several schemes of an iterated local search algorithm. Our computational results show that both versions of the proposed hybrid method were significantly better than the other methods, and were able to find the solutions within a reasonable computational time.