This work presents a Simulated Annealing based heuristic to solve the Berth Allocation Problem. This problem approaches the programming and allocation of ships to mooring areas along a quay. The problem is modeled as a Multi-Depot Vehicle Routing Problem with Time Windows. For application of Simulated Annealing, software was developed, enabling scenarios closest to perform activities practiced in ports. The computational results are obtained through test problems with real data from the Container Terminal Tecon Rio Grande.
routing; allocation; simulated annealing; ports