Um algoritmo de busca tabu para o carregamento de contêineres com caixas idênticas

Poli, Guilherme Izidoro; Pureza, Vitória

doi:10.1590/s0104-530x2012000200007

Cited by 3 publications

(1 citation statement)

References 36 publications

(30 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This growing interest is explained by the need for integrated view of supply chain management. In addition, research and analysis of the logistics chain techniques are more mature, allowing a more detailed analysis and even taking into account a larger number of variables related to key issues of supply chains, such as cost, speed and price (Poli & Pureza, 2012). Consequently, Operations Research (OR) techniques are being increasingly used for supply chain management (Melo et al, 2009).…”

Section: Introductionmentioning

confidence: 99%

Otimização da rede de uma cadeia de suprimentos com a utilização de uma heurística baseada em Busca Tabu

2016

View full text Add to dashboard Cite

Resumo: Este artigo discute a implementação e avaliação de uma heurística baseada em Busca Tabu para otimizar uma rede de cadeia de suprimentos. Para tanto, o modelo single-source proposto por Farias & Borenstein (2012) foi implementado. O problema foi resolvido por uma adaptação do método de Lee & Kwon (2010), substituindo centros de distribuição (CDs) e arcos a fim de encontrar o menor custo para uma rede de cadeia de suprimentos. Foram resolvidas as 22 instâncias propostas por Farias & Borenstein (2012) e os resultados indicam que, para esses cenários, o método aplicado teve um bom desempenho computacional, obtendo resultados com uma redução de 81,03% no tempo médio de processamento. Contudo, houve um aumento de 4,98% no custo médio das soluções obtido pelo método heurístico quando comparado com os resultados ótimos. Por fim, o problema foi resolvido para outras quatro instâncias com características reais, comprovando a eficiência da heurística para problemas de grande escala, visto que todas as soluções foram obtidas em menos de 2 minutos de processamento.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.

show abstract

Section: Introductionmentioning

confidence: 99%

Otimização da rede de uma cadeia de suprimentos com a utilização de uma heurística baseada em Busca Tabu

2016

View full text Add to dashboard Cite

show abstract

Automated System for the Container Loading Problem Integrating Linear Programming and Automated Planning

Cardoso

Ferreira

Sousa

et al. 2015

2015 12th Latin American Robotics Symposium and 2015 3rd Brazilian Symposium on Robotics (LARS-SBR)

View full text Add to dashboard Cite

Contribuição ao estudo de planejamento automático aplicado a sistema de movimentação de materiais

Cardoso¹

View full text Add to dashboard Cite

In the transporting of loads, the container loading problems have had much repercussion among logistical studies. It can be proved that through using such device there is a reduction on losses, theft, damaging of goods and general costs. The loading problems are typical optimization problems whose objective is maximizing the used volume or minimize the costs parameters. On the other hand, automated planning research, a sub area of artificial intelligence, intends to assist the industrial processes for systematically specifying a set of actions that allows achieving a predefined goal. In this paradigm the industrial plant is modeled with a series of diagrams respecting the UML standard, for obtaining the problem domain and the initial and final states. It is noteworthy that in the actions specifying process a metric can be added for minimizing purposes, but according to each automated planners characteristics the insertion of such metrics is relatively bounded. In an attempt to accrete both areas of knowledge, it is intended to use one of the widely studied techniques available in the loading problem literature, in particular the linear programming for modeling and the Simplex method for solving, in a way to obtain a specific final state to be utilized in the automated planning solving process. The main proposal of this integration is to create a fully automated system, capable of carrying out the entire loading process through the information referred to the products, to the industrial plant and the transporting devices.

show abstract

Um algoritmo de busca tabu para o carregamento de contêineres com caixas idênticas

Cited by 3 publications

References 36 publications

Otimização da rede de uma cadeia de suprimentos com a utilização de uma heurística baseada em Busca Tabu

Otimização da rede de uma cadeia de suprimentos com a utilização de uma heurística baseada em Busca Tabu

Automated System for the Container Loading Problem Integrating Linear Programming and Automated Planning

Contribuição ao estudo de planejamento automático aplicado a sistema de movimentação de materiais

Contact Info

Product

Resources

About