Optimally solving the joint order batching and picker routing problem (Q1683118): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(6 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MySQL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2603290257 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1703.06531 / 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: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated arc routing problem: Valid inequalities and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and solving the mixed capacitated general routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem on a graph and some related integer polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halin graphs and the travelling salesman problem / 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: A cutting plane procedure for the travelling salesman problem on road networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming and the graphical traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem in graphs with some excluded minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692593 / 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: Logic cuts for processing networks with fixed charges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phase branch-and-cut for the mixed capacitated general routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient orderbatching methods in warehouses / rank
 
Normal rank
Property / cites work
 
Property / cites work: An order-picking operations system for managing the batching activities in a warehouse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact formulations of the Steiner traveling salesman problem and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity in pricing routines for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fundamental problem in vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / 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: A new mathematical programming formulation for the single-picker routing problem / 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: Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 19:37, 14 July 2024

scientific article
Language Label Description Also known as
English
Optimally solving the joint order batching and picker routing problem
scientific article

    Statements

    Optimally solving the joint order batching and picker routing problem (English)
    0 references
    6 December 2017
    0 references
    integer programming
    0 references
    inventory management
    0 references
    order batching
    0 references
    order picking
    0 references
    picker routing
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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