The traveling salesman problem: a deterministic algorithm using tabu search
保存先:
| 著者: | , , |
|---|---|
| フォーマット: | artículo original |
| 状態: | Versión publicada |
| 出版日付: | 2014 |
| その他の書誌記述: | We implement an algorithm corresponding to the Taboo Search method, called EraDeterministic, experimenting with the basic algorithm that ex- plores the search space and incorporating the diversification as strategy to explore new regions. The algorithm is developed in the programming environment Visual Basic 6.0 and the implementation is aimed at finding close solutions to the optimum of the problem NP−complete of the Sym- metric Traveling Salesman (STS). To test the functionality, the model is compared with some instances of the Travel Salesman Problem Library (TSPLIB), some random instances and applied to three real-life situations. Finally, we present a section with comments and conclusions, that guide us on possible future developments that demonstrate the benefits and the efficiency of the implementation. |
| 国: | Portal de Revistas UCR |
| 機関: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| 言語: | Español |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/14142 |
| オンライン･アクセス: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/14142 |
| キーワード: | tabu search deterministic algorithm frequencies matrix diversification permutation traveling salesman problem búsqueda tabú algoritmo determinístico matriz de frecuencias diversificación problema del agente viajero |