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

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International transactions in operational research Ročník 32; číslo 6; s. 3667 - 3692
Hlavní autoři: Gündüz Mengübaş, Gül, Sörensen, Kenneth, Kotan, Muhammed
Médium: Journal Article
Jazyk:angličtina
Vydáno: Oxford Blackwell Publishing Ltd 01.11.2025
Témata:
Algorithms
Assembly lines
A‐star algorithm
conflict‐free routing
Layouts
Manufacturing
optimization
Pixels
Simulated annealing
simulated annealing algorithm
Work stations
Workstations
ISSN:0969-6016, 1475-3995
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0969-6016
1475-3995
DOI:10.1111/itor.13596