Improving Container Port Efficiency: A Data‐Driven Model for Optimizing Truck Arrival Appointments Through Distributionally Robust Optimization
Bibliographic record
Abstract
The irregular arrival patterns of container trucks at ports have a substantial impact on logistics operations’ efficiency, resulting in congestion during peak hours and unused port capacity during idle times. Implementing a truck appointment system (TAS) is vital to address this issue effectively. This paper suggests enhancing the TAS by adopting a data‐driven approach using terminal gate data to understand the intricate and uncertain relationship between truck arrival patterns and port operational efficiency. Insights gained from these data are utilized to develop a distributionally robust optimization (DRO) model. This model provides an exact solution for optimizing the appointment quota plan of TASs, thereby improving port efficiency and addressing operational challenges. Compared to existing methods, this approach does not heavily rely on theoretical assumptions concerning the cooperation mechanisms among trucks, yard equipment, quayside equipment, and other facilities and fully considers the complex uncertainties in truck arrivals. Furthermore, to examine the effectiveness of the proposed model, a case study is conducted at Yan Port, China, aiming to achieve practical results. The numerical experiments comparing its performance with the conventional robust optimization (RO) model confirm the superiority of the proposed DRO model in minimizing the total truck turnaround time within the terminal and overall time expenses. This superiority stems from its integration of the respective advantages of stochastic optimization (SO) and traditional RO methods. By optimizing the appointment quota plan in this manner, it achieves a balanced distribution of truck arrivals, showcasing its significant potential to enhance port logistics efficiency.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".