The pallet-loading vehicle routing problem with stability constraints

This paper addresses an integrated routing and loading problem in which the pallets ordered by a set of customers have to be delivered by a set of trucks so that the total distance traveled is minimized. The problem has two main distinctive features. On the one hand, when assigning pallets to trucks...

Descripción completa

Detalles Bibliográficos
Autores: Alonso Martínez, María Teresa, Martínez Sykora, Antonio, Álvarez Valdés, Ramón, Parreño Torres, Francisco
Tipo de recurso: artículo
Fecha de publicación:2022
País:España
Institución:Universidad de Castilla-La Mancha
Repositorio:RUIdeRA. Repositorio Institucional de la UCLM
OAI Identifier:oai:ruidera.uclm.es:10578/36346
Acceso en línea:https://hdl.handle.net/10578/36346
Access Level:acceso abierto
Palabra clave:Packing
CVRP
Pallet loading
Stability
Integer models
id ES_940bed2bc9e64ddb7fab17919c3d5b4e
oai_identifier_str oai:ruidera.uclm.es:10578/36346
network_acronym_str ES
network_name_str España
repository_id_str
spelling The pallet-loading vehicle routing problem with stability constraintsAlonso Martínez, María TeresaMartínez Sykora, AntonioÁlvarez Valdés, RamónParreño Torres, FranciscoPackingCVRPPallet loadingStabilityInteger modelsThis paper addresses an integrated routing and loading problem in which the pallets ordered by a set of customers have to be delivered by a set of trucks so that the total distance traveled is minimized. The problem has two main distinctive features. On the one hand, when assigning pallets to trucks, strict packing constraints, concerning axle weight, stability, and sequential loading, must be considered. On the other hand, split delivery is allowed. We have developed an integer linear model for the integrated problem, considering all routing and packing constraints. We have also designed a more efficient decomposition procedure in which some packing constraints are initially relaxed. Each time an integer solution is found in the search tree of the relaxed problem, it is checked to see whether it satisfies the remaining constraints and is therefore a feasible solution to the original problem. If it is not, a heuristic algorithm is first applied to rearrange the solution and, if it fails, an integer model is used, considering the packing problem for a single truck. If this also fails, a constraint is added to the relaxed problem to cut off the infeasible integer solution. An extensive computational study shows how the integer linear model and the decomposition procedure work on a set of instances varying the number of customers, the number of pallets, and their weight distribution.Elsevier202420242022info:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/10578/36346reponame:RUIdeRA. Repositorio Institucional de la UCLMinstname:Universidad de Castilla-La ManchaInglésRTI2018- 094940-B-100SB-PLY/17/180501/000282info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-nd/3.0/es/oai:ruidera.uclm.es:10578/363462026-05-27T07:36:41Z
dc.title.none.fl_str_mv The pallet-loading vehicle routing problem with stability constraints
title The pallet-loading vehicle routing problem with stability constraints
spellingShingle The pallet-loading vehicle routing problem with stability constraints
Alonso Martínez, María Teresa
Packing
CVRP
Pallet loading
Stability
Integer models
title_short The pallet-loading vehicle routing problem with stability constraints
title_full The pallet-loading vehicle routing problem with stability constraints
title_fullStr The pallet-loading vehicle routing problem with stability constraints
title_full_unstemmed The pallet-loading vehicle routing problem with stability constraints
title_sort The pallet-loading vehicle routing problem with stability constraints
dc.creator.none.fl_str_mv Alonso Martínez, María Teresa
Martínez Sykora, Antonio
Álvarez Valdés, Ramón
Parreño Torres, Francisco
author Alonso Martínez, María Teresa
author_facet Alonso Martínez, María Teresa
Martínez Sykora, Antonio
Álvarez Valdés, Ramón
Parreño Torres, Francisco
author_role author
author2 Martínez Sykora, Antonio
Álvarez Valdés, Ramón
Parreño Torres, Francisco
author2_role author
author
author
dc.subject.none.fl_str_mv Packing
CVRP
Pallet loading
Stability
Integer models
topic Packing
CVRP
Pallet loading
Stability
Integer models
description This paper addresses an integrated routing and loading problem in which the pallets ordered by a set of customers have to be delivered by a set of trucks so that the total distance traveled is minimized. The problem has two main distinctive features. On the one hand, when assigning pallets to trucks, strict packing constraints, concerning axle weight, stability, and sequential loading, must be considered. On the other hand, split delivery is allowed. We have developed an integer linear model for the integrated problem, considering all routing and packing constraints. We have also designed a more efficient decomposition procedure in which some packing constraints are initially relaxed. Each time an integer solution is found in the search tree of the relaxed problem, it is checked to see whether it satisfies the remaining constraints and is therefore a feasible solution to the original problem. If it is not, a heuristic algorithm is first applied to rearrange the solution and, if it fails, an integer model is used, considering the packing problem for a single truck. If this also fails, a constraint is added to the relaxed problem to cut off the infeasible integer solution. An extensive computational study shows how the integer linear model and the decomposition procedure work on a set of instances varying the number of customers, the number of pallets, and their weight distribution.
publishDate 2022
dc.date.none.fl_str_mv 2022
2024
2024
dc.type.none.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/10578/36346
url https://hdl.handle.net/10578/36346
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv RTI2018- 094940-B-100
SB-PLY/17/180501/000282
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:RUIdeRA. Repositorio Institucional de la UCLM
instname:Universidad de Castilla-La Mancha
instname_str Universidad de Castilla-La Mancha
reponame_str RUIdeRA. Repositorio Institucional de la UCLM
collection RUIdeRA. Repositorio Institucional de la UCLM
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869413647055323136
score 15.300719

Similares en LA Referencia