Efficient 2D irregular layout by vector superposition NFP and mixed-integer programming

As a typical combinatorial optimization problem, two-dimensional (2D) irregular layout is a common problem in the engineering field. No-fit polygon (NFP) is a common geometric tool for solving layout problems. Although it is necessary to calculate NFP frequently in the process of layout, the search...

Celý popis

Podrobná bibliografie

Vydáno v:	Expert systems with applications Ročník 230; s. 120548
Hlavní autoři:	Guo, Baosu, Li, Jinrui, Zhang, Yu, Wu, Fenghe, Peng, Qingjin
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 15.11.2023
Témata:	2D irregular layout Combinatorial optimization Mixed integer programming model No-fit polygon Combinatorial optimization No-fit polygon 2D irregular layout Mixed integer programming model
ISSN:	0957-4174, 1873-6793
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!