Tabu search performance on the symmetric traveling salesman problem
Computers and Operations Research - Special issue: heuristic, genetic and tabu search
A polyhedral approach to the asymmetric traveling salesman problem
Management Science
P-Complete Approximation Problems
Journal of the ACM (JACM)
On the Convergence of Tabu Search
Journal of Heuristics
Performance of Various Computers Using Standard Linear Equations Software
Performance of Various Computers Using Standard Linear Equations Software
A new hybrid heuristic approach for solving large traveling salesman problem
Information Sciences—Informatics and Computer Science: An International Journal
Enhancing Stochastic Search Performance by Value-Biased Randomization of Heuristics
Journal of Heuristics
Non-wrapping order crossover: an order preserving crossover operator that respects absolute position
Proceedings of the 8th annual conference on Genetic and evolutionary computation
An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
Computers and Operations Research
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
Parallel hybrid metaheuristics for the flexible job shop problem
Computers and Industrial Engineering
| Hi-index | 0.00 |
In this paper we consider two routing problems: traveling salesman problem (TSP, fundamental problem of the combinatorial optimization) and the TSP with times of traveling, times of processing and due dates where the objective is to minimize the total weighted tardiness (TSPTWT). Since problems are NP-hard in the strong sense, we propose a metaheuristic algorithm to determine a good sub-optimal solution. We present an algorithm based on the idea of researching and analyzing local optima. TSP with times of traveling, times of processing and due dates, and with the total weighted tardiness cost function is identical with the single machine total weighted tardiness problem with sequence-dependent setup times. It was possible to find the new best known solutions for 81 of 120 benchmark instances of this scheduling problem using the method proposed here.