An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints

Autores
Dondo, Rodolfo Gabriel; Mendez, Carlos Alberto; Cerda, Jaime
Año de publicación
2003
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
The vehicle routing problem (VRP) has become a crucial industrial issue for its impact on product distribution costs. Though quite important in practice, the time-constrained version of the VRP accounting for several types of vehicles and m- depots, called the extended VRP with time windows (m-VRPTW), has received less attention. Since it is an NP-hard problem, most of the current approaches to m-VRPTW are heuristic, thus providing good but not necessarily optimal solutions. This work presents a novel MILP mathematical framework for the m-depot heterogeneous-fleet VRPTW problem. The new optimization approach permits to find both the optimal vehicle route/schedule and the fleet size by choosing the best set of preceding nodes for each pick-up point. To get a significant reduction on the problem size to tackle larger m-VRPTW problems, some elimination rules have been embedded in the MILP framework. When applied to a pair of examples, it was observed a remarkable saving in computer costs with regards to prior VRPTW optimization methods.
Fil: Dondo, Rodolfo Gabriel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
Fil: Mendez, Carlos Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
Fil: Cerda, Jaime. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
Materia
Vrptw
Milp Formulation
Soft/Hard Time-Windos
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/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/27382
Acceder
id CONICETDig_161863c131bf97df561cc903de917321
oai_identifier_str oai:ri.conicet.gov.ar:11336/27382
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraintsDondo, Rodolfo GabrielMendez, Carlos AlbertoCerda, JaimeVrptwMilp FormulationSoft/Hard Time-Windoshttps://purl.org/becyt/ford/2.4https://purl.org/becyt/ford/2The vehicle routing problem (VRP) has become a crucial industrial issue for its impact on product distribution costs. Though quite important in practice, the time-constrained version of the VRP accounting for several types of vehicles and m- depots, called the extended VRP with time windows (m-VRPTW), has received less attention. Since it is an NP-hard problem, most of the current approaches to m-VRPTW are heuristic, thus providing good but not necessarily optimal solutions. This work presents a novel MILP mathematical framework for the m-depot heterogeneous-fleet VRPTW problem. The new optimization approach permits to find both the optimal vehicle route/schedule and the fleet size by choosing the best set of preceding nodes for each pick-up point. To get a significant reduction on the problem size to tackle larger m-VRPTW problems, some elimination rules have been embedded in the MILP framework. When applied to a pair of examples, it was observed a remarkable saving in computer costs with regards to prior VRPTW optimization methods.Fil: Dondo, Rodolfo Gabriel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; ArgentinaFil: Mendez, Carlos Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; ArgentinaFil: Cerda, Jaime. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; ArgentinaPlanta Piloto de Ingeniería Química2003-10info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/27382Dondo, Rodolfo Gabriel; Mendez, Carlos Alberto; Cerda, Jaime; An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints; Planta Piloto de Ingeniería Química; Latin American Applied Research; 33; 2; 10-2003; 129-1340327-07931851-8796CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/http://www.laar.uns.edu.ar/indexes/artic_v3302/pag129.pdfinfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-17T11:05:36Zoai:ri.conicet.gov.ar:11336/27382instacron: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-17 11:05:37.115CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints
title An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints
spellingShingle An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints
Dondo, Rodolfo Gabriel
Vrptw
Milp Formulation
Soft/Hard Time-Windos
title_short An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints
title_full An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints
title_fullStr An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints
title_full_unstemmed An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints
title_sort An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints
dc.creator.none.fl_str_mv Dondo, Rodolfo Gabriel
Mendez, Carlos Alberto
Cerda, Jaime
author Dondo, Rodolfo Gabriel
author_facet Dondo, Rodolfo Gabriel
Mendez, Carlos Alberto
Cerda, Jaime
author_role author
author2 Mendez, Carlos Alberto
Cerda, Jaime
author2_role author
author
dc.subject.none.fl_str_mv Vrptw
Milp Formulation
Soft/Hard Time-Windos
topic Vrptw
Milp Formulation
Soft/Hard Time-Windos
purl_subject.fl_str_mv https://purl.org/becyt/ford/2.4
https://purl.org/becyt/ford/2
dc.description.none.fl_txt_mv The vehicle routing problem (VRP) has become a crucial industrial issue for its impact on product distribution costs. Though quite important in practice, the time-constrained version of the VRP accounting for several types of vehicles and m- depots, called the extended VRP with time windows (m-VRPTW), has received less attention. Since it is an NP-hard problem, most of the current approaches to m-VRPTW are heuristic, thus providing good but not necessarily optimal solutions. This work presents a novel MILP mathematical framework for the m-depot heterogeneous-fleet VRPTW problem. The new optimization approach permits to find both the optimal vehicle route/schedule and the fleet size by choosing the best set of preceding nodes for each pick-up point. To get a significant reduction on the problem size to tackle larger m-VRPTW problems, some elimination rules have been embedded in the MILP framework. When applied to a pair of examples, it was observed a remarkable saving in computer costs with regards to prior VRPTW optimization methods.
Fil: Dondo, Rodolfo Gabriel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
Fil: Mendez, Carlos Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
Fil: Cerda, Jaime. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
description The vehicle routing problem (VRP) has become a crucial industrial issue for its impact on product distribution costs. Though quite important in practice, the time-constrained version of the VRP accounting for several types of vehicles and m- depots, called the extended VRP with time windows (m-VRPTW), has received less attention. Since it is an NP-hard problem, most of the current approaches to m-VRPTW are heuristic, thus providing good but not necessarily optimal solutions. This work presents a novel MILP mathematical framework for the m-depot heterogeneous-fleet VRPTW problem. The new optimization approach permits to find both the optimal vehicle route/schedule and the fleet size by choosing the best set of preceding nodes for each pick-up point. To get a significant reduction on the problem size to tackle larger m-VRPTW problems, some elimination rules have been embedded in the MILP framework. When applied to a pair of examples, it was observed a remarkable saving in computer costs with regards to prior VRPTW optimization methods.
publishDate 2003
dc.date.none.fl_str_mv 2003-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/27382
Dondo, Rodolfo Gabriel; Mendez, Carlos Alberto; Cerda, Jaime; An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints; Planta Piloto de Ingeniería Química; Latin American Applied Research; 33; 2; 10-2003; 129-134
0327-0793
1851-8796
CONICET Digital
CONICET
url http://hdl.handle.net/11336/27382
identifier_str_mv Dondo, Rodolfo Gabriel; Mendez, Carlos Alberto; Cerda, Jaime; An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints; Planta Piloto de Ingeniería Química; Latin American Applied Research; 33; 2; 10-2003; 129-134
0327-0793
1851-8796
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://www.laar.uns.edu.ar/indexes/artic_v3302/pag129.pdf
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Planta Piloto de Ingeniería Química
publisher.none.fl_str_mv Planta Piloto de Ingeniería Química
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_ 1843606373151014912
score 13.001348

Publicaciones similares