Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly (Q2517416)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6473396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly |
scientific article; zbMATH DE number 6473396 |
Statements
Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly (English)
0 references
18 August 2015
0 references
PCB assembly
0 references
sequence dependent TSP
0 references
metaheuristics
0 references
artificial bee colony
0 references
simulated annealing
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8424938321113586
0 references
0.8123853802680969
0 references
0.8062628507614136
0 references
0.7790902256965637
0 references
