Mostrar el registro sencillo del ítem

dc.creatorCano J.A.
dc.creatorCorrea-Espinal A.A.
dc.creatorGómez-Montoya R.A.
dc.date2020
dc.date.accessioned2021-02-05T14:58:22Z
dc.date.available2021-02-05T14:58:22Z
dc.identifier.issn10183639
dc.identifier.urihttp://hdl.handle.net/11407/5979
dc.descriptionThis article aims to introduce mathematical programming models for the joint order batching and picker routing problem (JOBPRP) and the joint order batching, sequencing and routing problem (JOBSPRP). For this purpose, we present formulations for the traveled distance and travel time between picking positions in low-level and high-level picker-to-part systems (2D and 3D warehouses) and single-block and multiple-block warehouses. Likewise, we formulate Steiner traveling salesman problem (STSP) models considering multiple pickers, heterogeneous picking vehicles, multiple objectives and due windows. We calculate the number of binary variables, continuous variables and constraints for the proposed models, in order to show the complexity of solving these order picking problems using exact solution methods. As a result, we introduce several mathematical models for manual order picking systems, which could serve as references for researchers interested in finding optimal or high-quality solutions to joint order picking problems, considering realistic warehouse and distribution center environments. © 2019 The Authors
dc.language.isoeng
dc.publisherKing Saud University
dc.relation.isversionofhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85061970038&doi=10.1016%2fj.jksues.2019.02.004&partnerID=40&md5=150c25394a0da7932196bb404586192f
dc.sourceJournal of King Saud University - Engineering Sciences
dc.subjectMathematical programming modelingspa
dc.subjectOrder batchingspa
dc.subjectOrder pickingspa
dc.subjectPicker routingspa
dc.subjectSequencingspa
dc.titleMathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems
dc.typeArticleeng
dc.rights.accessrightsinfo:eu-repo/semantics/restrictedAccess
dc.publisher.programAdministración de Empresasspa
dc.identifier.doi10.1016/j.jksues.2019.02.004
dc.subject.keywordMaterials handlingeng
dc.subject.keywordMathematical programmingeng
dc.subject.keywordTravel timeeng
dc.subject.keywordTraveling salesman problemeng
dc.subject.keywordMathematical programming modelseng
dc.subject.keywordOrder batchingeng
dc.subject.keywordOrder pickingeng
dc.subject.keywordPicker routingeng
dc.subject.keywordSequencingeng
dc.subject.keywordWarehouseseng
dc.relation.citationvolume32
dc.relation.citationissue3
dc.relation.citationstartpage219
dc.relation.citationendpage228
dc.publisher.facultyFacultad de Ciencias Económicas y Administrativasspa
dc.affiliationCano, J.A., Universidad de Medellín, Carrera 87 # 30-65, Medellín, Colombia
dc.affiliationCorrea-Espinal, A.A., Universidad Nacional de Colombia, Carrera 80 # 65-223, Medellín, Colombia
dc.affiliationGómez-Montoya, R.A., ESACS – Escuela Superior en Administración de Cadena de Suministro, Calle 4 # 18-55, Medellín, Colombia
dc.relation.referencesAzadnia, A.H., Taheri, S., Ghadimi, P., Mat Saman, M.Z., Wong, K.Y., Order batching in warehouses by minimizing total tardiness: A hybrid approach of weighted association rule mining and genetic algorithms (2013) Sci. World J., 2013, pp. 1-13
dc.relation.referencesCano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A., A review of research trends in order batching, sequencing and picker routing problems (2018) Espacios, 39, p. 3
dc.relation.referencesCano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A., An evaluation of picking routing policies to improve warehouse efficiency (2017) Int. J. Ind. Eng. Manag., 8, pp. 229-238
dc.relation.referencesCano, J.A., Gomez, R.A., Salazar, F., Routing policies in multi-parallel warehouses: an analysis of computing times (2017) Espacios, 38, p. 23
dc.relation.referencesCergibozan, Ç., Tasan, A.S., Order batching operations: an overview of classification, solution techniques, and future research (2016) J. Intell. Manuf., pp. 1-15
dc.relation.referencesChen, T.L., Cheng, C.Y., Chen, Y.Y., Chan, L.K., An efficient hybrid algorithm for integrated order batching, sequencing and routing problem (2015) Int. J. Prod. Econ., 159, pp. 158-167
dc.relation.referencesCheng, C.-Y., Chen, Y.-Y., Chen, T.-L., Yoo, J.J.-W., Using a hybrid approach based on the particle swarm optimization and ant colony optimization to solve a joint order batching and picker routing problem (2015) Int. J. Prod. Econ., 170, pp. 1-10
dc.relation.referencesDe Koster, R., Le-Duc, T., Roodbergen, K.J., Design and control of warehouse order picking: A literature review (2007) Eur. J. Oper. Res., 182, pp. 481-501
dc.relation.referencesGademann, N., van de Velde, S., Order batching to minimize total travel time in a parallel-aisle warehouse (2005) IIE Trans., 37, pp. 63-75
dc.relation.referencesGómez, R.A., Correa, A., Muñuzuri, J., Cortes, P., Análisis comparativo del problema de conformación de lotes con ruteo en la preparación de pedidos respecto al HVRP (Heterogeneous Vehicle Routing Problem) (2016) Dir. y Organ., 59, pp. 49-60
dc.relation.referencesHenn, S., Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses (2015) Flex. Serv. Manuf. J., 27, pp. 86-114
dc.relation.referencesHenn, S., Schmid, V., Metaheuristics for order batching and sequencing in manual order picking systems (2013) Comput. Ind. Eng., 66, pp. 338-351
dc.relation.referencesKoch, S., Wäscher, G., A grouping genetic algorithm for the order batching problem in distribution warehouses (2016) J. Bus. Econ., 86, pp. 131-153
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 (2012) Flex. Serv. Manuf. J., 24, pp. 52-80
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 (2017) Int. J. Prod. Res., 55, pp. 447-461
dc.relation.referencesLin, C.-C., Kang, J.-R., Hou, C.-C., Cheng, C.-Y., Joint order batching and picker Manhattan routing problem (2016) Comput. Ind. Eng., 95, pp. 164-174
dc.relation.referencesLu, W., McFarlane, D., Giannikas, V., Zhang, Q., An algorithm for dynamic order-picking in warehouse operations (2016) Eur. J. Oper. Res., 248, pp. 107-122
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 (2014) Eur. J. Oper. Res., 236, pp. 968-977
dc.relation.referencesMatusiak, M., de Koster, R., Saarinen, J., Utilizing individual picker skills to improve order batching in a warehouse (2017) Eur. J. Oper. Res., 263, pp. 888-899
dc.relation.referencesMuter, I., Öncan, T., An exact solution approach for the order batching problem (2015) IIE Trans., 47, pp. 728-738
dc.relation.referencesÖncan, T., MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem (2015) Eur. J. Oper. Res., 243, pp. 142-155
dc.relation.referencesÖncan, T., Caǧirici, M., MILP formulations for the order batching problem in low-level picker-to-part warehouse systems (2013) IFAC Proc., 46, pp. 471-476
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 (2014) Eur. J. Oper. Res., 237, pp. 1054-1066
dc.relation.referencesScholz, A., Henn, S., Stuhlmann, M., Wäscher, G., A new mathematical programming formulation for the single-picker routing problem (2016) Eur. J. Oper. Res., 253, pp. 68-84
dc.relation.referencesScholz, A., Schubert, D., Wäscher, G., Order picking with multiple pickers and due dates –Simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems (2017) Eur. J. Oper. Res., 263, pp. 461-478
dc.relation.referencesScholz, A., Wäscher, G., Order batching and picker routing in manual order picking systems: the benefits of integrated routing (2017) Cent. Eur. J. Oper. Res., 25, pp. 491-520
dc.relation.referencesTompkins, J.A., White, J.A., Bozer, Y.A., Tanchoco, J.M.A., Facilities Planning (2010), fourth ed. Wiley New Jersey
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 (2008) Int. J. Prod. Res., 46, pp. 6533-6555
dc.relation.referencesValle, C.A., Beasley, J.E., da Cunha, A.S., Optimally solving the joint order batching and picker routing problem (2017) Eur. J. Oper. Res., 262, pp. 817-834
dc.relation.referencesWon, J., Olafsson, S., Joint order batching and order picking in warehouse operations (2005) Int. J. Prod. Res., 43, pp. 1427-1442
dc.relation.referencesZhang, J., Wang, X., Huang, K., Integrated on-line scheduling of order batching and delivery under B2C e-commerce (2016) Comput. Ind. Eng., 94, pp. 280-289
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 (2017) Appl. Math. Model., 45, pp. 271-284
dc.type.versioninfo:eu-repo/semantics/publishedVersion
dc.type.driverinfo:eu-repo/semantics/article


Ficheros en el ítem

FicherosTamañoFormatoVer

No hay ficheros asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem