Name
Abstract | ||
|---|---|---|
In the berth-allocation problem (BAP) the aim is to optimally schedule and assign ships to berthing areas along a quay. The objective is the minimization of the total (weighted) service time for all ships, defined as the time elapsed between the arrival in the harbor and the completion of handling. Two versions of the BAP are considered: the discrete case and the continuous case. The discrete case works with a finite set of berthing points. In the continuous case ships can berth anywhere along the quay. Two formulations and a tabu search heuristic are presented for the discrete case. Only small instances can be solved optimally. For these sizes the heuristic always yields an optimal solution. For larger sizes it is always better than a truncated branch-and-bound applied to an exact formulation. A heuristic is also developed for the continuous case. Computational comparisons are performed with the first heuristic and with a simple constructive procedure. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1287/trsc.1050.0120 | Transportation Science |
Keywords | Field | DocType |
berthing point,tabu search heuristics,berth allocation,discrete case work,time windows.,service time,computational comparison,tabu search,scheduling,discrete case,berth-allocation problem,continuous case,continuous case ship,tabu search heuristic,berthing area,vehicle routing,maritime container terminal,routing,branch and bound | Mathematical optimization,Heuristic,Vehicle routing problem,Finite set,Berth allocation problem,Scheduling (computing),Minification,Heuristics,Mathematics,Tabu search,Operations management | Journal |
Volume | Issue | ISSN |
39 | 4 | 0041-1655 |
Citations | PageRank | References |
85 | 4.07 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jean-François Cordeau | 1 | 2604 | 127.77 |
| Gilbert Laporte | 2 | 8666 | 612.13 |
| Pasquale Legato | 3 | 282 | 20.44 |
| Luigi Moccia | 4 | 192 | 11.25 |