Parallel variable neighborhood search for the min–max order batching problem (Q5278230): Difference between revisions

From MaRDI portal
Added link to MaRDI 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: CUDA / 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.1111/itor.12309 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2549531087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature Article—Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Strategies for Meta-Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient orderbatching methods in warehouses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the vertex separation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parallel variable neighborhood search for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for on-line order batching in an order picking warehouse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search heuristics for the order batching problem in manual order picking systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing methods for warehouses with multiple cross aisles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining intensification and diversification strategies in VNS. An application to the vertex separation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5191184 / rank
 
Normal rank

Latest revision as of 02:35, 14 July 2024

scientific article; zbMATH DE number 6744664
Language Label Description Also known as
English
Parallel variable neighborhood search for the min–max order batching problem
scientific article; zbMATH DE number 6744664

    Statements

    Parallel variable neighborhood search for the min–max order batching problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 July 2017
    0 references
    min-max order batching problem
    0 references
    parallel variable neighborhood search
    0 references
    general variable neighborhood search
    0 references

    Identifiers