Applying spatial representation techniques to the container packing problem

Ngoi, B. K. A.; Tay, M. L.; Chua, E. S.

doi:10.1080/00207549408956919

Cited by 85 publications

(53 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the remaining space is essentially pre-determined in a static manner. However, for approaches that do not follow the "wall-building" philosophy [Ngoi et al, 1994], characterizing the remaining space may be complicated, depending on the local arrangement of recently-loaded boxes [Bortfeldt et al, 2003]. As our approach falls within this latter category, it is necessary to consider the decomposition and representation of remaining space as different decompositions lead to distinct searching paths and solutions.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach

Wang

Levy

2008

European Journal of Operational Research

View full text Add to dashboard Cite

(2008). A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach. European Journal of Operational Research, 191 (1) AbstractIncreasing fuel costs, post-911 security concerns, and economic globalization provide a strong incentive for container carriers to use available container space more efficiently, thereby minimizing the number of container trips and reducing socio-economic vulnerability. A heuristic algorithm based on a tertiary tree model is proposed to handle the container loading problem (CLP) with weakly heterogeneous boxes. A dynamic space decomposition method based on the tertiary tree structure is developed to partition the remaining container space after a block of homogeneous rectangular boxes is loaded into a container. This decomposition approach, together with an optimal-fitting sequencing and an inner-right-corner-occupying placement rule, permits a holistic loading strategy to pack a container. Comparative studies with existing algorithms and an illustrative example demonstrate the efficiency of this algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%

“…Accordingly, heuristics are often the only viable option [George and Robinson, 1980;Mack et al, 2004;Ngoi et al 1994]. …”

Section: Introductionmentioning

confidence: 99%

A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach

Wang

Levy

2008

European Journal of Operational Research

View full text Add to dashboard Cite

show abstract

“…Passenger transport logistics problems can be divided into loading problem and vehicle routing problem two sub-problems to solve.Loading Problem belong combination [2][3] Mathematics category, the paper loading problem based on rules that CLP (Container Loading Problems) issues.To solve this problem, heuristic algorithm foreign scholars have George & Robinson (referred to as the G & R) algorithm [4], Ngoi algorithm [5] and Loh & Nee algorithm [6].Domestic, He Dayong [7] Based on Space Decomposition layout heuristic genetic algorithm processing container loading problem;Wanch [8] proposed a hybrid genetic algorithm based on stereotypes and adaptive heuristic techniques to solve the actual operation of the most common weak heterogeneous container loading problem;Guo Hongwei [9] proposed the concept of "spatial layout point", and are using heuristic algorithms, genetic algorithms and simulated annealing algorithm.They common drawback of programming complexity, instability, and the solution process is slow.The difficulty of the problem is how to resolve the issue as one-dimensional multi-dimensional problem and how to solve the ultimate problem of sub-problems, which requires the use of dynamic programming.…”

Section: Instructionsmentioning

confidence: 99%

Transport Logistics Optimization Model Of Passenger Car Based On Heuristic Algorithm

Zhou¹,

Zhong

Cheng³

et al. 2016

MATEC Web of Conferences

View full text Add to dashboard Cite

Passenger car logistics transportation problem is at the primary stage of development in China, great economic loss and waste of resources caused in the process of logistics transportation,because most of enterprises in China rely on artificial experience for guidance at present.And use of a particular genetic algorithm to solve this problem by previous also exist many defects ,such as programming complexity, instability and low efficiency etc.In view of this,The heuristic algorithm designing based on the greedy thought and the 0-1 knapsack thought was proposd, according build a universal model of the logistics transportation to the passenger car.Experimental results show, this model not only recording the concrete scheme of loading,also can make the optimization by changing the loading sequence.etc.This model is applicable to solve similar problems of transport logistics,and containing great practical application value and economic value.

show abstract

“…An empty space is discarded if no unloaded box fits into the space. The proposed heuristic makes use of an adaptation of the spatial representation suggested by Ngoi et al (1994), in which a two-dimensional matrix represents a view from the top of the container and contains cells that correspond to the height of potential loading surfaces. The search for available loading spaces amounts to scanning this matrix for contiguous surfaces at the same height.…”

Section: Problem Descriptionmentioning

confidence: 99%

“…Eley (2002) points out that the ease of arrangement and lower complexity in terms of load bearing strength are some of the advantages of this approach. Ngoi et al (1994) develop a spatial representation technique to model the loading process which allows the evaluation of all potential placement locations. Such a representation is used by , Chien & Deng (2004) and an adaptation of the representation is utilized by Bischoff (2006).…”

Section: Introductionmentioning

confidence: 99%

A multi-start random constructive heuristic for the container loading problem

Araújo

Armentano

2007

Pesqui. Oper.

View full text Add to dashboard Cite

This paper deals with the container loading problem which involves the selection of a subset of boxes, each box with a given volume, such that they fit in a single container and maximize its volume utilization subject to orientation and stability constraints. We propose a multi-start random constructive heuristic with a load arrangement that is based on maximal cuboids that fit in given empty spaces. Each instance is adaptively evaluated by a set of criteria, and at each step of the construction process one maximal cuboid is chosen probabilistically from a restricted list of candidates. In order to enhance the flexibility in the construction of a solution, a probabilistic reduction on such cuboids is allowed. Computational tests on several instances from the literature show that the proposed method performs better than other approaches.Keywords: container loading; cuboid arrangement; multi-start random constructive heuristic. ResumoNeste trabalho abordamos o problema de carregamento de contêiner que trata da seleção de um subconjunto de caixas, cada caixa com um dado volume, de forma a maximizar o volume ocupado de um único contêiner sujeito a restrições de orientação e estabilidade. Propomos uma heurística construtiva aleatória com múltiplos inícios que utiliza um arranjo de carga baseado em cubóides que maximizam a ocupação de espaços vazios. Cada instância é avaliada de forma adaptativa por um conjunto de critérios, e em cada passo do processo construtivo um cubóide é selecionado probabilisticamente de uma lista restrita de candidatos. Para aumentar a flexibilidade na construção de uma solução, permite-se uma redução probabilística no tamanho dos cubóides. Resultados computacionais em instâncias da literatura mostram que o método proposto apresenta um desempenho superior a outros enfoques sugeridos na literatura.

show abstract

Applying spatial representation techniques to the container packing problem

Cited by 85 publications

References 6 publications

A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach

A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach

Transport Logistics Optimization Model Of Passenger Car Based On Heuristic Algorithm

A multi-start random constructive heuristic for the container loading problem

Contact Info

Product

Resources

About