The maxisum and maximin-maxisum HAZMAT routing problems
Autor: | Armin Lüer-Villagra, Vladimir Marianov, Germán Paredes-Belmar, Andrés Bronfman |
---|---|
Jazyk: | angličtina |
Rok vydání: | 2016 |
Předmět: |
Hazard (logic)
050210 logistics & transportation Mathematical optimization Polynomial 021103 operations research Computer science Heuristic 05 social sciences 0211 other engineering and technologies Transportation 02 engineering and technology Minimax Transport engineering 0502 economics and business Closest point Business and International Management Routing (electronic design automation) Civil and Structural Engineering |
Zdroj: | TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW Artículos CONICYT CONICYT Chile instacron:CONICYT |
Popis: | We design routes for transportation of hazardous materials (HAZMAT) in urban areas, with multiple origin-destination pairs. First, we introduce the maxisum HAZMAT routing problem, which maximizes the sum of the population-weighted distances from vulnerable centers to their closest point on the routes. Secondly, the maximin-maxisum HAZMAT routing problem trades-off maxisum versus the population-weighted distance from the route to its closest center. We propose efficient IP formulations for both NP-Hard problems, as well as a polynomial heuristic that reaches gaps below 0.54% in a few seconds on the real case in the city of Santiago, Chile. |
Databáze: | OpenAIRE |
Externí odkaz: |