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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE access Jg. 11; S. 1
Hauptverfasser:	Debevere, Pieter, Sugimura, Masahiko, Parizy, Matthieu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 01.01.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!