Journal
NETWORKS & SPATIAL ECONOMICS
Volume 14, Issue 1, Pages 91-116Publisher
SPRINGER
DOI: 10.1007/s11067-013-9208-4
Keywords
Location problem; Hazardous waste facility; Robust optimization; Genetic algorithm
Ask authors/readers for more resources
We consider a robust facility location problem for hazardous materials (hazmat) transportation considering routing decisions of hazmat carriers. Given a network and a known set of nodes from which hazmat originate, we compute the locations of hazmat processing sites (e.g. incinerators) which will minimize total cost, in terms of fixed facility cost, transportation cost, and exposure risk. We assume that hazmat will be taken to the closest existing processing site. We present an exact full enumeration method, which is useful for small or medium-size problems. For larger problems, the use of a genetic algorithm is explored. Through numerical experiments, we discuss the impact of uncertainty and robust optimization in the hazmat combined location-routing problem.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available