Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm (Q5059243)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm |
scientific article; zbMATH DE number 7637072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm |
scientific article; zbMATH DE number 7637072 |
Statements
Solving a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm (English)
0 references
23 December 2022
0 references
berth allocation
0 references
stochastic optimization
0 references
sequence pair
0 references
scheduling
0 references
simulated annealing
0 references
0 references
0 references
0 references
0 references
0 references
0.8311055898666382
0 references
0.8121644258499146
0 references
0.8024609088897705
0 references
0.7892053723335266
0 references
