Research Article
Two Chaotic Patterns of Dynamic Risk Definition for Solving Hazardous Materials Routing Problem
Table 3
Frequency of the best optimal paths for different chaos equations.
| Chaos equation | O-D | (Cost, risk) priorities | Pairs | (0, 1) | (0.3, 0.7) | (0.5, 0.5) | (0.7, 0.3) | (1, 0) |
| Logistic map | 43–71 | 262 | 288 | 302 | 319 | 365 | 33–67 | 74 | 116 | 185 | 318 | 365 |
| Route to chaos | 43–71 | 301 | 304 | 305 | 336 | 365 | 33–67 | 99 | 162 | 207 | 348 | 365 |
| Logistic map | Average | 168 | 202 | 243.5 | 318.5 | 365 | Route to chaos | 200 | 233 | 256 | 342 | 365 |
|
|