Vehicle routing for hazardous material transportation

The main objective of this thesis is to study the hazardous materials (HazMat) transportation problem considered as a heterogeneous fleet vehicle routing problem. HazMat transportation decisions comprise different and sometimes conflicting objectives. Two are considered in this work, the total routi...

Full description

Autores:
Bula, Gustavo Alfredo
Tipo de recurso:
Doctoral thesis
Fecha de publicación:
2018
Institución:
Universidad Nacional de Colombia
Repositorio:
Universidad Nacional de Colombia
Idioma:
spa
OAI Identifier:
oai:repositorio.unal.edu.co:unal/63981
Acceso en línea:
https://repositorio.unal.edu.co/handle/unal/63981
http://bdigital.unal.edu.co/64656/
Palabra clave:
6 Tecnología (ciencias aplicadas) / Technology
62 Ingeniería y operaciones afines / Engineering
Mathematical models
Hazardous substances - Transport
Hazardous substances - Risk Assessment
Variable neighborhood search
Traveling salesman problem
Modelos Matemáticos
Substancias peligrosas - Transporte
Substancias - Evaluación del riesgo
Búsqueda con vecindarios variables
Problema del agente viajero
Rights
openAccess
License
Atribución-NoComercial 4.0 Internacional
Description
Summary:The main objective of this thesis is to study the hazardous materials (HazMat) transportation problem considered as a heterogeneous fleet vehicle routing problem. HazMat transportation decisions comprise different and sometimes conflicting objectives. Two are considered in this work, the total routing cost and the total routing risk. The first task undertaken was the formulation of a mathematical model for the routing risk minimization, which depends on the type of vehicle, the material being transported, and the load change when the vehicle goes from one customer to another. A piecewise linear approximation is employed to keep a mixed integer linear programing formulation. Hybrid solution methods based on neighborhood search are explored for solving the routing risk minimization. This includes the study of neighborhood structures and the development of a Variable Neighborhood Descent (VND) algorithm for local search, and a perturbation mechanism (shaking neighborhoods). A postoptimization procedure is applied to improve the solution quality. Finally, two different solution approaches, a multi-objective dominance-based algorithm and a meta-heuristic ϵ-constraint method are employed for addressing the multi-objective version of the problem. Two performance metrics are used: the hypervolume and the ∆-metric. The front approximations show that a small increment in the total routing cost can produce a high reduction in percentage of the expected consequences given the probability of a HazMat transportation incident.