A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917401911623680 |
|---|---|
| author | Borges, Jennifer C. Florentino, Helenice de O. Rangel, Socorro |
| author_facet | Borges, Jennifer C. Florentino, Helenice de O. Rangel, Socorro |
| contents | Research on multi-objective combinatorial optimization and on the Cutting Stock Problem (CSP) has been widely developed over the years. In contrast, the multi-objective Cutting Stock Problem has received limited attention and has been explored in only a small number of studies. In this paper a bi-objective study of the one-dimensional and the two-dimensional CSP is presented. It distinguishes itself from other research in the literature in two key aspects, among others. The first regards the model used to represent the problem and the second is the solution strategy based on dynamic column generation embedded into scalarization methods. Three methods adapted from the literature to analyse the trade-off between the minimization of the total number of objects and the total number of saw cycles are implemented. The computational results show that the use of dynamic column generation provides a better approximation of the Pareto front. As for the scalarization methods, none stood out. In fact, they can be viewed as complementary. The cardinality and hypervolume of an approximation of the Pareto front built from the union of the points generated by the three methods is always greater than the ones generated by each one. Dealing with the multi-objective nature of CSP, this study provides insights and computational tools to help industry obtain pragmatic solutions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_10850 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem Borges, Jennifer C. Florentino, Helenice de O. Rangel, Socorro Optimization and Control 90C90, 90C11, 90C29, 90C59 Research on multi-objective combinatorial optimization and on the Cutting Stock Problem (CSP) has been widely developed over the years. In contrast, the multi-objective Cutting Stock Problem has received limited attention and has been explored in only a small number of studies. In this paper a bi-objective study of the one-dimensional and the two-dimensional CSP is presented. It distinguishes itself from other research in the literature in two key aspects, among others. The first regards the model used to represent the problem and the second is the solution strategy based on dynamic column generation embedded into scalarization methods. Three methods adapted from the literature to analyse the trade-off between the minimization of the total number of objects and the total number of saw cycles are implemented. The computational results show that the use of dynamic column generation provides a better approximation of the Pareto front. As for the scalarization methods, none stood out. In fact, they can be viewed as complementary. The cardinality and hypervolume of an approximation of the Pareto front built from the union of the points generated by the three methods is always greater than the ones generated by each one. Dealing with the multi-objective nature of CSP, this study provides insights and computational tools to help industry obtain pragmatic solutions. |
| title | A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem |
| topic | Optimization and Control 90C90, 90C11, 90C29, 90C59 |
| url | https://arxiv.org/abs/2604.10850 |