A beam search algorithm for minimizing crane times in premarshalling problems (Q2672129): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DOGS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2022.01.038 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4210584346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bounded beam search algorithm for the block relocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree search procedure for the container pre-marshalling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Price Procedure for the Container Premarshalling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deep learning assisted heuristic tree search for the container pre-marshalling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A biased random-key genetic algorithm for the container pre-marshalling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-heuristic approach for solving the pre-marshalling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient ant colony optimization algorithm for the blocks relocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimization model for the container pre-marshalling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for retrieving containers from a yard / rank
 
Normal rank
Property / cites work
 
Property / cites work: An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a large cutting problem in the glass manufacturing industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming models for the pre-marshalling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new effective unified model for solving the pre-marshalling and block relocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound approach for large pre-marshalling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasibility-based heuristic for the container pre-marshalling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pre-processing a container yard under limited available time / rank
 
Normal rank

Latest revision as of 05:47, 29 July 2024

scientific article
Language Label Description Also known as
English
A beam search algorithm for minimizing crane times in premarshalling problems
scientific article

    Statements

    A beam search algorithm for minimizing crane times in premarshalling problems (English)
    0 references
    8 June 2022
    0 references
    logistics
    0 references
    container premarshalling
    0 references
    crane time
    0 references
    beam search
    0 references

    Identifiers

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