|
Volumn 52, Issue 4, 2013, Pages 671-677
|
A heuristics-based solution to the continuous berth allocation and crane assignment problem
|
Author keywords
Berth Allocation Problem (BAP); Container Terminal (CT); Quay Crane Assignment Problem (QCAP); Simulated Annealing (SA)
|
Indexed keywords
COMBINATORIAL OPTIMIZATION;
COMPUTATIONAL COMPLEXITY;
CRANES;
HEURISTIC METHODS;
PORT TERMINALS;
RAILROAD YARDS AND TERMINALS;
SIMULATED ANNEALING;
TRANSFER CASES (VEHICLES);
ASSIGNMENT PROBLEMS;
BERTH ALLOCATION PROBLEM;
COMPUTATIONAL TIME;
CONTAINER TERMINAL;
HIGH-QUALITY SOLUTIONS;
OPTIMIZATION PROBLEMS;
QUAY CRANE ASSIGNMENT PROBLEMS;
SOLUTION METHODOLOGY;
RESERVATION SYSTEMS;
|
EID: 84889665791
PISSN: 11100168
EISSN: None
Source Type: Journal
DOI: 10.1016/j.aej.2013.09.001 Document Type: Article |
Times cited : (32)
|
References (11)
|