A HEURISTIC ALGORITHM FOR THE TRAVELLING SALESMAN PROBLEM WITH TIME-VARYING TRAVEL COSTS
- 1 October 1987
- journal article
- research article
- Published by Taylor & Francis in Engineering Optimization
- Vol. 12 (4), 325-338
- https://doi.org/10.1080/03052158708941106
Abstract
A heuristic algorithm for the travelling salesman problem with time-varying travel costs is developed in this paper. The algorithm is based on the insertion technique. Illustrative examples are solved using the algorithm. The algorithm does not demand high computation time or storage.Keywords
This publication has 5 references indexed in Scilit:
- Implementing vehicle routing algorithmsNetworks, 1977
- A Heuristic Approach to Solving Travelling Salesman ProblemsManagement Science, 1964
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963
- A Dynamic Programming Approach to Sequencing ProblemsJournal of the Society for Industrial and Applied Mathematics, 1962
- Dynamic Programming Treatment of the Travelling Salesman ProblemJournal of the ACM, 1962