Quadratic Unconstrained Binary optimization for the Automotive Paint Shop Problem

The Binary Paint Shop Problem (BPSP) is a combinatorial optimization problem which draws inspiration from the automotive paint shop. Its binary nature, making it a good fit for Quadratic Unconstrained Binary Optimization (QUBO) solvers, has been well studied but its industrial applications are limit...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE access Ročník 11; s. 1
Hlavní autoři:	Debevere, Pieter, Sugimura, Masahiko, Parizy, Matthieu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 01.01.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Automobiles Automotive engineering Automotive paint shop Color Combinatorial analysis Constraints evolutionary algorithms Heuristic Image color analysis Industrial applications Integers k-hot constraints Lower bounds Mathematical models Optimization Paints Quadratic programming Quadratic unconstrained binary optimization scatter search Tabu search
ISSN:	2169-3536, 2169-3536
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!

Buďte první, kdo okomentuje tento záznam!