A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse (Q2514749): 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: LKH / 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.2013.06.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075076850 / 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: Simulated Annealing: Searching for an Optimal Temperature Schedule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient orderbatching methods in warehouses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and control of warehouse order picking: a literature review / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact algorithm for the sequential ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic / 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: Batch picking in narrow-aisle order picking systems with consideration for picker blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of an annealing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5617409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach for Sequencing Groups of Identical Jobs / 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: Routing order pickers in a warehouse with a middle aisle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a TSP heuristic for routing order pickers in warehouses / rank
 
Normal rank
Property / cites work
 
Property / cites work: The attribute based hill climber / rank
 
Normal rank

Latest revision as of 16:09, 9 July 2024

scientific article
Language Label Description Also known as
English
A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
scientific article

    Statements

    A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse (English)
    0 references
    0 references
    3 February 2015
    0 references
    heuristics
    0 references
    logistics
    0 references
    order picking
    0 references
    batching
    0 references
    precedence
    0 references

    Identifiers