Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation

This work focuses on the Heterogeneous Fleet Vehicle Routing problem (HFVRP) in the context of hazardous materials (HazMat) transportation. The objective is to determine a set of routes that minimizes the total expected routing risk. This is a nonlinear function, and it depends on the vehicle load a...

Descripción completa

Detalles Bibliográficos
Autores: Bula, G., Prodhon, C., González, F., Afsar, H.M., Velasco, N.
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2017
País:Colombia
Institución:Universidad de los Andes
Repositorio:Séneca: repositorio Uniandes
Idioma:inglés
OAI Identifier:oai:repositorio.uniandes.edu.co:1992/46986
Acceso en línea:http://hdl.handle.net/1992/46986
https://www.sciencedirect.com/science/article/pii/S0304389416310196
Access Level:acceso abierto
Palabra clave:Transportation risk assessment
Heterogeneous vehicle routing problem
Variable neighborhood search
id CO_bb5722bf69716543951ef4730858badb
oai_identifier_str oai:repositorio.uniandes.edu.co:1992/46986
network_acronym_str CO
network_name_str Colombia
repository_id_str
spelling Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportationBula, G.Prodhon, C.González, F.Afsar, H.M.Velasco, N.Transportation risk assessmentHeterogeneous vehicle routing problemVariable neighborhood searchThis work focuses on the Heterogeneous Fleet Vehicle Routing problem (HFVRP) in the context of hazardous materials (HazMat) transportation. The objective is to determine a set of routes that minimizes the total expected routing risk. This is a nonlinear function, and it depends on the vehicle load and the population exposed when an incident occurs. Thus, a piecewise linear approximation is used to estimate it. For solving the problem, a variant of the Variable Neighborhood Search (VNS) algorithm is employed. To improve its performance, a post-optimization procedure is implemented via a Set Partitioning (SP) problem. The SP is solved on a pool of routes obtained from executions of the local search procedure embedded on the VNS. The algorithm is tested on two sets of HFVRP instances based on literature with up to 100 nodes, these instances are modified to include vehicle and arc risk parameters. The results are competitive in terms of computational efficiency and quality attested by a comparison with Mixed Integer Linear Programming (MILP) previously proposed.Facultad de Administración2020-10-01T16:50:56Z2020-10-01T16:50:56Z2017Artículo de revistainfo:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/version/c_ab4af688f83e57aaTexthttp://purl.org/redcol/resource_type/ARTp. 593-738application/pdfhttp://hdl.handle.net/1992/46986https://www.sciencedirect.com/science/article/pii/S0304389416310196instname:Universidad de los Andesreponame:Repositorio Institucional Sénecarepourl:https://repositorio.uniandes.edu.co/reponame:Séneca: repositorio Uniandesinstname:Universidad de los Andesinstacron:Universidad de los AndesengAl consultar y hacer uso de este recurso, está aceptando las condiciones de uso establecidas por los autores.info:eu-repo/semantics/openAccesshttp://purl.org/coar/access_right/c_abf22022-06-02T14:04:31Z
dc.title.none.fl_str_mv Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation
title Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation
spellingShingle Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation
Bula, G.
Transportation risk assessment
Heterogeneous vehicle routing problem
Variable neighborhood search
title_short Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation
title_full Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation
title_fullStr Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation
title_full_unstemmed Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation
title_sort Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation
dc.creator.none.fl_str_mv Bula, G.
Prodhon, C.
González, F.
Afsar, H.M.
Velasco, N.
author Bula, G.
author_facet Bula, G.
Prodhon, C.
González, F.
Afsar, H.M.
Velasco, N.
author_role author
author2 Prodhon, C.
González, F.
Afsar, H.M.
Velasco, N.
author2_role author
author
author
author
dc.subject.none.fl_str_mv Transportation risk assessment
Heterogeneous vehicle routing problem
Variable neighborhood search
topic Transportation risk assessment
Heterogeneous vehicle routing problem
Variable neighborhood search
description This work focuses on the Heterogeneous Fleet Vehicle Routing problem (HFVRP) in the context of hazardous materials (HazMat) transportation. The objective is to determine a set of routes that minimizes the total expected routing risk. This is a nonlinear function, and it depends on the vehicle load and the population exposed when an incident occurs. Thus, a piecewise linear approximation is used to estimate it. For solving the problem, a variant of the Variable Neighborhood Search (VNS) algorithm is employed. To improve its performance, a post-optimization procedure is implemented via a Set Partitioning (SP) problem. The SP is solved on a pool of routes obtained from executions of the local search procedure embedded on the VNS. The algorithm is tested on two sets of HFVRP instances based on literature with up to 100 nodes, these instances are modified to include vehicle and arc risk parameters. The results are competitive in terms of computational efficiency and quality attested by a comparison with Mixed Integer Linear Programming (MILP) previously proposed.
publishDate 2017
dc.date.none.fl_str_mv 2017
2020-10-01T16:50:56Z
2020-10-01T16:50:56Z
dc.type.none.fl_str_mv Artículo de revista
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
http://purl.org/coar/version/c_ab4af688f83e57aa
Text
http://purl.org/redcol/resource_type/ART
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/1992/46986
https://www.sciencedirect.com/science/article/pii/S0304389416310196
instname:Universidad de los Andes
reponame:Repositorio Institucional Séneca
repourl:https://repositorio.uniandes.edu.co/
url http://hdl.handle.net/1992/46986
https://www.sciencedirect.com/science/article/pii/S0304389416310196
identifier_str_mv instname:Universidad de los Andes
reponame:Repositorio Institucional Séneca
repourl:https://repositorio.uniandes.edu.co/
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
rights_invalid_str_mv http://purl.org/coar/access_right/c_abf2
dc.format.none.fl_str_mv p. 593-738
application/pdf
dc.publisher.none.fl_str_mv Facultad de Administración
publisher.none.fl_str_mv Facultad de Administración
dc.source.none.fl_str_mv reponame:Séneca: repositorio Uniandes
instname:Universidad de los Andes
instacron:Universidad de los Andes
instname_str Universidad de los Andes
instacron_str Universidad de los Andes
institution Universidad de los Andes
reponame_str Séneca: repositorio Uniandes
collection Séneca: repositorio Uniandes
_version_ 1825050603350392832
score 15,812455

Similares en LA Referencia