2018
DOI: 10.1007/s10586-018-2216-x
|View full text |Cite
|
Sign up to set email alerts
|

The improved AFSA algorithm for the berth allocation and quay crane assignment problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…Constraint (11) defines the composition of the departure time. Constraints (12)(13)(14)(15)(16)(17) give the range of the corresponding parameters used in the study.…”
Section: Model Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…Constraint (11) defines the composition of the departure time. Constraints (12)(13)(14)(15)(16)(17) give the range of the corresponding parameters used in the study.…”
Section: Model Formulationmentioning
confidence: 99%
“…Zheng, et al [15] discretized the terminal line into 100-metre segments when minimizing the total turnaround time of vessels for the BACAP. Liu, et al [16] utilized 10-metre segments in dealing with BACAP by artificial fish swarm algorithm. Correcher, et al [17] compared the results for discretization of quay length to 10 and 50 meters in continuous BACAP and considered a finer discretization can produce better solutions.…”
Section: Introductionmentioning
confidence: 99%