Robust hyper-heuristic algorithms for the offline oriented/non-oriented 2D bin packing problems

Beyaz, Muhammed; Dökeroğlu, Tansel; Çoşar, Ahmet

doi:10.1016/j.asoc.2015.06.063

Cited by 22 publications

(11 citation statements)

References 46 publications

(59 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Hyper-heuristic algorithm based on swap-rotation mutation operators proposed by [38]. This algorithm allows rotation of the items.…”

Section: Hha-no (Sr)mentioning

confidence: 99%

Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem

Cid-García

Ríos-Solís

2020

PLoS ONE

View full text Add to dashboard Cite

We present a two-stage methodology called Positions and Covering (P&C) to solve the twodimensional bin packing problem (2D-BPP). The objective of this classical combinatorial NP-hard problem is to pack a set of items (small rectangles) in the minimum number of bins (larger rectangles). The first stage is the key-point of the Positions and Covering, where for each item, it is generated in a pseudo-polynomial way a set of valid positions that indicate the possible ways of packing the item into the bin. In the second stage, a new set-covering formulation, strengthen with three sets of valid inequalities, is used to select the optimal non-overlapping configuration of items for each bin. Experimental results for the P&C method are presented and compared with some of the best algorithms in the literature for small and medium size instances. Furthermore, we are considering both cases of the 2D-BPP, with and without rotations of the items by 90˚. To the best of our knowledge, this is one of the first exact approaches to obtain optimal solutions for the rotation case. OPEN ACCESSCitation: Cid-Garcia NM, Rios-Solis YA (2020) Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem. PLoS ONE 15(4): e0229358. https://doi.

show abstract

“…Hyper-heuristic algorithm based on swap-rotation mutation operators proposed by [38]. This algorithm allows rotation of the items.…”

Section: Hha-no (Sr)mentioning

confidence: 99%

Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem

Cid-García

Ríos-Solís

2020

PLoS ONE

View full text Add to dashboard Cite

show abstract

“…Hyper-heuristics have been successfully applied to solve various problems in routing and scheduling (see Danach et al 2015a, b;Monemi et al 2015;Marshall et al 2014; Garrido and Riff 2010; Garrido and Castro 2012), scheduling (see Ahmed et al 2015;Zheng et al 2015;Aron et al 2015), and bin packing (see Sim et al 2015;Beyaz et al 2015;Ross et al 2002) among others. Özcan et al (2012) categorizes such methods as in the following: (i) Purely Random selection that consists of randomly selecting a low-level heuristic from among a set of existing heuristics (see also Özcan and Kheiri 2012), (ii) Random Descent selection that randomly selects a low-level-heuristic and applies it until the solution in hand is improved (see Kendall and Mohamad 2004 as an example of such a selection strategy).…”

Section: Hyper-heuristic For Csaphlrpmentioning

confidence: 99%

The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach

Danach

Gelareh²,

Monemi

2019

EURO Journal on Transportation and Logistics

View full text Add to dashboard Cite

A variant of the hub location routing problem studied in this work, which is the problem of locating a set of hub nodes, is establishing the hub-level network and allocating the spoke nodes to the hub nodes. As a particular property of this problem, each cluster of spoke nodes allocated to a hub constitutes a directed route that starts from the hub, visits all the spokes in the same cluster, and terminates to the same hub. We propose a hybrid of hyper-heuristic and a relax-and-cut solution method, which includes cooperation among several low-level heuristics governed and controlled by a learning mechanism. This hybridization provides a mechanism in which the obtained dual information through the Lagrangian relaxation (bundle) method being utilized to guide the local searches for constructing/improving feasible solutions. Several classes of valid inequalities as well as efficient separation routings are also proposed for being used within the relax-and-cut approach. Our extensive computational experiments confirm the efficiency of this solution method in terms of quality as well as computational time.

show abstract

“…Burke et al [18] proposed a genetic programming contributing to a growing research area that represents a paradigm shift in search methodologies. Beyaz et al [19] proposed an algorithm that introduces new crossover and mutation operators for the selection of the heuristics to obtain a high percentage of the optimal solutions. Hong et al [20] proposed a mixed bin packing algorithm combined with a heuristic packing and the best fit algorithm as a hybrid heuristic algorithm based on iterative simulated annealing.…”

Section: Related Researchmentioning

confidence: 99%

Efficient Free-Form Contour Packing Based on Code Matching Strategy

Guo

et al. 2019

IEEE Access

View full text Add to dashboard Cite

Freeform surfaces exist widely in the stock cutting process of clinical prosthesis preparation, aviation, ship, and other manufacturing industries. The free-form contours of surfaces need to be packed before they are machined from raw materials. The existing methods search a contour position by rotating the contour and translating it to connect other contours for packing. The relative position between two contours will be changed after the rotation as the contour description is lack of geometric invariance. These methods easily miss the best layout position resulting in interspaces in the raw material. Moreover, this result seriously reduces the performance and efficiency of an automatic packing system. Therefore, a new packing algorithm is proposed in this paper by combining the geometric invariant description and coding matching for contours to solve the contour rotating and position connecting problems. The optimal position of a contour can be found directly and then connected by the extracted similar complement features of the contour. The experimental results show that the proposed method can greatly improve quality and efficiency of the layout, especially in the material utilization. INDEX TERMS Computer graphics, code matching, shape, free-form contour packing, freeman chain code, geometric invariant description, layout.

show abstract

Robust hyper-heuristic algorithms for the offline oriented/non-oriented 2D bin packing problems

Cited by 22 publications

References 46 publications

Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem

Positions and covering: A two-stage methodology to obtain optimal solutions for the 2d-bin packing problem

The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach

Efficient Free-Form Contour Packing Based on Code Matching Strategy

Contact Info

Product

Resources

About