Results 1  10
of
18,112
New approaches to the pallet loading problem
, 1993
"... Abstract This paper considers the pallet loading problem of packing a large containing rectangle, orthogonally, with identical copies of a small `contained ' rectangle. The problem is commonly solved by applying heuristic algorithms, mostly based on block designs. The optimality of a heuristic ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract This paper considers the pallet loading problem of packing a large containing rectangle, orthogonally, with identical copies of a small `contained ' rectangle. The problem is commonly solved by applying heuristic algorithms, mostly based on block designs. The optimality of a heuristic
Generating Stable Loading Patterns for Pallet Loading Problems
"... Abstract. This paper describes an integer programming model for generating stable loading patterns for the Pallet Loading Problem. The algorithm always gives optimal or nearoptimal utilization of the pallet area and fulfills stability criteria for 98% of the test cases. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. This paper describes an integer programming model for generating stable loading patterns for the Pallet Loading Problem. The algorithm always gives optimal or nearoptimal utilization of the pallet area and fulfills stability criteria for 98% of the test cases.
An Efficient Approach for the MultiPallet Loading Problem
 European Journal of Operational Research
, 1997
"... The Distributor's or MultiPallet Loading Problem is considered in this paper. This problem is to load a set of distinct products with given quantities on pallets (or in containers) and to minimize the number of pallets needed. The theoretical objective of finding the best space utilization is ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
The Distributor's or MultiPallet Loading Problem is considered in this paper. This problem is to load a set of distinct products with given quantities on pallets (or in containers) and to minimize the number of pallets needed. The theoretical objective of finding the best space utilization
Analysis of upper bounds for the Pallet Loading Problem
, 2001
"... This paper is concerned with upper bounds for the wellknown Pallet Loading Problem (PLP), which is the problem of packing identical boxes into a rectangular pallet so as to maximize the number of boxes fitted. After giving a comprehensive review of the known upper bounds in the literature, we condu ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
This paper is concerned with upper bounds for the wellknown Pallet Loading Problem (PLP), which is the problem of packing identical boxes into a rectangular pallet so as to maximize the number of boxes fitted. After giving a comprehensive review of the known upper bounds in the literature, we
A Branch and Cut Algorithm for the Pallet Loading Problem
, 2003
"... We propose a branch and cut algorithm for the Pallet Loading Problem. The 01 formulation proposed by Beasley for cutting problems is adapted to the problem, adding new constraints and new procedures for variable reduction. We then take advantage of the relationship between this problem and the maxi ..."
Abstract
 Add to MetaCart
We propose a branch and cut algorithm for the Pallet Loading Problem. The 01 formulation proposed by Beasley for cutting problems is adapted to the problem, adding new constraints and new procedures for variable reduction. We then take advantage of the relationship between this problem
A new heuristic for the Pallet Loading Problem
 JORS
, 1996
"... this paper we will analyse the structure of optimal packing patterns and we will introduce the denotation of G4structure. Then we propose a new heuristic for solving the PLP. Since the algorithm is based on dynamic programming it is of pseudopolynomial type. The computational experiments show that ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
this paper we will analyse the structure of optimal packing patterns and we will introduce the denotation of G4structure. Then we propose a new heuristic for solving the PLP. Since the algorithm is based on dynamic programming it is of pseudopolynomial type. The computational experiments show that instances having more than 200 items in an (optimal) packing pattern can be handled with small computational amount of time.
The minimum size instance of a Pallet Loading Problem equivalence class
, 2007
"... The Pallet Loading Problem (PLP) maximizes the number of identical rectangular boxes placed within a rectangular pallet. Boxes may be rotated 90 ° so long as they are packed with edges parallel to the pallet’s edges, i.e., in an orthogonal packing. This paper defines the Minimum Size Instance (MSI) ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The Pallet Loading Problem (PLP) maximizes the number of identical rectangular boxes placed within a rectangular pallet. Boxes may be rotated 90 ° so long as they are packed with edges parallel to the pallet’s edges, i.e., in an orthogonal packing. This paper defines the Minimum Size Instance (MSI
A Tree Search Algorithm for the Manufacturer’s Pallet Loading Problem
"... Abstract. Transportation and warehouse costs are the two major components of the total logistics cost. To increase the material handling efficiency both in transit and in the warehouse, pallets have been used widely in logistics systems. The manufacturer’s pallet loading problem (MPLP) is to pack id ..."
Abstract
 Add to MetaCart
Abstract. Transportation and warehouse costs are the two major components of the total logistics cost. To increase the material handling efficiency both in transit and in the warehouse, pallets have been used widely in logistics systems. The manufacturer’s pallet loading problem (MPLP) is to pack
A note on an Lapproach for solving the manufacturer’s pallet loading problem
 Journal of the Operational Research Society. To Appear
, 2005
"... An Lapproach for packing (l, w)rectangles into an (L, W)rectangle was introduced in an earlier work by Lins, Lins and Morabito. They conjecture that the Lapproach is exact and point out its runtime requirements as the main drawback. In this note it is shown that, by simply using a different dat ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
data structure, the runtime is considerably reduced in spite of larger (but affordable) memory requirements. This reduction is important for practical purposes since it makes the algorithm much more acceptable for supporting actual decisions in pallet loading. Intensive numerical experiments showing
Results 1  10
of
18,112