Conflict-free tow train routing in just-in-time assembly lines
International Transactions in Operational Research, cilt.32, sa.6, ss.3667-3692, 2025 (SCI-Expanded, SSCI, Scopus)
- Yayın Türü: Makale / Tam Makale
- Cilt numarası: 32 Sayı: 6
- Basım Tarihi: 2025
- Doi Numarası: 10.1111/itor.13596
- Dergi Adı: International Transactions in Operational Research
- Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus, ABI/INFORM, Compendex, INSPEC, MathSciNet, vLex, zbMATH
- Sayfa Sayıları: ss.3667-3692
- Anahtar Kelimeler: A-star algorithm, conflict-free routing, optimization, simulated annealing algorithm
- Marmara Üniversitesi Adresli: Evet
Özet
Conflicts among tow trains pose a significant challenge in just-in-time manufacturing systems, impacting both safety and efficiency. This paper proposes an innovative solution to achieve conflict-free tow train routing. In our approach, the production layout is partitioned into “pixels.” The A-star (A*) algorithm is then employed on this pixel-based layout to create a distance matrix between workstations. Subsequently, a simulated annealing heuristic optimizes tow train routes to deliver parts demanded at the workstations. Additionally, a conflict detection algorithm identifies collisions among tow trains on the pixel layout, which are then resolved through two distinct conflict avoidance strategies. The algorithms are implemented and tested on a set of benchmark instances, demonstrating their effectiveness.