Conflict-free tow train routing in just-in-time assembly lines

GÜNDÜZ MENGÜBAŞ G., Sörensen K., Kotan M.

International Transactions in Operational Research, vol.32, no.6, pp.3667-3692, 2025 (SCI-Expanded, SSCI, Scopus) identifier identifier

  • Publication Type: Article / Article
  • Volume: 32 Issue: 6
  • Publication Date: 2025
  • Doi Number: 10.1111/itor.13596
  • Journal Name: International Transactions in Operational Research
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Social Sciences Citation Index (SSCI), Scopus, ABI/INFORM, Compendex, INSPEC, MathSciNet, vLex, zbMATH
  • Page Numbers: pp.3667-3692
  • Keywords: A-star algorithm, conflict-free routing, optimization, simulated annealing algorithm
  • Marmara University Affiliated: Yes

Abstract

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.