Optimization of Logistic Solutions for Incoming and Outgoing Trucks System Using a Simulated Cross-Docking Centre Environment
Bibliographic record
Abstract
This study describes, characterises and analyses the optimisation of truck entry and exit time windows, which includes a cross-docking centre planning strategy, using the simulation environment of the AnyLogic software environment.The article describes the use of software integers (IP*) and heuristics (IP1 and IP2) for the time windows of a cross-docking centre.Based on a mathematical model using an integer number program (IP*) and heuristics (IP1 and IP2), a scheduling problem is investigated.This program consists in minimizing the penalties for violation of the time windows for inbound and outbound trucks.It also enables to calculate the operation time of time windows on an ongoing basis.The cross-docking-center model is a layout, which includes logistic elements of technological processes, created using the AnyLogic software.It is found out by using order diagrams that after unloading arriving trucks, the goods are collected in four stages, the first two of which (queuing and waiting for collection) determine the loading rate of goods in the trucks departing from the crossdock.After determining the main stages of order collecting using the cross-docking strategy, the dependences of the average time of unloading and loading goods are studied.The average unloading and loading time are found to be 30 and 25 minutes, respectively.Based on the time dependences, a diagram of the average time of a truck in the dock, being about an hour -an hour and a half, is created.
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 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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".