Name
Abstract | ||
|---|---|---|
•New berth allocation problem arising in terminals with irregular layouts is studied.•New spatial and temporal constraints limit both the mooring and departure of vessels.•A mixed integer linear model and a heuristic are proposed to solve the problem.•Both methods generate good quality solutions, some of which are proven optimal.•Instances, based on real-world characteristics, are made publicly available. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.ejor.2018.07.019 | European Journal of Operational Research |
Keywords | Field | DocType |
Combinatorial optimization,Port terminal,Berth allocation,Integer programming,Iterated local search | Revenue,Mathematical optimization,Heuristic,Berth allocation problem,Mooring,Integer linear programming formulation,Combinatorial optimization,Integer programming,Iterated local search,Mathematics | Journal |
Volume | Issue | ISSN |
272 | 3 | 0377-2217 |
Citations | PageRank | References |
1 | 0.35 | 20 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juan Francisco Correcher | 1 | 14 | 1.97 |
| Thomas Van den Bossche | 2 | 1 | 0.35 |
| Ramon Alvarez-Valdes | 3 | 163 | 13.03 |
| Greet Van Den Berghe | 4 | 24 | 3.37 |