Yard Allocation Problem (YAP) is a frequently problem observed in port logistic operations, and consists in a temporary assignment of cargo containers, both export and import, to blocks storage located in the operation zone of seaports. The principal objective of YAP resolution is to improve the operations efficiency both terminal port as shipping companies that use the seaport, which allow to decrease operational cost and increasing the global efficiency. In this sense, this work proposes to solve the YAP using a constructive algorithm based in restrictions for each container. Official data of Arica Seaport — Chile were used for defining an experimental scenario, which allowed obtaining promising results. The constructive algorithm represents a novel approach because allows getting solutions in a simple and fast way, while satisfying the existing set of constrains associated with the general operation model.