Optimización de la distribución de la flota de cabotaje en múltiples direcciones de transportación//Optimization of the distribution of the coastal navigation fleet in multiple transport directions
Abstract
El presente artículo abordó la arista de distribución de la flota del problema de Ruteo y Planificación de Buques combinando factores del nivel táctico y del operativo para un servicio industrial de transporte marítimo de cargas. Se utilizó un modelo basado en el Problema de Empaquetamiento Generalizado, para el cual se implementó el algoritmo Búsqueda Local con primer ascenso y reinicio para garantizar la solución de instancias grandes que hacen el problema intratable computacionalmente. A través de la experimentación se determinó que los mejores resultados se obtuvieron modificando 3 bits en la matriz de asignación de buques por direcciones de transportación. Además, se estableció un parámetro de reinicio que basado en la cantidad de iteraciones mejoraron notablemente el proceso de exploración del algoritmo. La variante del algoritmo propuesta, permite obtener soluciones aceptables para instancias medianas y grandes del problema en un corto intervalo de tiempo.
Palabras claves: transporte marítimo, distribución de la flota, metaheurísticas, búsqueda local.
___________________________________________________________________________
Abstract
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 acceptable solutions for medium and large instances of the problem.
Key words: maritimetransportation, distribución de la flota, metaheuristics, local search.
Downloads
How to Cite
Issue
Section
License
Authors who publish with this journal agree to the following terms:a. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
b. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
c. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).