The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem (Q2668601): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2020.105168 / 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.cor.2020.105168 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3112004685 / 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: Exact Algorithms for the Clustered Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient and general approach for the joint order batching and picker routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane / 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: Efficient orderbatching methods in warehouses / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast two-level variable neighborhood search for the clustered vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient transformation of the generalized vehicle routing problem / 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: Large multiple neighborhood search for the clustered vehicle-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of the soft-clustered vehicle-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study on order-batching methods of order-picking in a distribution centre with two cross-aisles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition-based method for solving the clustered vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search strategies for the order batching problem / 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: New mathematical models of the generalized vehicle routing problem and extensions / 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: A comparison of heuristics for the problem of batching orders for warehouse selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing / 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: Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally solving the joint order batching and picker routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid metaheuristics for the clustered vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint order batching and order picking in warehouse operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The impact of order batching and picking area zoning on order picking system performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2020.105168 / rank
 
Normal rank

Latest revision as of 15:37, 19 December 2024

scientific article
Language Label Description Also known as
English
The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem
scientific article

    Statements

    The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem (English)
    0 references
    0 references
    0 references
    0 references
    7 March 2022
    0 references
    order batching
    0 references
    picker routing
    0 references
    vehicle routing
    0 references
    variable neighborhood search
    0 references

    Identifiers