MétaCan
Menu
Back to cohort
Record W2046349969 · doi:10.1287/trsc.1100.0339

A Tactical Planning Model for Railroad Transportation of Dangerous Goods

2010· article· en· W2046349969 on OpenAlexaff
Manish Verma, Vedat Verter, Michel Gendreau

Bibliographic record

VenueTransportation Science · 2010
Typearticle
Languageen
FieldDecision Sciences
TopicRisk and Safety Analysis
Canadian institutionsPolytechnique MontréalMcGill UniversityMemorial University of Newfoundland
Fundersnot available
KeywordsTrainDangerous goodsTransportation planningTransport engineeringOperations researchTruckGenetic algorithmFlow networkPopulationYardHazardous wasteComponent (thermodynamics)EngineeringComputer scienceMathematical optimizationGeography

Abstract

fetched live from OpenAlex

Railroad transportation of hazardous materials did not receive as much attention as highway transportation in the academic literature, although comparable volumes are shipped via these two transport modes in North America and Europe. In this paper, we present an optimization methodology for the railroad tactical planning problem with risk and cost objectives. We determine the routes to be used for each shipment, the yard activities, and the number of trains of different types needed in the network. The transport risk assessment component of our model incorporates the differentiating characteristics of railroad operations. We develop a memetic algorithm-based solution methodology, which combines genetic and local searches, to solve the biobjective model. The railroad infrastructure in the midwestern United States is used as a basis for generating problem instances of the size encountered in real life. Our analyses of the solutions of instances indicate that it is possible to achieve significant reductions in population exposure without incurring unacceptable increases in operational costs.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.023
Threshold uncertainty score0.045

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.002
Science and technology studies0.0010.001
Scholarly communication0.0020.001
Open science0.0020.001
Research integrity0.0020.001
Insufficient payload (model declined to judge)0.0060.001

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.

Opus teacher head0.133
GPT teacher head0.440
Teacher spread0.308 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations74
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueTransportation ScienceSame topicRisk and Safety AnalysisFrench-language works237,207