Modelagem e otimizaÃÃo do problema do caixeiro viajante com restriÃÃes de tempo, distÃncia e confiabilidade via algoritmos genÃticos

AUTOR(ES)

Edgar Augusto Silva Braga

DATA DE PUBLICAÇÃO

2007

RESUMO

In this work, we propose a methodology based on the Travelling Salesman Problem, to model logistic problems. The objective of this work, in particular, is to make the Prize-Collecting Travelling Salesman Problem more coherent with the reality of the logistic context, taking into account the operational capacity of the organization and market constraints. For that purpose, new elements are introduced to the problem, such as the reliability of the salesman and time constraints to perform the path. Thus, the model consists of maximizing the profit obtained through prize-collection and the associated path cost, with constraints of maximum-time and minimum reliability level of the salesman accepted at the end of the path. This new approach is modeled and solved by Genetic Algorithms and is illustrated through a case study

ASSUNTO(S)

engenharia de producao confiabilidade travelling salesman problem logistic problema do caixeiro viajante algoritmos genÃticos genetic algorithms logÃstica reliability

Documentos Relacionados

• OtimizaÃÃo da geometria de aglomerados de silÃcio via algoritmos genÃticos hÃbridos.
• Uso dos algoritmos genÃticos para a otimizaÃÃo de rotas de distribuiÃÃo
• RealimentaÃÃo de relevÃncia via algoritmos genÃticos aplicada à recuperaÃÃo de imagens
• AplicaÃÃo da teoria das restriÃÃes para otimizaÃÃo dos sistemas de produÃÃo em uma empresa do setor quÃmico
• Modelagem e anÃlise de especificaÃÃes de sistemas de tempo-real crÃticos com restriÃÃes de energia