Search

The present paper discusses the fleet distribution side of the Ship Routing and Scheduling problem combining factors of tactical and operative levels for an industrial service of maritime transportation of cargoes. A mathematical model based on the Generalized Bin Packing Problem wasused, which issupportedin the Local Search algorithm with first ascent and restart, to guarantee the solution of big instances that make computationally untreatable the problem. Through experimentation, it was determined that the best results were obtained by modifying 3 bits in the allocation matrix of ships by transport directions. In addition,a restart parameter was set based in the iterations quantity, so it remarkable improves de exploration process of the algorithm. The variation of the algorithm proposed, allows to obtain acce [ABSTRACT FROM AUTHOR]