A two-phase approach for single container loading with weakly heterogeneous boxes (Q2312435): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraints in container loading -- a state-of-the-art review / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tree Search Algorithm for Solving the Container Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new iterative-doubling greedy-lookahead algorithm for the single container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A beam search approach to the container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood structures for the container loading problem: a VNS implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel multi-population biased random-key genetic algorithm for a container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Genetic Algorithm for Solving the Container Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel hybrid local search algorithm for the container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel hybrid tabu search approach to container loading / rank
 
Normal rank
Property / cites work
 
Property / cites work: An AND/OR-graph approach to the container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving container loading problems by block arrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient placement heuristic for three-dimensional rectangular packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition based hybrid metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Load planning for shipments of low density products / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Optimization Framework for Cutting and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: VCS: A new heuristic function for selecting boxes in the single container loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiple container loading problem with preference / rank
 
Normal rank

Revision as of 19:20, 19 July 2024

scientific article
Language Label Description Also known as
English
A two-phase approach for single container loading with weakly heterogeneous boxes
scientific article

    Statements

    A two-phase approach for single container loading with weakly heterogeneous boxes (English)
    0 references
    0 references
    8 July 2019
    0 references
    Summary: We propose in this paper a two-phase approach that decomposes the process of solving the three-dimensional single \textit{Container Loading Problem} (CLP) into subsequent tasks: (i) the generation of blocks of boxes and (ii) the loading of blocks into the container. The first phase is deterministic, and it is performed by means of constructive algorithms from the literature. The second phase is non-deterministic, and it is performed with the use of \textit{Generate-and-Solve} (GS), a problem-independent hybrid optimization framework based on problem instance reduction that combines a metaheuristic with an exact solver. Computational experiments performed on benchmark instances indicate that our approach presents competitive results compared to those found by state-of-the-art algorithms, particularly for problem instances consisting of a few types of boxes. In fact, we present new best solutions for classical instances from groups BR1 and BR2.
    0 references
    single container loading
    0 references
    hybrid metaheuristics
    0 references
    generate-and-solve
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references