From a Packing Problem to Quantitative Recurrence in [0,1] and the Lagrange Spectrum of Interval Exchanges

A Novel Clone Selection Algorithm and its Application for Three Dimension Bin Packing Problem of Web Mode

2010 Third International Joint Conference on Computational Science and Optimization ◽

10.1109/cso.2010.169 ◽

2010 ◽

Author(s):

Jian-hua Li ◽

Hui Chen ◽

Lina Ren

Keyword(s):

Bin Packing ◽

Packing Problem ◽

Three Dimension ◽

Selection Algorithm ◽

Clone Selection ◽

Bin Packing Problem

Bin Packing Problem with Compatible Categories Utilizing an Enhanced Variable Neighborhood Search Algorithm

2019 IEEE 4th International Conference on Technology, Informatics, Management, Engineering & Environment (TIME-E) ◽

10.1109/time-e47986.2019.9353310 ◽

2019 ◽

Author(s):

Jasmin A. Caliwag ◽

Ma. Christina C. Aragon ◽

Ruji P. Medina

Keyword(s):

Variable Neighborhood Search ◽

Bin Packing ◽

Search Algorithm ◽

Packing Problem ◽

Neighborhood Search ◽

Bin Packing Problem ◽

Neighborhood Search Algorithm

A Three-Stage Layer-Based Heuristic to Solve the 3D Bin-Packing Problem under Balancing Constraint

Journal of King Saud University - Computer and Information Sciences ◽

10.1016/j.jksuci.2021.07.007 ◽

2021 ◽

Author(s):

Youssef Harrath

Keyword(s):

Bin Packing ◽

Packing Problem ◽

Bin Packing Problem

The Offline Virtual Network Function Packing Problem

2021 24th Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN) ◽

10.1109/icin51074.2021.9385554 ◽

2021 ◽

Author(s):

Yannick Carlinet ◽

Eric Gourdin ◽

Nancy Perrot

Keyword(s):

Packing Problem ◽

Virtual Network ◽

Network Function ◽

Virtual Network Function

Strategy Acquisition of the 3-D Packing Problem in Multiagent Environment. GA-based Hierarchical Tuning.

TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C ◽

10.1299/kikaic.60.3219 ◽

1994 ◽

Vol 60 (577) ◽

pp. 3219-3225

Author(s):

Takashi Kawakami ◽

Yukinori Kakazu

Keyword(s):

Packing Problem ◽

Strategy Acquisition

Ranking lower bounds for the bin-packing problem

European Journal of Operational Research ◽

10.1016/j.ejor.2003.06.019 ◽

2005 ◽

Vol 160 (1) ◽

pp. 34-46 ◽

Cited By ~ 11

Author(s):

Samir Elhedhli

Keyword(s):

Lower Bounds ◽

Bin Packing ◽

Packing Problem ◽

Bin Packing Problem

Bifix codes and interval exchanges

Journal of Pure and Applied Algebra ◽

10.1016/j.jpaa.2014.09.028 ◽

2015 ◽

Vol 219 (7) ◽

pp. 2781-2798 ◽

Cited By ~ 10

Author(s):

Valérie Berthé ◽

Clelia De Felice ◽

Francesco Dolce ◽

Julien Leroy ◽

Dominique Perrin ◽

...

Keyword(s):

Interval Exchanges

A Fast 3D-BSG Algorithm for 3D Packing Problem

2007 IEEE International Symposium on Circuits and Systems ◽

10.1109/iscas.2007.378499 ◽

2007 ◽

Cited By ~ 5

Author(s):

Lingyi Zhang ◽

Sheqin Dong ◽

Xianlong Hong ◽

Yuchun Ma

Keyword(s):

Packing Problem ◽

3D Packing

The master bay plan problem: a solution method based on its connection to the three-dimensional bin packing problem

IMA Journal of Management Mathematics ◽

10.1093/imaman/14.3.251 ◽

2003 ◽

Vol 14 (3) ◽

pp. 251-269 ◽

Cited By ~ 26

Author(s):

A. Sciomachen

Keyword(s):

Bin Packing ◽

Solution Method ◽

Three Dimensional ◽

Packing Problem ◽

Bin Packing Problem

AN EFFICIENT APPROACH FOR THE THREE-DIMENSIONAL CONTAINER PACKING PROBLEM WITH PRACTICAL CONSTRAINTS

Asia Pacific Journal of Operational Research ◽

10.1142/s0217595904000254 ◽

2004 ◽

Vol 21 (03) ◽

pp. 279-295 ◽

Cited By ~ 26

Author(s):

ZHIHONG JIN ◽

KATSUHISA OHNO ◽

JIALI DU

Keyword(s):

Three Dimensional ◽

Real Life ◽

Packing Problem ◽

Utilization Rate ◽

Benchmark Problems ◽

Rectangular Container ◽

Efficient Packing ◽

High Degree ◽

Practical Constraints ◽

Inherent Stability

This paper deals with the three-dimensional container packing problem (3DCPP), which is to pack a number of items orthogonally onto a rectangular container so that the utilization rate of the container space or the total value of loaded items is maximized. Besides the above objectives, some other practical constraints, such as loading stability, the rotation of items around the height axis, and the fixed loading (unloading) orders, must be considered for the real-life 3DCPP. In this paper, a sub-volume based simulated annealing meta-heuristic algorithm is proposed, which aims at generating flexible and efficient packing patterns and providing a high degree of inherent stability at the same time. Computational experiments on benchmark problems show its efficiency.