Name
Abstract | ||
|---|---|---|
•We propose a new approach for treatment of HAZMAT transportation in urban areas.•The approach maximises the distance between a HAZMAT route and its closest vulnerable population centre.•An exact model is proposed, including a method of reduction of variables, and an optimal, polynomial heuristic.•A real-like large instance is solved. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ejor.2014.08.005 | European Journal of Operational Research |
Keywords | Field | DocType |
Networks,Routing,HAZMAT | Population,Mathematical optimization,Heuristic,Minimax,Integer programming,Time complexity,Urban area,Mathematics,Transport network,Operations management,Residence | Journal |
Volume | Issue | ISSN |
241 | 1 | 0377-2217 |
Citations | PageRank | References |
4 | 0.38 | 35 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrés Bronfman | 1 | 4 | 0.38 |
| Vladimir Marianov | 2 | 472 | 44.81 |
| Germán Paredes-Belmar | 3 | 7 | 1.10 |
| Armin Lüer-Villagra | 4 | 31 | 2.92 |