Principles and Fundamentals of the PRP: Time and Distance Matrices for Algorithms in the Picker Routing Problem

dc.contributor.affiliationCano J.A., Faculty of Economics and Administrative Sciences, University of Medellin, Carrera 87 # 30-65, Medellin, 050026, Colombia
dc.contributor.affiliationCampo E.A., Faculty of Economics and Administrative Sciences, University of Medellin, Carrera 87 # 30-65, Medellin, 050026, Colombia
dc.contributor.affiliationWeyers S., University of Applied Sciences and Arts, Fachhochschule Dortmund, Emil-Figge-Str. 44, Dortmund, 44227, Germany
dc.contributor.authorCano J.A.
dc.contributor.authorCampo E.A.
dc.contributor.authorWeyers S.
dc.date.accessioned2025-09-08T14:23:51Z
dc.date.available2025-09-08T14:23:51Z
dc.date.issued2024
dc.descriptionThis chapter presents the principles and fundamentals of the Picker Routing Problem (PRP) to improve the understanding of warehouse routing problems and solution algorithms. This study describes the main considerations for the PRP, formulation of distance and time matrices between storage positions for 2D and 3D warehouses, and solution approaches. The chapter describes the calculation of time and distance for warehouses considering horizontal and vertical movements through numerical examples. Three algorithms based on genetic algorithms, tabu search, and local search are proposed to solve the PRP, showing variable performance compared to the s-shape routing policy depending on the warehouse configuration and picking list size. The study concludes that distance and time matrices represent convenient tools for practitioners to generate the primary input for PRP solution methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.
dc.identifier.doi10.1007/978-3-031-50273-6_3
dc.identifier.instnameinstname:Universidad de Medellínspa
dc.identifier.isbn978-303150273-6
dc.identifier.isbn978-303150272-9
dc.identifier.reponamereponame:Repositorio Institucional Universidad de Medellínspa
dc.identifier.repourlrepourl:https://repository.udem.edu.co/
dc.identifier.urihttp://hdl.handle.net/11407/9114
dc.language.isoeng
dc.publisher.facultyFacultad de Ciencias Económicas y Administrativasspa
dc.publisher.programAdministración de Empresasspa
dc.relation.citationendpage72
dc.relation.citationstartpage31
dc.relation.isversionofhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-105004484574&doi=10.1007%2f978-3-031-50273-6_3&partnerID=40&md5=1d1432d483e9b51eeb706fa1c31f01d4
dc.relation.referencesAerts B., Cornelissens T., Sorensen K., The joint order batching and picker routing problem: Modelled and solved as a clustered vehicle routing problem, Computers and Operations Research, 129, (2021)
dc.relation.referencesAlipour M., Mehrjedrdi Y.Z., Mostafaeipour A., A rule-based heuristic algorithm for on-line order batching and scheduling in an order picking warehouse with multiple pickers, RAIRO—Operions Research, 54, pp. 101-117, (2020)
dc.relation.referencesAmir S., Rasmi B., Wang Y., Charkhgard H., Wave order picking under the mixed-shelves storage strategy: A solution method and advantages, Computers and Operations Research, 137, (2022)
dc.relation.referencesArdjmand E., Sanei O., Youssef E., Using list-based simulated annealing and genetic algorithm for order batching and picker routing in put wall based picking systems, Applied Soft Computing Journal, 75, pp. 106-119, (2019)
dc.relation.referencesArdjmand E., Singh M., Shakeri H., Tavasoli A., Young Ii W.A., Mitigating the risk of infection spread in manual order picking operations: A multi-objective approach, Applied Soft Computing, 100, (2021)
dc.relation.referencesArdjmand E., Youssef E.M., Moyer A., Li W.A.Y., Weckman G.R., Shakeri H., A multi-objective model for minimising makespan and total travel time in put wall-based picking systems, International Journal of Logistics Systems and Management, 36, pp. 138-176, (2020)
dc.relation.referencesAzadnia A.H., Taheri S., Ghadimi P., Saman M.Z.M., Wong K.Y., Order batching in warehouses by minimizing total tardiness: A hybrid approach of weighted association rule mining and genetic algorithms, Scientific World Journal, 2013, pp. 1-13, (2013)
dc.relation.referencesBahceci U., Oncan T., An evaluation of several combinations of routing and storage location assignment policies for the order batching problem, International Journal of Production Research, 60, pp. 5892-5911, (2022)
dc.relation.referencesBahrami B., Aghezzaf E.-H., Limere V., Using simulation to analyze picker blocking in manual order picking systems, Procedia Manufacturing, 11, pp. 1798-1808, (2017)
dc.relation.referencesBertini L., Krause K., Hanne T., Dornberger R., A comparison of nearest distance optimization and ant colony optimization for order picking in a multi-aisle warehouse, ACM International Conference Proceeding Series, pp. 1-6, (2021)
dc.relation.referencesBodis T., Botzheim J., Bacterial memetic algorithms for order picking routing problem with loading constraints, Expert Systems with Applications, 105, pp. 196-220, (2018)
dc.relation.referencesBottani E., Casella G., Murino T., A hybrid metaheuristic routing algorithm for low-level picker-to-part systems, Computers and Industrial Engineering, 160, (2021)
dc.relation.referencesBoysen N., de Koster R., Weidinger F., Warehousing in the e-commerce era: A survey, European Journal of Operational Research, 277, pp. 396-411, (2019)
dc.relation.referencesCano J.A., Correa-Espinal A., Gomez-Montoya R., Using genetic algorithms for order batching in multi-parallel-aisle picker-to-parts systems, International Journal of Applied Decision Sciences, 13, pp. 417-434, (2020)
dc.relation.referencesCano J.A., Correa-Espinal A., Gomez R.A., Cortes P., Distance and travel time modeling in high-level picker-to-part systems (3-D warehouses), Journal of Southwest Jiaotong University, (2019)
dc.relation.referencesCano J.A., Correa-Espinal A.A., Gomez-Montoya R.A., An evaluation of picking routing policies to improve warehouse efficiency, International Journal of Industrial Engineering and Management, 8, pp. 229-238, (2017)
dc.relation.referencesCano J.A., Correa-Espinal A.A., Gomez-Montoya R.A., Cortes P., Genetic algorithms for the picker routing problem in multi-block warehouses, Lecture Notes in Business Information Processing, pp. 313-322, (2019)
dc.relation.referencesCano J.A., Cortes P., Campo E.A., Correa-Espinal A.A., Multi-objective grouping genetic algorithm for the joint order batching, batch assignment, and sequencing problem, International Journal of Management Science and Engineering Management, 17, pp. 188-204, (2022)
dc.relation.referencesCano J.A., Cortes P., Munuzuri J., Correa-Espinal A., Solving the picker routing problem in multi-block high-level storage systems using metaheuristics, Flexible Services and Manufacturing Journal, (2022)
dc.relation.referencesCano J.A., Gomez R.A., Salazar F., Routing policies in multi-parallel warehouses: An analysis of computing times, Espacios, 38, (2017)
dc.relation.referencesCelik M., Sural H., Order picking in parallel-aisle warehouses with multiple blocks: Complexity and a graph theory-based heuristic, International Journal of Production Research, 57, pp. 888-906, (2019)
dc.relation.referencesChabot T., Coelho L.C., Renaud J., Cote J.F., Mathematical model, heuristics and exact method for order picking in narrow aisles, The Journal of the Operational Research Society, 69, pp. 1242-1253, (2018)
dc.relation.referencesChabot T., Lahyani R., Coelho L.C., Renaud J., Order picking problems under weight, fragility and category constraints, International Journal of Production Research, 55, pp. 6361-6379, (2017)
dc.relation.referencesCharkhgard H., Savelsberch M., Efficient algorithms for travelling salesman problems arising in warehouse order picking, ANZIAM Journal, 57, pp. 166-174, (2015)
dc.relation.referencesChen F., Wang H., Qi C., Xie Y., An ant colony optimization routing algorithm for two order pickers with congestion consideration, Computers and Industrial Engineering, 66, pp. 77-85, (2013)
dc.relation.referencesChen F., Wang H., Xie Y., Qi C., An ACO-based online routing method for multiple order pickers with congestion consideration in warehouse, Journal of Intelligent Manufacturing, 27, pp. 389-408, (2016)
dc.relation.referencesChen F., Wei Y., Wang H., A heuristic based batching and assigning method for online customer orders, Flexible Services and Manufacturing Journal, (2017)
dc.relation.referencesChen F., Xu G., Wei Y., Heuristic routing methods in multiple-block warehouses with ultra-narrow aisles and access restriction, International Journal of Production Research, 57, pp. 228-249, (2019)
dc.relation.referencesChen F., Xu G., Wei Y., An integrated metaheuristic routing method for multiple-block warehouses with ultranarrow aisles and access restriction, Complexity, 2019, pp. 1-14, (2019)
dc.relation.referencesChirici L., Wang K.S., Tackling the storage problem through genetic algorithms, Advanced Manufacturing, 2, pp. 203-211, (2014)
dc.relation.referencesCortes P., Gomez-Montoya R.A., Munuzuri J., Correa-Espinal A., 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, Applied Soft Computing, 53, pp. 61-73, (2017)
dc.relation.referencesDamayanti D.D., Setyawan E.B., Andrawina L., Santosa B., Warehouse picking model for single picker routing problem in multi dimensional warehouse layout using genetic algorithm approach to minimize delay, Advances in Intelligent Systems and Computing, 700, pp. 124-134, (2018)
dc.relation.referencesDaron M., Simulations in planning logistics processes as a tool of decision-making in manufacturing companies, Production Engineering Archives, 28, pp. 300-308, (2022)
dc.relation.referencesDauod H., Won D., Real-time order picking planning framework for warehouses and distribution centres, International Journal of Production Research, 60, pp. 5468-5487, (2022)
dc.relation.referencesde Koster R., Le-Duc T., Roodbergen K.J., Design and control of warehouse order picking: A literature review, European Journal of Operational Research, 182, pp. 481-501, (2007)
dc.relation.referencesde Santis R., Montanari R., Vignali G., Bottani E., An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses, European Journal of Operational Research, 267, pp. 120-137, (2018)
dc.relation.referencesDiefenbach H., Emde S., Glock C.H., Grosse E.H., New Solution Procedures for the Order Picker Routing Problem in U-Shaped Pick Areas with a Movable Depot, (2022)
dc.relation.referencesDukic G., Oluic C., Order-picking methods: Improving order-picking efficiency, Inter-National Journal of Logistics Systems and Management, 3, pp. 451-460, (2007)
dc.relation.referencesDunke F., Nickel S., Evaluating the quality of online optimization algorithms by discrete event simulation, Central European Journal of Operational Research, 25, pp. 831-858, (2017)
dc.relation.referencesDuzgit Z., Toy A.O., Saner A.C., Performance comparison of meta-heuristics for the multiblock warehouse order picking problem, International Journal of Industrial Engineering, 28, pp. 75-91, (2022)
dc.relation.referencesEne S., Kucukoglu I., Aksoy A., Ozturk N., A genetic algorithm for minimizing energy consumption in warehouses, Energy, 114, pp. 973-980, (2016)
dc.relation.referencesEne S., Ozturk N., Storage location assignment and order picking optimization in the automotive industry, International Journal of Advanced Manufacturing Technology, 60, pp. 787-797, (2012)
dc.relation.referencesFeng M., Po Y., Shih H., Li M.-C., The optimal layout design for minimizing operating costs in a picker-to-part warehousing system, International Journal of Advanced Manufacturing Technology, 118, pp. 2523-2537, (2022)
dc.relation.referencesFu C., Wang Y., Gu Y., Ma M., Xue T., Routing optimization of high-level order-pickers in a rectangular warehouse, 2011 International Conference on Consumer Electronics, Communications and Networks (Cecnet), pp. 4388-4391, (2011)
dc.relation.referencesGoetschalckx M., Ratliff D.H., Order picking in an aisle, IIE Transactions, 20, pp. 53-62, (1988)
dc.relation.referencesGomez R.A., Giraldo O.G., Campo E.A., Minimum time order batching in the put away operation considering k homogeneous equipment using metaheuristics [Conformación de Lotes Mínimo Tiempo en la Operación de Acomodo Considerando k Equipos Homogéneos usando Metaheurísticos], Information Tecnology, 27, pp. 53-62, (2016)
dc.relation.referencesGrosse E.H., Glock C.H., The effect of worker learning on manual order picking processes, International Journal of Production Economics, 170, pp. 882-890, (2015)
dc.relation.referencesGrosse E.H., Glock C.H., Neumann W.P., Human factors in order picking: A content analysis of the literature, International Journal of Production Research, 55, pp. 1260-1276, (2017)
dc.relation.referencesGuo L., Yang X., Route optimization model for order picking of distribution center, Proceedings of the 2Nd International Conference on Artificial Intelligence and Advanced Manufacture, pp. 168-172, (2020)
dc.relation.referencesHenn S., Koch S., Wascher G., Order batching in order picking warehouses: A survey of solution approaches, Warehousing in the Global Supply Chain: Advanced Models, Tools and Applications for Storage Systems, pp. 105-137, (2012)
dc.relation.referencesHong S., Johnson A.L., Peters B.A., Batch picking in narrow-aisle order picking systems with consideration for picker blocking, European Journal of Operational Research, 221, pp. 557-570, (2012)
dc.relation.referencesHossein F., Shavaki N., Jolai F., A rule-based heuristic algorithm for joint order batching and delivery planning of online retailers with multiple order pickers, Applied Intelligence, 51, pp. 3917-3935, (2021)
dc.relation.referencesHsu C.-M., Chen K.-Y., Chen M.-C., Batching orders in warehouses by minimizing travel distance with genetic algorithms, Computers in Industry, 56, pp. 169-178, (2005)
dc.relation.referencesJiang X., Zhou Y., Zhang Y., Sun L., Hu X., Order batching and sequencing problem under the pick-and-sort Order batching and sequencing problem under the pick-and-sort strategy in online supermarkets strategy in online supermarkets, Procedia Computer Science, 126, pp. 1985-1993, (2018)
dc.relation.referencesKhoei A.A., Sural H., Tural M.K., Energy minimizing order picker forklift routing problem, European Journal of Operational Research, 307, pp. 604-626, (2022)
dc.relation.referencesKoch S., Wascher G., A Grouping genetic algorithm for the order batching problem in distribution warehouses, Journal of Business Economics, 86, pp. 131-153, (2016)
dc.relation.referencesKubler P., Glock C.H., Bauernhansl T., A new iterative method for solving the joint dynamic storage location assignment, order batching and picker routing problem in manual picker-to-parts warehouses, Computers and Industrial Engineering, 147, (2020)
dc.relation.referencesKulak O., Sahin Y., Taner M.E., Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms, Flexible Services and Manufacturing Journal, 24, pp. 52-80, (2012)
dc.relation.referencesLee J.A., Chang Y.S., Shim H.-J., Cho S.-J., A study on the picking process time, 6Th International Conference on Applied Human Factors and Ergonomics (AHFE 2015) and the Affiliated Conferences, pp. 731-738, (2015)
dc.relation.referencesLi J., Huang R., Dai J.B., Joint optimisation of order batching and picker routing in the online retailer’s warehouse in China, International Journal of Production Research, 55, pp. 447-461, (2017)
dc.relation.referencesLin C.-C., Kang J.-R., Hou C.-C., Cheng C.-Y., Joint order batching and picker Manhattan routing problem, Computers and Industrial Engineering, 95, pp. 164-174, (2016)
dc.relation.referencesLiu J., Lei Z., Nie W., Tu H., An Optimization Method of Picking Routes for Warehouses with Fishbone Layout, Zhongguo Jixie Gongcheng, 31, pp. 1225-1232, (2020)
dc.relation.referencesMadani A., Batta R., Karwan M., The balancing traveling salesman problem: Application to warehouse order picking, TOP, 29, pp. 442-469, (2021)
dc.relation.referencesMasae M., Glock C.H., Grosse E.H., Order picker routing in warehouses: A systematic literature review, International Journal of Production Economics, 224, (2020)
dc.relation.referencesMasae M., Glock C.H., Vichitkunakorn P., Optimal order picker routing in a conventional warehouse with two blocks and arbitrary starting and ending points of a tour, International Journal of Production Research, 50, pp. 5337-5358, (2020)
dc.relation.referencesMasae M., Glock C.H., Vichitkunakorn P., A method for efficiently routing order pickers in the leaf warehouse, International Journal of Production Economics, 234, (2021)
dc.relation.referencesMatusiak M., de Koster R., Kroon L., Saarinen J., A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse, European Journal of Operational Research, 236, pp. 968-977, (2014)
dc.relation.referencesMatusiak M., de Koster R., Saarinen J., Utilizing individual picker skills to improve order batching in a warehouse, European Journal of Operational Research, 263, pp. 888-899, (2017)
dc.relation.referencesMoons S., Ramaekers K., Caris A., Arda Y., Integration of order picking and vehicle routing in a B2C e-commerce context, Flexible Services and Manufacturing Journal, (2017)
dc.relation.referencesOzden S.G., Smith A.E., Gue K.R., A computational software system to design order picking warehouses, Computers and Operations Research, 132, (2021)
dc.relation.referencesOzden S.G., Smith A.E., Gue K.R., A novel approach for modeling order picking paths, Naval Research Logistics, 68, pp. 471-484, (2020)
dc.relation.referencesOzturko O., Discrete Optimization A discrete cross aisle design model for order-picking warehouses, European Journal of Operational Research, 275, pp. 411-430, (2019)
dc.relation.referencesPan J.C.-H., Shih P.-H., Wu M., Order batching in a pick-and-pass warehousing system with group genetic algorithm, Omega, 57, pp. 238-248, (2015)
dc.relation.referencesPan J.C.-H., Wu M.-H., Chang W.-L., A travel time estimation model for a high-level picker-to-part system with class-based storage policies, European Journal of Operational Research, 237, pp. 1054-1066, (2014)
dc.relation.referencesPetersen C.G., An evaluation of order picking routeing policies, International Journal of Operations & Production Management, 17, pp. 1098-1111, (1997)
dc.relation.referencesPferschy U., Schauer J., Order batching and routing in a non-standard warehouse, Electron Notes Discret Math, 69, pp. 125-132, (2018)
dc.relation.referencesPinto A.R.F., Nagano M.S., Genetic algorithms applied to integration and optimization of billing and picking processes, Journal of Intelligent Manufacturing, (2019)
dc.relation.referencesRojanapitoon T., Economic order picker routing considering travel time and vehicular energy consumption with varying aisle traffic, International Journal of Intelligent Engineering and Systems, 13, pp. 317-328, (2020)
dc.relation.referencesRoodbergen K.J., de Koster R., Routing methods for warehouses with multiple cross aisles, International Journal of Production Research, 39, pp. 1865-1883, (2001)
dc.relation.referencesScholz A., Henn S., Stuhlmann M., Wascher G., A new mathematical programming formulation for the Single-Picker Routing Problem, European Journal of Operational Research, 253, pp. 68-84, (2016)
dc.relation.referencesScholz A., Schubert D., Wascher G., Order picking with multiple pickers and due dates—Simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems, European Journal of Operational Research, 263, pp. 461-478, (2017)
dc.relation.referencesScholz A., Wascher G., Order Batching and Picker Routing in manual order picking systems: The benefits of integrated routing, Central European Journal of Operations Research, 25, pp. 491-520, (2017)
dc.relation.referencesSchrotenboer A.H., Wruck S., Roodbergen K.J., Veenstra M., Dijikstra A.S., Order picker routing with product returns and interaction delays, International Journal of Production Research, 55, pp. 6394-6406, (2017)
dc.relation.referencesShetty N., Sah B., Hoon S., Route optimization for warehouse order picking operations via vehicle routing and simulation, SN Applied Science, 2, pp. 1-18, (2020)
dc.relation.referencesSu Y., Li M., Zhu X., Li C., Steiner TSP based on aisle as a unit for order picking, Computers and Industrial Engineering, 168, (2022)
dc.relation.referencesSu Y., Zhu X., Yuan J., Lay K., Li M., Li C., An extensible multi-block layout warehouse routing optimization model, European Journal of Operational Research, 305, pp. 222-239, (2023)
dc.relation.referencesTheys C., Braysy O., Dullaert W., Raa B., Using a TSP heuristic for routing order pickers in warehouses, European Journal of Operational Research, 200, pp. 755-763, (2010)
dc.relation.referencesTsai C.-Y., Liou J.J.H., Huang T.-M., Using a multiple-GA method to solve the batch picking problem: Considering travel distance and order due time, International Journal of Production Research, 46, pp. 6533-6555, (2008)
dc.relation.referencesValle C.A., Beasley J.E., da Cunha A.S., Optimally solving the joint order batching and picker routing problem, European Journal of Operational Research, 262, pp. 817-834, (2017)
dc.relation.referencesValle C.A., Beasley J.E., Salles da Cunha A., Modelling and solving the joint order batching and picker routing problem in inventories, International Symposium on Combinatorial Optimization, pp. 81-97, (2016)
dc.relation.referencesvan Gils T., Caris A., Ramaekers K., Braekers K., Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse, European Journal of Operational Research, 277, pp. 814-830, (2019)
dc.relation.referencesvan Gils T., Ramaekers K., Braekers K., Depaire B., Caris K., Increasing order picking efficiency by integrating storage, batching, zone picking, and routing policy decisions, Inter-National Journal of Production Economics, 197, pp. 243-261, (2018)
dc.relation.referencesVanheusden S., van Gils T., Ramaekers K., Cornelissens T., Caris A., Practical factors in order picking planning: State-of-the-art classification and review, International Journal of Production Research, (2023)
dc.relation.referencesWagner S., Monch L., A Variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices, European Journal of Operational Research, (2022)
dc.relation.referencesWan Y., Liu Y., Integrating optimized fishbone warehouse layout, storage location assignment and picker routing, IAENG International Journal of Computer Science, 49, (2022)
dc.relation.referencesWang R., Zang L., Tan X., An optimal routing model of high-level picker-to-part system, Lect Notes Electrical Engineering 185 LNEE, pp. 371-383, (2013)
dc.relation.referencesWang Y., Fu C., Ma M., Wang L., Routing optimization of high-level order picking truck based on swarm intelligent algorithm, Applied Mechanics and Materials, 101-102, pp. 414-417, (2012)
dc.relation.referencesWeidinger F., Picker routing in rectangular mixed shelves warehouses, Computers and Operations Research, 95, pp. 139-150, (2018)
dc.relation.referencesWon J., Olafsson S., Joint order batching and order picking in warehouse operations, International Journal of Production Research, 43, pp. 1427-1442, (2005)
dc.relation.referencesZhang J., Wang X., Chan F.T.S., Ruan J., On-line order batching and sequencing problem with multiple pickers: A hybrid rule-based algorithm, Applied Mathematical Modelling, 45, pp. 271-284, (2017)
dc.relation.referencesZhang J., Zhang Y., Zhang X., The study of joint order batching and picker routing problem with food and nonfood category constraint in online-to-offline grocery store, Inter-National Transactions in Operational Research, 28, pp. 2440-2463, (2021)
dc.relation.referencesZhang R., Wang M., Pan X., New model of the storage location assignment problem considering demand correlation pattern, Computers and Industrial Engineering, 129, pp. 210-219, (2019)
dc.relation.referencesZhou L., Fan X., Wang J., Wang S., Cao N., Wu M., A random classified-storage picking path model for V-type storage layout, Complexity, 2020, (2020)
dc.relation.referencesZhou L., Liu H., Zhao J., Wang F., Yang J., Performance analysis of picking routing strategies in the leaf layout warehouse, Mathematics, 10, (2022)
dc.relation.referencesZhou L., Zhao J., Liu H., Wang F., Yang J., Wang S., Stochastic models of routing strategies under the class-based storage policy in fishbone layout warehouses, Scientific Reports, 12, pp. 1-17, (2022)
dc.relation.referencesZhu S., Zhuang Y., Hu X., Shi L., Two-stage Intelligent heuristic heuristic order batching algorithm in multiple-block ultra-narrow-aisle picking systems, Procedia Computer Science, 192, pp. 1964-1972, (2021)
dc.relation.referencesZuniga C.A., Olivares-Benitez E., Tenahua A.M., Mujica M.A., A methodology to solve the order batching problem, IFAC Proceedings, 48, pp. 1380-1386, (2015)
dc.rights.accesoRestricted access
dc.rights.accessrightsinfo:eu-repo/semantics/restrictedAccess
dc.sourceWarehousing and Material Handling Systems for the Digital Industry: The New Challenges for the Digital Circular Economy
dc.sourceWarehous. and Material Handling Systems for the Digital Industry: The New Challenges for the Digital Circular Economy
dc.sourceScopus
dc.subjectDistance matrix
dc.subjectGenetic algorithms
dc.subjectOrder picking systems
dc.subjectPicker routing problem
dc.subjectPicker-to-part systems
dc.subjectTime matrix
dc.subjectTabu search
dc.subjectDistance matrix
dc.subjectOrder-picking systems
dc.subjectPicker routing
dc.subjectPicker routing problem
dc.subjectPicker-to-part system
dc.subjectProblem algorithms
dc.subjectProblems and Solutions
dc.subjectRouting problems
dc.subjectSolution algorithms
dc.subjectTime matrix
dc.subjectGenetic algorithms
dc.titlePrinciples and Fundamentals of the PRP: Time and Distance Matrices for Algorithms in the Picker Routing Problem
dc.typeBook chapter
dc.type.localParte de librospa
dc.type.versioninfo:eu-repo/semantics/publishedVersion

Archivos

Colecciones