Name
Title | ||
|---|---|---|
Optimal berth allocation and time-invariant quay crane assignment in container terminals. |
Abstract | ||
|---|---|---|
•The integrated problem called BACASP can be solved optimally for 60 vessels.•A necessary and sufficient condition is found for generating an optimal solution.•If this condition is not satisfied, a cutting plane algorithm is used. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.ejor.2013.10.015 | European Journal of Operational Research |
Keywords | Field | DocType |
Berth allocation,Crane assignment,Container terminals,Cutting plane algorithm | LTI system theory,Mathematical optimization,Cutting plane algorithm,Binary Integer Decimal,Linear programming,Integrated business planning,Mathematics,Operations management | Journal |
Volume | Issue | ISSN |
235 | 1 | 0377-2217 |
Citations | PageRank | References |
23 | 0.94 | 11 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yavuz Bogaç Türkogullari | 1 | 45 | 2.73 |
| Z. Caner TaşKıN | 2 | 82 | 12.14 |
| Necati Aras | 3 | 462 | 30.62 |
| I. Kuban Altinel | 4 | 150 | 14.60 |