An analytical model for the container loading problem

Chen, C.S.; Lee, S.M.; Shen, Qing

doi:10.1016/0377-2217(94)00002-t

Cited by 308 publications

(176 citation statements)

References 23 publications

Supporting

Mentioning

157

Contrasting

Unclassified

Order By: Relevance

“…Fortunately, heuristic methods find optimal or good quality solutions in many cases. See, for example, (Beasley, 1995;Beasley 2004;Chen et al, 1995;Christofides and Hadjiconstantinou, 1995;Hadjiconstantinou and Christofides 1995;Tsai et al, 1993).…”

Section: Introductionmentioning

confidence: 99%

Method of sentinels for packing items within arbitrary convex regions

Birgin

Martínez

Mascarenhas

et al. 2006

Journal of the Operational Research Society

View full text Add to dashboard Cite

A new method is introduced for packing items in convex regions of the Euclidian ndimensional space. By means of this approach the packing problem becomes a global finitedimensional continuous optimization problem. The strategy is based on the new concept of sentinels. Sentinels sets are finite subsets of the items to be packed such that, when two items are superposed, at least one sentinel of one item is in the interior of the other. Minimal sets of sentinels are found in simple 2−dimensional cases. Numerical experiments and pictures showing the potentiality of the new technique are presented.

show abstract

Section: Introductionmentioning

confidence: 99%

Method of sentinels for packing items within arbitrary convex regions

Birgin

Martínez

Mascarenhas

et al. 2006

Journal of the Operational Research Society

View full text Add to dashboard Cite

show abstract

“…A scheme is obtained by the Matlab program, that there are 6 materials boxes in 10 materials boxes are loaded into the vehicle carriage, respectively (1,3,4,5,6,9), The specific load optimization results of the 6 kinds of materials boxes is shown in Table 6. The solving process is as follows: Open the matlab7.0 software; add the gatbx folder to the toolbox folder of the Matlab toolbox; open the Knap_2D.m code procedures to enter the program interface, as shown in Fig.…”

Section: The Example and The Results Analysesmentioning

confidence: 99%

“…According to the decoding method in chapter 4.2, the material boxes loading number (1,3,4,5,6,9) Table 5. The loading mode number.…”

Section: The Example and The Results Analysesmentioning

confidence: 99%

See 1 more Smart Citation

Multi-Objective Optimization Model and Solution for Easily Broken Material Loading Based on Genetic Algorithms Under VMI

Du¹,

Liang²

2015

TOAUTOCJ

View full text Add to dashboard Cite

Abstract:The material loading operation plan by artificial preparation has been unable to meet the requirements of the timely delivery when the third party logistics enterprises are involved in vendor managed inventory strategy. According to the characteristics of the easily broken material the multi-objective optimization model was established. The objective functions of this model were the vehicle loading weight utilization rate and the volume utilization rate. The five constraints were introduced. The optimal solution of the model was obtained by genetic algorithm. The solving process was introduced including the pre processing coding, the individual coding, the fitness selection and the genetic operation. The genetic algorithm program was designed by using MATLAB genetic algorithm toolbox. The easily broken material boxes loading optimization of the VMI distribution center was as an example to verify the validity of the program. Thus a whole solution which contains the optimization model and the solution procedure was provided for the easily broken material loading.

show abstract

“…Chen, Lee and Shen [CLS95] approached the problem with integerprogramming and Fekete and Schepers [FS97,FS04b] presented a general multidimensional model based on graph theory, where bounds based on conservative scales [FSdV07] (dual feasible functions) are used to prune the search. In a more recent paper, Clautiaux et al [CAdC08], give a survey of dual feasible functions and their use for bounding the search tree in cutting problems.…”

Section: Orthogonal Knapsack Problem (Okp-d)mentioning

confidence: 99%

Multi-dimensional bin packing problems with guillotine constraints

Amossen

Pisinger²

2010

Computers & Operations Research

View full text Add to dashboard Cite

The problem addressed in this paper is the decision problem of determining if a set of multi-dimensional rectangular boxes can be orthogonally packed into a rectangular bin while satisfying the requirement that the packing should be guillotine cuttable. That is, there should exist a series of face parallel straight cuts that can recursively cut the bin into pieces so that each piece contains a box and no box has been intersected by a cut. The unrestricted problem is known to be NP-hard. In this paper we present a generalization of a constructive algorithm for the multi-dimensional bin packing problem, with and without the guillotine constraint, based on constraint programming.

show abstract

An analytical model for the container loading problem

Cited by 308 publications

References 23 publications

Method of sentinels for packing items within arbitrary convex regions

Method of sentinels for packing items within arbitrary convex regions

Multi-Objective Optimization Model and Solution for Easily Broken Material Loading Based on Genetic Algorithms Under VMI

Multi-dimensional bin packing problems with guillotine constraints

Contact Info

Product

Resources

About