Two-Phase Optimization Models for Liner Shipping Network Based on Hub Ports Cooperation: From the Perspective of Supply-Side Reform in China
Bibliographic record
Abstract
From the perspective of supply-side reform in China, it is hard for COSCO Shipping, a merged company with a strong shipping capacity, to abandon the container shipping market. Meanwhile, the new company could cooperate with new strategic ports along the Maritime Silk Road in liner service. Against this backdrop, this paper aims to optimize the liner shipping network (LSN) from strategic, tactical, and operational levels and help the merged shipping company adjust its operational measures according to market changes. The optimization towards different levels of decision-making process is a new research of highly practical values. Specifically, this paper created two-phase optimization models for LSN based on the selection of hub ports. In Network Assessment (NA) phase, the LSNs of two types of hub ports selected are designed and assessed on strategic and tactical levels, and the primary and secondary routes are identified; in Network Operation (NO) phase, the “path-based flow” formulations are proposed from the operational level, considering operational measures including demand rejection and flow integration. The models in both phases are mixed-integer linear programming (MILP), but are solved by different tools: CPLEX for the NA phase models and the Genetic Algorithm (GA) for the NO phase models due to the computational complexity of the latter problem. Then, a computational experiment is performed on the LSN of COSCO Shipping on the Persian Gulf trade lane. The results have proved the effectiveness of the methodology and inspired important countermeasures for the merged shipping company.
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.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".