Supply chain network optimization using a Tabu Search based heuristic [Otimização da rede de uma cadeia de suprimentos com a utilização de uma heurística baseada em Busca Tabu]

Abstract

This paper discusses the implementation and evaluation of a heuristic based on Tabu Search to optimize a supply chain network. To this end, a single-source model proposed by Farias & Borenstein (2012) was implemented. The problem was solved by adapting the Lee & Kwon method (2010), exchanging distribution centers (DCs) and arcs to find the lowest cost for a supply chain network. Twenty-two instances proposed by Farias & Borenstein (2012) were solved and the results indicate that, for the scenarios, the method applied presented good computational performance, obtaining results with 81.03% reduction of the average processing time. However, there was an increase of 4.98% in the average cost of the solutions obtained through the heuristic method when compared with the optimal results. Finally, the problem was solved for four other instances with real features, proving the efficiency of this heuristic for large-scale problems, considering that all solutions were obtained in less than 2 minutes of processing.