Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation - Archive ouverte HAL Access content directly
Journal Articles Journal of Hazardous Materials Year : 2017

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

(1, 2) , (1) , (2) , (1) , (3)
1
2
3

Abstract

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.
Not file

Dates and versions

hal-02485524 , version 1 (20-02-2020)

Identifiers

Cite

Gustavo Alfredo Bula, Caroline Prodhon, Fabio Augusto Gonzalez, Hasan Murat Afsar, Nubia Velasco. Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation. Journal of Hazardous Materials, 2017, 324, pp.472-480. ⟨10.1016/j.jhazmat.2016.11.015⟩. ⟨hal-02485524⟩

Collections

CNRS UTT LOSI
17 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More