Mostrar el registro sencillo del ítem

dc.contributor.authorCano J.A
dc.contributor.authorCortés P
dc.contributor.authorMuñuzuri J
dc.contributor.authorCorrea-Espinal A.
dc.date.accessioned2022-09-14T14:34:08Z
dc.date.available2022-09-14T14:34:08Z
dc.date.created2022
dc.identifier.issn19366582
dc.identifier.urihttp://hdl.handle.net/11407/7573
dc.descriptionThis study aims to minimize the travel time in multi-block high-level storage systems considering height level constraints for picking devices to leave aisles. Considering these operating environments, the formulation of minimum travel times between each pair of storage positions is proposed and the picker routing problem (PRP) is solved by means of Genetic Algorithms (GA) and Ant Colony Optimization (ACO). A parameter tuning is performed for both metaheuristics, and the performance of the GA and ACO is compared with the optimal solution for small-sized problems demonstrating the reliability of the algorithms solving the PRP. Then, the performance of the GA and ACO is tested under several warehouse configurations and pick-list sizes obtaining that both metaheuristics provide high-quality solutions within short computing times. It is concluded that the GA outperforms the ACO in both efficiency and computing time, so it is recommended to implement the GA to solve the PRP in joint order picking problems. © 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.eng
dc.language.isoeng
dc.publisherSpringer
dc.relation.isversionofhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85124552023&doi=10.1007%2fs10696-022-09445-y&partnerID=40&md5=5117ef6127c42040aeaf4ad1670e399d
dc.sourceFlexible Services and Manufacturing Journal
dc.titleSolving the picker routing problem in multi-block high-level storage systems using metaheuristics
dc.typeArticle
dc.rights.accessrightsinfo:eu-repo/semantics/restrictedAccess
dc.publisher.programAdministración de Empresas
dc.type.spaArtículo
dc.identifier.doi10.1007/s10696-022-09445-y
dc.subject.keywordAnt colony optimizationeng
dc.subject.keywordGenetic algorithmseng
dc.subject.keywordHigh-level warehouseseng
dc.subject.keywordOrder pickingeng
dc.subject.keywordPicker routing problemeng
dc.subject.keywordWarehouse managementeng
dc.subject.keywordAnt colony optimizationeng
dc.subject.keywordArtificial intelligenceeng
dc.subject.keywordHeuristic algorithmseng
dc.subject.keywordRouting algorithmseng
dc.subject.keywordTravel timeeng
dc.subject.keywordWarehouseseng
dc.subject.keywordAnt colonieseng
dc.subject.keywordColony optimizationeng
dc.subject.keywordHigh-level warehouseeng
dc.subject.keywordMetaheuristiceng
dc.subject.keywordMultiblockseng
dc.subject.keywordOrder-pickingeng
dc.subject.keywordPicker routingeng
dc.subject.keywordPicker routing problemeng
dc.subject.keywordRouting problemseng
dc.subject.keywordWarehouse managementeng
dc.subject.keywordGenetic algorithmseng
dc.publisher.facultyFacultad de Ciencias Económicas y Administrativas
dc.affiliationCano, J.A., Universidad de Medellín, Carrera 87 # 30 - 65, Medellín, Colombia
dc.affiliationCortés, P., Universidad de Sevilla, Camino de los Descubrimientos s/n, Sevilla, 41092, Spain
dc.affiliationMuñuzuri, J., Universidad de Sevilla, Camino de los Descubrimientos s/n, Sevilla, 41092, Spain
dc.affiliationCorrea-Espinal, A., Universidad Nacional de Colombia, Carrera 80 # 65-223, Medellín, Colombia
dc.relation.referencesArdjmand, E., Shakeri, H., Singh, M., Sanei Bajgiran, O., Minimizing order picking makespan with multiple pickers in a wave picking warehouse (2018) Int J Prod Econ, 206, pp. 169-183
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 (2019) Appl Soft Comput J, 75, pp. 106-119
dc.relation.referencesAzadnia, A.H., Taheri, S., Ghadimi, P., 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.referencesBartholdi, J.J., Hackman, S.T., (2014) Warehouse and Distribution Science. the Supply Chain and Logistics Institute, , Michigan
dc.relation.referencesCano, J.A., Correa-Espinal, A., Gómez, R.A., Cortés, P., Distance and travel time modeling in high-level picker-to-part systems (2019) J Southwest Jiaotong Univ
dc.relation.referencesCano, J.A., Correa-Espinal, A.A., Gómez-Montoya, R.A., Cortés, P., Genetic algorithms for the picker routing problem in multi-block warehouses (2019) Lecture notes in business information processing, pp. 313-322. , Abramowicz W, Corchuelo R, (eds), Springer, Cham, Switzerland
dc.relation.referencesÇelik, M., Süral, H., Order picking in parallel-aisle warehouses with multiple blocks: complexity and a graph theory-based heuristic (2018) Int J Prod Res
dc.relation.referencesChabot, T., Coelho, L.C., Renaud, J., Côté, J.F., Mathematical model, heuristics and exact method for order picking in narrow aisles (2018) J Oper Res Soc, 69, pp. 1242-1253
dc.relation.referencesChen, F., Wang, H., Qi, C., Xie, Y., An ant colony optimization routing algorithm for two order pickers with congestion consideration (2013) Comput Ind Eng, 66, pp. 77-85
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.referencesChen, F., Wang, H., Xie, Y., Qi, C., An ACO-based online routing method for multiple order pickers with congestion consideration in warehouse (2016) J Intell Manuf, 27, pp. 389-408
dc.relation.referencesChen, F., Xu, G., Wei, Y., An integrated metaheuristic routing method for multiple-block warehouses with ultranarrow aisles and access restriction (2019) Complexity, 2019, pp. 1-14
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.referencesChirici, L., Wang, K.S., Tackling the storage problem through genetic algorithms (2014) Adv Manuf, 2, pp. 203-211
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 (2018) Adv Intell Syst Comput, 700, pp. 124-134
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.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 (2018) Eur J Oper Res, 267, pp. 120-137
dc.relation.referencesDorigo, M., Maniezzo, V., Colorni, A., Ant system: optimization by a colony of cooperating agents (1996) IEEE Trans Syst Man Cybern Part B Cybern, 26, pp. 29-41
dc.relation.referencesDorigo, M., Birattari, M., Stützle, T., Ant colony optimization: artificial ants as a computational intelligence technique (2006) IEEE Comput Intell Mag, 1, pp. 28-39
dc.relation.referencesEne, S., Öztürk, N., Storage location assignment and order picking optimization in the automotive industry (2012) Int J Adv Manuf Technol, 60, pp. 787-797
dc.relation.referencesFu, C., Wang, Y., Gu, Y., Routing optimization of high-level orderpickers in a rectangular warehouse (2011) In: 2011 International Conference on Consumer Electronics, Communications and Networks, Cecnet 2011 - Proceedings. Xianning, pp. 4388-4391
dc.relation.referencesGómez, 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] (2016) Inf Tecnol, 27, pp. 53-62
dc.relation.referencesGrosse, E.H., Glock, C.H., Neumann, W.P., Human factors in order picking: a content analysis of the literature (2017) Int J Prod Res, 55, pp. 1260-1276
dc.relation.referencesHenn, S., Algorithms for on-line order batching in an order picking warehouse (2012) Comput Oper Res, 39, pp. 2549-2563
dc.relation.referencesHsu, C.-M., Chen, K.-Y., Chen, M.-C., Batching orders in warehouses by minimizing travel distance with genetic algorithms (2005) Comput Ind, 56, pp. 169-178
dc.relation.referencesJiang, X., Zhou, Y., Zhang, Y., 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 (2018) Procedia Comput Sci, 126, pp. 1985-1993
dc.relation.referencesJin, H., Wang, W., Cai, M., Ant colony optimization model with characterization-based speed and multi-driver for the refilling system in hospital (2017) Adv Mech Eng, 9, pp. 1-18
dc.relation.referencesLee, J.A., Chang, Y.S., Shim, H.-J., Cho, S.-J., A Study on the Picking Process Time (2015) 6Th International Conference on Applied Human Factors and Ergonomics (AHFE 2015) and the Affiliated Conferences, AHFE, 2015, pp. 731-738. , Elsevier B.V., Las Vegas, United States
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.referencesMasae, M., Glock, C.H., Grosse, E.H., Order picker routing in warehouses: a systematic literature review (2020) Int J Prod Econ, 224
dc.relation.referencesMenéndez, B., Pardo, E.G., Sánchez-Oro, J., Duarte, A., Parallel variable neighborhood search for the min-max order batching problem (2017) Int Trans Oper Res, 24, pp. 635-662
dc.relation.referencesÖztürko, Ö., Discrete optimization a discrete cross aisle design model for order-picking warehouses (2019) Eur J Oper Res, 275, pp. 411-430
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.referencesPinto, A.R.F., Nagano, M.S., Genetic algorithms applied to integration and optimization of billing and picking processes (2019) J Intell Manuf
dc.relation.referencesRamaekers, K., Caris, A., Moons, S., Van, G.T., Using an integrated order picking-vehicle routing problem to study the impact of delivery time windows in e-commerce (2018) Eur Transp Res Rev, 10, pp. 1-11
dc.relation.referencesRoodbergen, K.J., De Koster, R., Routing methods for warehouses with multiple cross aisles (2001) Int J Prod Res, 39, pp. 1865-1883
dc.relation.referencesRoodbergen, K.J., Vis, I.F.A., A survey of literature on automated storage and retrieval systems (2009) Eur J Oper Res, 194, pp. 343-362
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.referencesSchrotenboer, A.H., Wruck, S., Roodbergen, K.J., Order picker routing with product returns and interaction delays (2017) Int J Prod Res, 55, pp. 6394-6406
dc.relation.referencesTheys, C., Bräysy, O., Dullaert, W., Raa, B., Using a TSP heuristic for routing order pickers in warehouses (2010) Eur J Oper Res, 200, pp. 755-763
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.referencesVan Gils, T., Ramaekers, K., Braekers, K., Increasing order picking efficiency by integrating storage, batching, zone picking, and routing policy decisions (2018) Int J Prod Econ, 197 (1), pp. 243-261
dc.relation.referencesVan Gils, T., Ramaekers, K., Caris, A., de Koster, R.B.M., Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review (2018) Eur J Oper Res, 267, pp. 1-15
dc.relation.referencesVan Gils, T., Caris, A., Ramaekers, K., Designing efficient order picking systems: the effect of real-life features on the relationship among planning problems (2019) Transp Res Part E, 125, pp. 47-73
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 (2019) Eur J Oper Res, 277, pp. 814-830
dc.relation.referencesWang, Y., Fu, C., Ma, M., Wang, L., Routing optimization of high-level order picking truck based on swarm intelligent algorithm (2012) Appl Mech Mater, 101-102, pp. 414-417
dc.relation.referencesWang, R., Zang, L., Tan, X., An optimal routing model of high-level picker-to-part system (2013) Lect Notes Electr Eng
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.referencesXu, W., Shi, C.Y., Song, H.T., Chen, Y.X., Applied technology on improving the order picking efficiency in the area of EC of china post logistics based on ACO (2014) Adv Mater Res, 859, pp. 486-491
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.relation.referencesZhang, R., Wang, M., Pan, X., New model of the storage location assignment problem considering demand correlation pattern (2019) Comput Ind Eng, 129, pp. 210-219
dc.relation.referencesZuniga, C.A., Olivares-Benitez, E., Tenahua, A.M., Mujica, M.A., A methodology to solve the order batching problem (2015) IFAC Proc, 48, pp. 1380-1386
dc.type.coarhttp://purl.org/coar/resource_type/c_6501
dc.type.versioninfo:eu-repo/semantics/publishedVersion
dc.type.driverinfo:eu-repo/semantics/article
dc.identifier.reponamereponame:Repositorio Institucional Universidad de Medellín
dc.identifier.repourlrepourl:https://repository.udem.edu.co/
dc.identifier.instnameinstname:Universidad de Medellín


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