A Simulated Annealing Approach for the Joint Order Batching and Order Picker Routing Problem with Weight Restrictions
This paper studies the joint order batching and order picker routing problem in conventional multi parallel-aisle picker-to-part order picking systems. It complements prior publications by considering capacity constraint that is formulated as a function of total item weight, instead of item count. A...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2014 |
| País: | España |
| Institución: | IE |
| Repositorio: | Repositorio IE |
| OAI Identifier: | oai:repositorio.ie.edu:20.500.14417/4016 |
| Acceso en línea: | https://hdl.handle.net/20.500.14417/4016 |
| Access Level: | acceso abierto |
| Palabra clave: | 53 Ciencias Económicas::5311 Organización y dirección de empresas ::5311.03 Estudios industriales ODS 9 - Industria, innovación e infraestructura ODS 12 - Producción y consumo responsables Order Picking Order Batching Warehouse Simulated Annealing Picker-to-Part System |
| id |
ES_9da70838f0306d5b030e8d47cb2affd6 |
|---|---|
| oai_identifier_str |
oai:repositorio.ie.edu:20.500.14417/4016 |
| network_acronym_str |
ES |
| network_name_str |
España |
| repository_id_str |
|
| spelling |
A Simulated Annealing Approach for the Joint Order Batching and Order Picker Routing Problem with Weight RestrictionsGrosse, EricGlock, ChristophBallester Ripoll, Rafael53 Ciencias Económicas::5311 Organización y dirección de empresas ::5311.03 Estudios industrialesODS 9 - Industria, innovación e infraestructuraODS 12 - Producción y consumo responsablesOrder PickingOrder BatchingWarehouseSimulated AnnealingPicker-to-Part SystemThis paper studies the joint order batching and order picker routing problem in conventional multi parallel-aisle picker-to-part order picking systems. It complements prior publications by considering capacity constraint that is formulated as a function of total item weight, instead of item count. A mathematical model is formulated and a simulated annealing algorithm is developed to batch orders and to determine pick tours. The intention of the paper is to provide a more realistic model and to improve classical batching and routing heuristics. It thereby pays special attention to the practical applicability of the model. The proposed methods are compared and evaluated in an extensive numerical study, and it is shown that the developed approach leads to an improved solution for the joint order batching and order picker routing problem, as compared to classical heuristics for this problem.YesPublishedIJOQMhttps://ror.org/02jjdwm7520252014info:eu-repo/semantics/articleapplication/pdfapplication/pdfhttps://hdl.handle.net/20.500.14417/4016reponame:Repositorio IEinstname:IEInglésIE School of Science & TechnologyIE UniversityApplied MathematicsAttribution-NonCommercial 4.0 Internationalhttp://creativecommons.org/licenses/by-nc/4.0/info:eu-repo/semantics/openAccessoai:repositorio.ie.edu:20.500.14417/40162026-06-15T12:40:57Z |
| dc.title.none.fl_str_mv |
A Simulated Annealing Approach for the Joint Order Batching and Order Picker Routing Problem with Weight Restrictions |
| title |
A Simulated Annealing Approach for the Joint Order Batching and Order Picker Routing Problem with Weight Restrictions |
| spellingShingle |
A Simulated Annealing Approach for the Joint Order Batching and Order Picker Routing Problem with Weight Restrictions Grosse, Eric 53 Ciencias Económicas::5311 Organización y dirección de empresas ::5311.03 Estudios industriales ODS 9 - Industria, innovación e infraestructura ODS 12 - Producción y consumo responsables Order Picking Order Batching Warehouse Simulated Annealing Picker-to-Part System |
| title_short |
A Simulated Annealing Approach for the Joint Order Batching and Order Picker Routing Problem with Weight Restrictions |
| title_full |
A Simulated Annealing Approach for the Joint Order Batching and Order Picker Routing Problem with Weight Restrictions |
| title_fullStr |
A Simulated Annealing Approach for the Joint Order Batching and Order Picker Routing Problem with Weight Restrictions |
| title_full_unstemmed |
A Simulated Annealing Approach for the Joint Order Batching and Order Picker Routing Problem with Weight Restrictions |
| title_sort |
A Simulated Annealing Approach for the Joint Order Batching and Order Picker Routing Problem with Weight Restrictions |
| dc.creator.none.fl_str_mv |
Grosse, Eric Glock, Christoph Ballester Ripoll, Rafael |
| author |
Grosse, Eric |
| author_facet |
Grosse, Eric Glock, Christoph Ballester Ripoll, Rafael |
| author_role |
author |
| author2 |
Glock, Christoph Ballester Ripoll, Rafael |
| author2_role |
author author |
| dc.contributor.none.fl_str_mv |
https://ror.org/02jjdwm75 |
| dc.subject.none.fl_str_mv |
53 Ciencias Económicas::5311 Organización y dirección de empresas ::5311.03 Estudios industriales ODS 9 - Industria, innovación e infraestructura ODS 12 - Producción y consumo responsables Order Picking Order Batching Warehouse Simulated Annealing Picker-to-Part System |
| topic |
53 Ciencias Económicas::5311 Organización y dirección de empresas ::5311.03 Estudios industriales ODS 9 - Industria, innovación e infraestructura ODS 12 - Producción y consumo responsables Order Picking Order Batching Warehouse Simulated Annealing Picker-to-Part System |
| description |
This paper studies the joint order batching and order picker routing problem in conventional multi parallel-aisle picker-to-part order picking systems. It complements prior publications by considering capacity constraint that is formulated as a function of total item weight, instead of item count. A mathematical model is formulated and a simulated annealing algorithm is developed to batch orders and to determine pick tours. The intention of the paper is to provide a more realistic model and to improve classical batching and routing heuristics. It thereby pays special attention to the practical applicability of the model. The proposed methods are compared and evaluated in an extensive numerical study, and it is shown that the developed approach leads to an improved solution for the joint order batching and order picker routing problem, as compared to classical heuristics for this problem. |
| publishDate |
2014 |
| dc.date.none.fl_str_mv |
2014 2025 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/article |
| format |
article |
| dc.identifier.none.fl_str_mv |
https://hdl.handle.net/20.500.14417/4016 |
| url |
https://hdl.handle.net/20.500.14417/4016 |
| dc.language.none.fl_str_mv |
Inglés |
| language_invalid_str_mv |
Inglés |
| dc.relation.none.fl_str_mv |
IE School of Science & Technology IE University Applied Mathematics |
| dc.rights.none.fl_str_mv |
Attribution-NonCommercial 4.0 International http://creativecommons.org/licenses/by-nc/4.0/ info:eu-repo/semantics/openAccess |
| rights_invalid_str_mv |
Attribution-NonCommercial 4.0 International http://creativecommons.org/licenses/by-nc/4.0/ |
| eu_rights_str_mv |
openAccess |
| dc.format.none.fl_str_mv |
application/pdf application/pdf |
| dc.publisher.none.fl_str_mv |
IJOQM |
| publisher.none.fl_str_mv |
IJOQM |
| dc.source.none.fl_str_mv |
reponame:Repositorio IE instname:IE |
| instname_str |
IE |
| reponame_str |
Repositorio IE |
| collection |
Repositorio IE |
| repository.name.fl_str_mv |
|
| repository.mail.fl_str_mv |
|
| _version_ |
1869414761068756992 |
| score |
15,811543 |