On the public citation graph
Optimising Warehouse Order Picking: Real Case Practical Application in the Shoe Manufacturing Industry
0 signed · 59 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/1-84628-184-9_1openalex-extracted
Computational Intelligence: An Introduction
inferredcites →https://doi.org/10.1007/s10696-022-09445-yopenalex-extracted
Solving the picker routing problem in multi-block high-level storage systems using metaheuristics
inferredcites →https://doi.org/10.1007/s10845-019-01470-3openalex-extracted
Genetic algorithms applied to integration and optimization of billing and picking processes
inferredcites →https://doi.org/10.1007/s10845-020-01653-3openalex-extracted
Genetic algorithm based approaches to solve the order batching problem and a case study in a distribution center
inferredcites →https://doi.org/10.1007/s42452-020-2076-xopenalex-extracted
Route optimization for warehouse order picking operations via vehicle routing and simulation
inferredcites →https://doi.org/10.1016/j.asoc.2016.12.026openalex-extracted
A tabu search approach to solving the picking routing problem for large- and medium-size distribution centres considering the availability of inventory and K heterogeneous material handling equipment
inferredcites →https://doi.org/10.1016/j.asoc.2018.11.019openalex-extracted
Using list-based simulated annealing and genetic algorithm for order batching and picker routing in put wall based picking systems
inferredcites →https://doi.org/10.1016/j.cie.2013.06.013openalex-extracted
An ant colony optimization routing algorithm for two order pickers with congestion consideration
inferredcites →https://doi.org/10.1016/j.cie.2016.03.009openalex-extracted
Joint order batching and picker Manhattan routing problem
inferredcites →https://doi.org/10.1016/j.cie.2018.06.015openalex-extracted
Picker routing and storage-assignment strategies for precedence-constrained order picking
inferredcites →https://doi.org/10.1016/j.cie.2019.106129openalex-extracted
Two-stage storage assignment to minimize travel time and congestion for warehouse order picking operations
inferredcites →https://doi.org/10.1016/j.cie.2020.106269openalex-extracted
Operational workload balancing in manual order picking
inferredcites →https://doi.org/10.1016/j.cie.2020.106645openalex-extracted
A new iterative method for solving the joint dynamic storage location assignment, order batching and picker routing problem in manual picker-to-parts warehouses
inferredcites →https://doi.org/10.1016/j.cie.2021.107256openalex-extracted
Evaluation of routing policies using an interval-valued TOPSIS approach for the allocation rules
inferredcites →https://doi.org/10.1016/j.cie.2021.107517openalex-extracted
A heuristic approach for the online order batching problem with multiple pickers
inferredcites →https://doi.org/10.1016/j.cie.2021.107540openalex-extracted
A hybrid metaheuristic routing algorithm for low-level picker-to-part systems
inferredcites →https://doi.org/10.1016/j.cie.2022.108618openalex-extracted
A novel storage location assignment in multi-pickers picker-to-parts systems integrating scattered storage, demand correlation, and routing adjustment
inferredcites →https://doi.org/10.1016/j.cor.2018.03.012openalex-extracted
Picker routing in rectangular mixed shelves warehouses
inferredcites →https://doi.org/10.1016/j.cor.2018.07.002openalex-extracted
Exact algorithms for the order picking problem
inferredcites →https://doi.org/10.1016/j.ejor.2016.02.018openalex-extracted
A new mathematical programming formulation for the Single-Picker Routing Problem
inferredcites →https://doi.org/10.1016/j.ejor.2017.09.002openalex-extracted
Designing efficient order picking systems by combining planning problems: State-of-the-art classification and review
inferredcites →https://doi.org/10.1016/j.ejor.2017.11.017openalex-extracted
An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses
inferredcites →https://doi.org/10.1016/j.ejor.2017.11.063openalex-extracted
Solving the family traveling salesman problem
inferredcites →https://doi.org/10.1016/j.ejor.2018.11.037openalex-extracted
A discrete cross aisle design model for order-picking warehouses
inferredcites →https://doi.org/10.1016/j.ejor.2019.03.012openalex-extracted
Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
inferredcites →https://doi.org/10.1016/j.ejor.2022.01.006openalex-extracted
A deep learning approach for the selection of an order picking system
inferredcites →https://doi.org/10.1016/j.ejor.2023.02.019openalex-extracted
Order batching problems: Taxonomy and literature review
inferredcites →https://doi.org/10.1016/j.ejor.2023.07.022openalex-extracted
A comprehensive survey on the generalized traveling salesman problem
inferredcites →https://doi.org/10.1016/j.ejor.2024.01.013openalex-extracted
A new policy for scattered storage assignment to minimize picking travel distances
inferredcites →https://doi.org/10.1016/j.eswa.2018.03.043openalex-extracted
Bacterial Memetic Algorithms for Order Picking Routing Problem with Loading Constraints
inferredcites →https://doi.org/10.1016/j.ijpe.2014.09.029openalex-extracted
An efficient hybrid algorithm for integrated order batching, sequencing and routing problem
inferredcites →https://doi.org/10.1016/j.ijpe.2018.10.001openalex-extracted
Minimizing order picking makespan with multiple pickers in a wave picking warehouse
inferredcites →https://doi.org/10.1016/j.ijpe.2019.107564openalex-extracted
Order picker routing in warehouses: A systematic literature review
inferredcites →https://doi.org/10.1016/j.ijpe.2021.108069openalex-extracted
A method for efficiently routing order pickers in the leaf warehouse
inferredcites →https://doi.org/10.1016/j.ijpe.2022.108634openalex-extracted
Collaborative order picking with multiple pickers and robots: Integrated approach for order batching, sequencing and picker-robot routing
inferredcites →https://doi.org/10.1016/j.ins.2023.119913openalex-extracted
A memetic algorithm with fuzzy-based population control for the joint order batching and picker routing problem
inferredcites →https://doi.org/10.1016/j.knosys.2022.109290openalex-extracted
A discrete variant of cuckoo search algorithm to solve the Travelling Salesman Problem and path planning for autonomous trolley inside warehouse
inferredcites →https://doi.org/10.1016/j.tre.2020.101897openalex-extracted
Order batch picking optimization under different storage scenarios for e-commerce warehouses
inferredcites →https://doi.org/10.1016/j.tre.2020.102003openalex-extracted
Integrating storage location and order picking problems in warehouse planning
inferredcites →https://doi.org/10.1016/s0305-0548(03)00016-9openalex-extracted
Improved genetic algorithm for the permutation flowshop scheduling problem
inferredcites →https://doi.org/10.1080/00207540701441947openalex-extracted
Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
inferredcites →https://doi.org/10.1080/00207543.2015.1083624openalex-extracted
Impact of required storage space on storage policy performance in a unit-load warehouse
inferredcites →https://doi.org/10.1080/00207543.2016.1187313openalex-extracted
Joint optimisation of order batching and picker routing in the online retailer’s warehouse in China
inferredcites →https://doi.org/10.1080/00207543.2016.1206982openalex-extracted
Order picker routing with product returns and interaction delays
inferredcites →https://doi.org/10.1080/00207543.2016.1251625openalex-extracted
Order picking problems under weight, fragility and category constraints
inferredcites →https://doi.org/10.1080/00207543.2018.1473657openalex-extracted
Heuristic routing methods in multiple-block warehouses with ultra-narrow aisles and access restriction
inferredcites →https://doi.org/10.1080/00207543.2022.2053223openalex-extracted
Practical factors in order picking planning: state-of-the-art classification and review
inferredcites →https://doi.org/10.1080/00207543.2022.2079437openalex-extracted
In pursuit of humanised order picking planning: methodological review, literature classification and input from practice
inferredcites →https://doi.org/10.1080/01605682.2019.1700180openalex-extracted
High-density storage with mobile racks: Picker routing and product location
inferredcites →https://doi.org/10.1080/0951192x.2019.1667032openalex-extracted
Digital twin-driven joint optimisation of packing and storage assignment in large-scale automated high-rise warehouse product-service system
inferredcites →https://doi.org/10.1080/21693277.2023.2191115openalex-extracted
Trends in order picking: a 2007–2022 review of the literature
inferredcites →https://doi.org/10.1108/01439910810843298openalex-extracted
Metaheuristic scheduling of multiple picking agents for warehouse management
inferredcites →https://doi.org/10.1109/saci46893.2019.9111597openalex-extracted
Optimization of automatized picking process
inferredcites →https://doi.org/10.1111/itor.12001openalex-extracted
Metaheuristics—the metaphor exposed
inferredcites →https://doi.org/10.1111/itor.12026openalex-extracted
Randomized heuristics for the family traveling salesperson problem
inferredcites →https://doi.org/10.1155/2019/1280285openalex-extracted
An Integrated Metaheuristic Routing Method for Multiple‐Block Warehouses with Ultranarrow Aisles and Access Restriction
inferredcites →https://doi.org/10.3390/app122110921openalex-extracted
Two-Stage Metaheuristic Algorithms for Order-Batching and Routing Problems
inferredcites →https://doi.org/10.5267/j.ijiec.2018.8.001openalex-extracted
The storage location assignment problem: A literature review
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.