Ayuda
Ir al contenido

Dialnet


Application of AHP for Traveling Salesman Problem

  • Autores: Sunarin Chanta, Ornurai Sangsawang
  • Localización: International journal of the computer, the internet and management, ISSN 0858-7027, Vol. 13, Nº. 2 (OCT), 2005 (Ejemplar dedicado a: Suplemento 2: eIndustry 2005. Proceedings of the International Conference on Computer and Industrial Management), págs. 16-16
  • Idioma: inglés
  • Texto completo no disponible (Saber más ...)
  • Resumen
    • The objective of this research is to determine the best route for recording volume usage of water supply. Mathematical Approach applied in traveling salesman problem is developed to solving this problem. In order to investigate the best route, we must consider both quantitative and qualitative factors influencing route selection. Branch and Bound method, the Nearest Neighbor Heuristic, Cheapest Insertion Heuristic, and Two-Way Exchange Improvement Heuristic are selected to minimize total distance. The Analytic Hierarchy Process is applied for quantitative and qualitative factors evaluation in a systematic criterion. The presented methodology can provide managers with a more effective and efficient method for making route recording decisions in a real-world.


Fundación Dialnet

Dialnet Plus

  • Más información sobre Dialnet Plus

Opciones de compartir

Opciones de entorno