Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming

Gomes, António Alberto; Oliveira, José Fernando

doi:10.1016/j.ejor.2004.09.008

Cited by 185 publications

(151 citation statements)

References 17 publications

Supporting

Mentioning

126

Contrasting

Unclassified

Order By: Relevance

“…Additionally, we present the upper bound (UB) used to estimate the big-M coefficients in constraints (5), for more details see [3]. UB was calculated using the bottom-left heuristic proposed in [6] with one thousand random input sequences. Table 2 reports the computational experiments of NFP-CM proposed in [3] and the improved NFP-CM, i.e., NFP-CM with symmetry breaking constraints (8) and (13)-(16).…”

Section: Resultsmentioning

confidence: 99%

MIP models for the irregular strip packing problem: new symmetry breaking constraints

2017

View full text Add to dashboard Cite

Abstract. The irregular strip packing problem consists in minimizing the length used to cut a set of pieces from a board with fixed width. Recently, a mixed integer programming model was proposed for the problem, but it may allow a large number of symmetric solutions. In this paper, new symmetry breaking constraints are proposed to improve the model. Computational experiments were performed for instances with convex pieces. The results show the proposed formulation is better than the previous one for most instances, since it improves lower bounds and reduces run-time and number of nodes explored to prove optimality.

show abstract

Section: Resultsmentioning

confidence: 99%

MIP models for the irregular strip packing problem: new symmetry breaking constraints

2017

View full text Add to dashboard Cite

show abstract

“…These instances were listed in table 1. The computational results were compared with the GLSHA algorithm and the SAHA algorithm [11].…”

Section: Methodsmentioning

confidence: 99%

A hierarchical layout design method based on rubber band potentialenergy descending

Xiao

Yan

et al. 2016

MATEC Web of Conferences

View full text Add to dashboard Cite

Abstract. Strip packing problems is one important sub-problem of the Cutting stock problems. Its application domains include sheet metal, ship making, wood, furniture, garment, shoes and glass. In this paper, a hierarchical layout design method based on rubber band potential-energy descending was proposed. The basic concept of the rubber band enclosing model was described in detail. We divided the layout process into three different stages: initial layout stage, rubber band enclosing stage and local adjustment stage. In different stages, the most efficient strategies were employed for further improving the layout solution. Computational results show that the proposed method performed better than the GLSHA algorithm for three out of nine instances in utilization.

show abstract

“…Lee et al [4] used direct trigonometry to determine the interference among items and the container. Recently, the nofit polygon (NFP) has been used by several researchers [5][6][7][8][9] to ensure feasible layouts.…”

Section: E-mail Address: Mtsuzuki@uspbr (Msg Tsuzuki)mentioning

confidence: 99%

“…TNP: total number of polygons; ANE: the average number of edges (cited from [6]the total number of vertexes is exactly the same as the total number of edges). the corresponding collision free region, represented by the hatch pattern filled polygons with degenerated edges and a degenerated vertex, are displayed in Fig.…”

Section: Tablementioning

confidence: 99%

Collision free region determination by modified polygonal Boolean operations

Sato

Martins

Tsuzuki

2013

Computer-Aided Design

View full text Add to dashboard Cite

Solving Irregular Strip Packing problems by hybridising simulated annealing and linear programming

Cited by 185 publications

References 17 publications

MIP models for the irregular strip packing problem: new symmetry breaking constraints

MIP models for the irregular strip packing problem: new symmetry breaking constraints

A hierarchical layout design method based on rubber band potentialenergy descending

Collision free region determination by modified polygonal Boolean operations

Contact Info

Product

Resources

About