A two-stage intelligent search algorithm for the two-dimensional strip packing problem

Leung, Stephen C. H.; Zhang, Defu; Sim, Kwang Mong

doi:10.1016/j.ejor.2011.06.002

Cited by 86 publications

(74 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When compared directly, BBFM has equal performance SVC(SubKP) (Belov et al, 2008) in 10 instances, outperforms SVC in 5 instances and is outperformed by SVC in 6 instances showing very similar performance. When compared to the second best metaheuristic, BBFM matches the performance of ISA (Leung et al, 2011) in 13 of the 21 instances. The only method which finds more optimal solution in this set of instances is the IDBS approach of Wei et al (2011) which finds optimal results for all 21 instances.…”

Section: Comparison To Previous Metaheuristic Approachesmentioning

confidence: 97%

“…Burke et al (2011) used a simple squeaky wheel optimisation methodology (SWP) for the oriented version of the strip packing problem where no rotations are allowed. Leung et al (2011) introduced a two-stage stochastic 'intelligent search algorithm' (ISA) which again relies on a constructive phase and improvement phase based on simulated annealing resulting in some improvement on average over reactive GRASP (Alvarez-Valdes et al, 2009) and SVC(SubKP) (Belov et al, 2008). A simplified parameterless adaptation of this algorithm (SRA) is described by Yang et al (2013).…”

Section: Metaheuristic Methodsmentioning

confidence: 99%

“…BBFM finds more optimal solutions in this set than the previously state-of-the-art SVC(SubKP) (Belov et al, 2008) and GRASP (Alvarez-Valdes et al, 2009) approaches. In terms of optimal solutions, only ISA (Leung et al, 2011) and IDBS Wei et al (2011) are able to find more optimal solutions than BBFM. BBFM is the only technique other than the state-of-the-art IDBS able to find optimal packings for the instances N11 and N13 from this set.…”

Section: Comparison To Previous Metaheuristic Approachesmentioning

confidence: 99%

“…The techniques from the literature are: Best-fit (BF) (Burke et al, 2004), Best-fit with simulated annealing (BF-SA) (Burke et al, 2009), squeaky wheel optimisation (SWP) (Burke et al, 2011), SVC(SubKP) (Belov et al, 2008), GRASP (Alvarez-Valdes et al, 2009), an 'intelligent search algorithm' (ISA) (Leung et al, 2011) and iterative doubling binary search (IDBS) (Wei et al, 2011). In the case that an approach is stochastic, the average performance reported is used to calculate %-gap to compare to our deterministic method.…”

Section: Comparison To Previous Metaheuristic Approachesmentioning

confidence: 99%

See 3 more Smart Citations

Bidirectional best-fit heuristic considering compound placement for two dimensional orthogonal rectangular strip packing

Özcan

Zhang

Drake

2013

Expert Systems with Applications

View full text Add to dashboard Cite

The two dimensional orthogonal rectangular strip packing problem is a common NPhard optimisation problem whereby a set of rectangular shapes must be placed on a fixed width stock sheet with infinite length in such a way that wastage is minimised and material utilisation is maximised. The bidirectional best-fit heuristic is a deterministic approach which has previously been shown to outperform existing heuristic methods as well as many metaheuristics from the literature. Here, we propose a modification to the original bidirectional best-fit heuristic whereby combinations of pairs of rectangles are considered generating improved results over standard benchmark sets.

show abstract

Section: Comparison To Previous Metaheuristic Approachesmentioning

confidence: 97%

Section: Metaheuristic Methodsmentioning

confidence: 99%

Section: Comparison To Previous Metaheuristic Approachesmentioning

confidence: 99%

Section: Comparison To Previous Metaheuristic Approachesmentioning

confidence: 99%

See 2 more Smart Citations

Bidirectional best-fit heuristic considering compound placement for two dimensional orthogonal rectangular strip packing

Özcan

Zhang

Drake

2013

Expert Systems with Applications

View full text Add to dashboard Cite

show abstract

“…• ZDF (Leung et al 2011). We use only the first 13 instances (ZDF 13 ), the number of input rectangles ranging from 580 to 15 096.…”

Section: Computation Experimentsmentioning

confidence: 99%

A Parallel Hyper-heuristic Approach for the Two-dimensional Rectangular Strip-packing Problem

Borgulya

2015

CIT

View full text Add to dashboard Cite

In this paper, we present a parallel hyper-heuristic approach for two-dimensional rectangular strip-packing problems (2DSP). This is an island model with a special master-slave structure, and in all the islands we run a memetic algorithm-based hyper-heuristic (HH). The basic technique of this HH is a memory-based evolutionary technique, the "extended virtual loser" (EVL). The memory-based technique memorises the past events, e.g., past successes of the evolutionary process or bad values of the variables; thus, we can influence the operations of the evolutionary algorithms using this memory. The EVL technique learns the bad values of the variables based on the worst solutions of the population and computes probabilities to control the mutation steps. With the help of the EVL technique, we can use a mutation-omitting recombination operator and obtain a learning mechanism for the selection of heuristics. In the HH, the selection of the low-level heuristics is modified with mutations based on the EVL technique using a local search. The island model achieved good performance. The test instances show that the proposed algorithm is efficient for the rectangular strip-packing problem.

show abstract

Cutting and nesting system of cloud manufacturing based on SOA

Wang

2018

Concurrency and Computation

View full text Add to dashboard Cite

Cutting and nesting are common problems in production manufacturing. However, most existing research works focus on the optimization algorithm rather than commercialized application software system. A kind of cutting and nesting system for cloud manufacturing based on SOA is proposed in the paper, which deploys nesting algorithm distributedly to multi-core computer cluster so as to provide the cutting and nesting service for numerous small and medium-sized enterprises through uniform network service and to realize the integration with existing enterprise system based on SOA. Firstly, the system structure is introduced in the paper. Then, distributed scheduling algorithm, service architecture process, and relevant service interface of the system are stated.Finally, a typical application case for the system is established.

show abstract

A two-stage intelligent search algorithm for the two-dimensional strip packing problem

Cited by 86 publications

References 37 publications

Bidirectional best-fit heuristic considering compound placement for two dimensional orthogonal rectangular strip packing

Bidirectional best-fit heuristic considering compound placement for two dimensional orthogonal rectangular strip packing

A Parallel Hyper-heuristic Approach for the Two-dimensional Rectangular Strip-packing Problem

Cutting and nesting system of cloud manufacturing based on SOA

Contact Info

Product

Resources

About