Solution to the traveling salesman problem using heuristic function maximization
Journal of Guidance Control and Dynamics1988Vol. 11(5), pp. 430–435
Citations Over Time
Abstract
An approach for solving the traveling salesman problem as formulated in the AIAA Artificial Intelligence Design Challenge is presented. The approach is based on heuristic measures involving intercity fares, city values, and value-to-fare ratios. Other heuristic factors take into account the available budget, the expected trip cost, and the likelihood of low-cost hub cities. Monte Carlo simulations show that this heuristic method produces optimal solutions over 90% of the time for problems dominated by fare, and 55% (84% in a revised program) of the time for problems not dominated by fare or value.
Related Papers
- → The Solutions to Traveling Salesman Problem(2023)2 cited
- Dynasearch Algorithms for Solving Time Dependent Traveling Salesman Problem(2008)
- → A Natural Approach to Solving the Traveling Salesman Problem(2023)1 cited
- Computation and Simulation Analysis of a Kind of Multiple Traveling Salesman problem(2009)
- Real-Life Traveling-Salesman Problem(2005)