A Path-Based Approach for Hazmat Transport Network Design
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The people living and working around the roads used for hazardous material (hazmat) shipments face the risk of suffering undesirable consequences of an accident. The main responsibility to mitigate the hazmat transport risk at a population zone belongs to the government agency with jurisdiction over that region. One of the common policy tools is to close certain road links to vehicles carrying hazmats. In effect, the road network available to dangerous goods carriers can be determined by the regulator. The transport risk in the region, however, is determined by the carriers' routing decisions over the available road network. Thus, the regulator needs to make the road closure decisions so that the total risk resulting from the carriers' route choices is minimized. We provide a path-based formulation for this network design problem. Alternative solutions can be generated by varying the routing options included in the model for each shipment. Each solution corresponds to a certain compromise between the two parties in terms of transport risk and economic viability. The proposed framework can be used for identifying mutually agreeable hazmat transport policies. We present two applications of the methodology to illustrate the insights that can be gained through its use: The first application focuses on hazmat shipments through the highway network of Western Ontario, Canada, whereas the second application studies the problem in a much larger geographical region that covers the provinces of Ontario and Quebec.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.008 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.004 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it