Turret-index optimisation with mathematical programming and metaheuristic approaches

BAYKASOĞLU A., YÖRÜK E., Topaloglu Yildiz Ş. A.

International Journal of Production Research, 2024 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Basım Tarihi: 2024
  • Doi Numarası: 10.1080/00207543.2024.2399711
  • Dergi Adı: International Journal of Production Research
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, ABI/INFORM, Aerospace Database, Business Source Elite, Business Source Premier, Communication Abstracts, Compendex, INSPEC, Metadex, zbMATH, Civil Engineering Abstracts
  • Anahtar Kelimeler: constraint programming, industry, integer programming, SDG 9, turret-index optimization, weighted superposition attraction algorithm
  • Dokuz Eylül Üniversitesi Adresli: Evet

Özet

This paper addresses the turret-index optimisation problem by proposing two mathematical programming approaches based on quadratic programming (QP) and constraint programming (CP). In addition, a metaheuristic algorithm based on weighted superposition attraction (WSA) is developed due to the combinatorial complexity of the problem. Despite attempting to linearise the QP formulation for problem resolution, both the QP and Linearized QP models prove ineffective for medium and larger-sized instances, providing solutions only for small-sized problems. In the second mathematical programming approach, a novel CP model is introduced in the literature. While CP can rapidly offer optimal solutions for small-sized problems, it only provides satisfactory solutions for medium and larger-sized problems within the predetermined computational time limits and does not guarantee optimal results. On the other hand, through computational analysis and relevant statistical tests, the proposed WSA algorithm provides the best solutions for all test problems within a reasonable computational time.