MétaCan
Menu
Back to cohort
Record W7117476672 · doi:10.3390/asi9010010

An Artificial Intelligence Enhanced Transfer Graph Framework for Time-Dependent Intermodal Transport Optimization

2025· article· en· W7117476672 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueApplied System Innovation · 2025
Typearticle
Languageen
FieldEngineering
TopicVehicle Routing Optimization Methods
Canadian institutionsFrancophone University Association
Fundersnot available
KeywordsModular designSubnetworkScalabilityGraphComputationRouting (electronic design automation)Bridging (networking)Schedule

Abstract

fetched live from OpenAlex

In the digital era, rapid urban growth and the demand for sustainable mobility are placing increasing pressure on transport systems, where congestion, energy consumption, and schedule variability complicate intermodal journey planning. This work proposes an AI-enhanced transfer-graph framework that models each transport mode as an independent subnetwork connected through explicit transfer arcs. This modular structure captures modal interactions while reducing graph complexity, enabling algorithms to operate more efficiently in time-dependent contexts. A Deep Q-Network (DQN) agent is further introduced as an exploratory alternative to exact and meta-heuristic methods for learning adaptive routing strategies. Exact (Dijkstra) and meta-heuristic (ACO, DFS, GA) algorithms were evaluated on synthetic networks reflecting Casablanca’s intermodal structure, achieving coherent routing with favorable computation and memory performance. The results demonstrate the potential of combining transfer-graph decomposition with learning-based components to support scalable intermodal routing.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.746
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.016
GPT teacher head0.279
Teacher spread0.262 · 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