New insertion and postoptimization procedures for the traveling salesman problem
Operations Research
A multiperiod traveling salesman problem: heuristic algorithms
Computers and Operations Research
A new heuristic for the period traveling salesman problem
Computers and Operations Research
Algorithms and solutions to multi-level vehicle routing problems
Algorithms and solutions to multi-level vehicle routing problems
An improved heuristic for the period traveling salesman problem
Computers and Operations Research
A heuristic for the periodic rural postman problem
Computers and Operations Research
Computers and Operations Research
Charlemagne's Challenge: The Periodic Latency Problem
Operations Research
Nested simulated annealing approach to periodic routing problem of a retail distribution system
Computers and Operations Research
A set-covering based heuristic algorithm for the periodic vehicle routing problem
Discrete Applied Mathematics
| Hi-index | 0.01 |
A new, simple and effective heuristic algorithm has been developed for the period traveling salesman problem. Computational results obtained from the test problems taken from the literature indicate that the algorithm compares well in terms of accuracy with other existing algorithms, finding a larger number of best solutions. Moreover, its average percentage error and its worst ratio of solution to the best-known solution are smaller than those of the other existing algorithms.