A Branch-and-price Method for the Vehicle Routing problem with Cross-docking and Time Windows

Autores
Dondo, Rodolfo Gabriel
Año de publicación
2013
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
One important factor in supply chain management is to efficiently control the supply chain flows. Due to its importance, many companies are trying to develop efficient methods to increase customer satisfaction and reduce costs. Cross-docking is considered a good method to reduce inventory and improve responsiveness. The Vehicle Routing Problem with Cross-Docking and Time Windows (VRP-CD-TW) consists on designing the minimum-cost set of routes to serve a given set of transportation requests while respecting constraints on vehicles capacity, customer time windows and using transfers on a cross-docking base. Each customer must be visited just once and mixed tours comprising pick-up and delivery stops are not allowed. For a given vehicle, the designed pick-up tour must precede its delivery tour. In this work, we model the VRP-CD-TW assuming that all feasible orders are known in advance. We present a new mixed integer program to model the VRP-CD-TW and reformulate it via Dantzig-Wolfe decomposition to later develop a column generation procedure. The proposed branch-and-price algorithm shows encouraging results on solving some Solomon-based instances.
Fil: Dondo, Rodolfo Gabriel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química (i); Argentina
Materia
Supply-chain management
Cross-docking
Vehicle routing
Columns generation.
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/8606
Acceder
id CONICETDig_0c389f4c47fb39f4970aaa7590bca441
oai_identifier_str oai:ri.conicet.gov.ar:11336/8606
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling A Branch-and-price Method for the Vehicle Routing problem with Cross-docking and Time WindowsDondo, Rodolfo GabrielSupply-chain managementCross-dockingVehicle routingColumns generation.https://purl.org/becyt/ford/2.4https://purl.org/becyt/ford/2One important factor in supply chain management is to efficiently control the supply chain flows. Due to its importance, many companies are trying to develop efficient methods to increase customer satisfaction and reduce costs. Cross-docking is considered a good method to reduce inventory and improve responsiveness. The Vehicle Routing Problem with Cross-Docking and Time Windows (VRP-CD-TW) consists on designing the minimum-cost set of routes to serve a given set of transportation requests while respecting constraints on vehicles capacity, customer time windows and using transfers on a cross-docking base. Each customer must be visited just once and mixed tours comprising pick-up and delivery stops are not allowed. For a given vehicle, the designed pick-up tour must precede its delivery tour. In this work, we model the VRP-CD-TW assuming that all feasible orders are known in advance. We present a new mixed integer program to model the VRP-CD-TW and reformulate it via Dantzig-Wolfe decomposition to later develop a column generation procedure. The proposed branch-and-price algorithm shows encouraging results on solving some Solomon-based instances.Fil: Dondo, Rodolfo Gabriel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química (i); ArgentinaUniversidade Federal de Santa Catarina2013-10info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/8606Dondo, Rodolfo Gabriel; A Branch-and-price Method for the Vehicle Routing problem with Cross-docking and Time Windows; Universidade Federal de Santa Catarina; Iberoamerican Journal of Industrial Engineering; 5; 10; 10-2013; 16-252175-8018enginfo:eu-repo/semantics/altIdentifier/url/http://incubadora.periodicos.ufsc.br/index.php/IJIE/article/view/3057info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T09:41:46Zoai:ri.conicet.gov.ar:11336/8606instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-29 09:41:46.566CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv A Branch-and-price Method for the Vehicle Routing problem with Cross-docking and Time Windows
title A Branch-and-price Method for the Vehicle Routing problem with Cross-docking and Time Windows
spellingShingle A Branch-and-price Method for the Vehicle Routing problem with Cross-docking and Time Windows
Dondo, Rodolfo Gabriel
Supply-chain management
Cross-docking
Vehicle routing
Columns generation.
title_short A Branch-and-price Method for the Vehicle Routing problem with Cross-docking and Time Windows
title_full A Branch-and-price Method for the Vehicle Routing problem with Cross-docking and Time Windows
title_fullStr A Branch-and-price Method for the Vehicle Routing problem with Cross-docking and Time Windows
title_full_unstemmed A Branch-and-price Method for the Vehicle Routing problem with Cross-docking and Time Windows
title_sort A Branch-and-price Method for the Vehicle Routing problem with Cross-docking and Time Windows
dc.creator.none.fl_str_mv Dondo, Rodolfo Gabriel
author Dondo, Rodolfo Gabriel
author_facet Dondo, Rodolfo Gabriel
author_role author
dc.subject.none.fl_str_mv Supply-chain management
Cross-docking
Vehicle routing
Columns generation.
topic Supply-chain management
Cross-docking
Vehicle routing
Columns generation.
purl_subject.fl_str_mv https://purl.org/becyt/ford/2.4
https://purl.org/becyt/ford/2
dc.description.none.fl_txt_mv One important factor in supply chain management is to efficiently control the supply chain flows. Due to its importance, many companies are trying to develop efficient methods to increase customer satisfaction and reduce costs. Cross-docking is considered a good method to reduce inventory and improve responsiveness. The Vehicle Routing Problem with Cross-Docking and Time Windows (VRP-CD-TW) consists on designing the minimum-cost set of routes to serve a given set of transportation requests while respecting constraints on vehicles capacity, customer time windows and using transfers on a cross-docking base. Each customer must be visited just once and mixed tours comprising pick-up and delivery stops are not allowed. For a given vehicle, the designed pick-up tour must precede its delivery tour. In this work, we model the VRP-CD-TW assuming that all feasible orders are known in advance. We present a new mixed integer program to model the VRP-CD-TW and reformulate it via Dantzig-Wolfe decomposition to later develop a column generation procedure. The proposed branch-and-price algorithm shows encouraging results on solving some Solomon-based instances.
Fil: Dondo, Rodolfo Gabriel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química (i); Argentina
description One important factor in supply chain management is to efficiently control the supply chain flows. Due to its importance, many companies are trying to develop efficient methods to increase customer satisfaction and reduce costs. Cross-docking is considered a good method to reduce inventory and improve responsiveness. The Vehicle Routing Problem with Cross-Docking and Time Windows (VRP-CD-TW) consists on designing the minimum-cost set of routes to serve a given set of transportation requests while respecting constraints on vehicles capacity, customer time windows and using transfers on a cross-docking base. Each customer must be visited just once and mixed tours comprising pick-up and delivery stops are not allowed. For a given vehicle, the designed pick-up tour must precede its delivery tour. In this work, we model the VRP-CD-TW assuming that all feasible orders are known in advance. We present a new mixed integer program to model the VRP-CD-TW and reformulate it via Dantzig-Wolfe decomposition to later develop a column generation procedure. The proposed branch-and-price algorithm shows encouraging results on solving some Solomon-based instances.
publishDate 2013
dc.date.none.fl_str_mv 2013-10
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/8606
Dondo, Rodolfo Gabriel; A Branch-and-price Method for the Vehicle Routing problem with Cross-docking and Time Windows; Universidade Federal de Santa Catarina; Iberoamerican Journal of Industrial Engineering; 5; 10; 10-2013; 16-25
2175-8018
url http://hdl.handle.net/11336/8606
identifier_str_mv Dondo, Rodolfo Gabriel; A Branch-and-price Method for the Vehicle Routing problem with Cross-docking and Time Windows; Universidade Federal de Santa Catarina; Iberoamerican Journal of Industrial Engineering; 5; 10; 10-2013; 16-25
2175-8018
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://incubadora.periodicos.ufsc.br/index.php/IJIE/article/view/3057
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Universidade Federal de Santa Catarina
publisher.none.fl_str_mv Universidade Federal de Santa Catarina
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1844613317488803840
score 13.070432

Publicaciones similares