Loading...
Please wait, while we are loading the content...
Similar Documents
Modelagem e otimização do problema do caixeiro viajante com restrições de tempo, distância e confiabilidade via algoritmos genéticos
| Content Provider | Semantic Scholar |
|---|---|
| Author | Braga, Edgar Augusto Silva |
| Copyright Year | 2007 |
| Abstract | 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 PrizeCollecting 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. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://repositorio.ufpe.br/bitstream/123456789/5672/1/arquivo7291_1.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
