Solution of large-scale symmetric travelling salesman problems
Mathematical Programming: Series A and B
Dynamic Programming Treatment of the Travelling Salesman Problem
Journal of the ACM (JACM)
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
Artificial Intelligence Review
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
A Parallel Hybrid Heuristic for the TSP
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Genetic Algorithms for the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator
Proceedings of the 3rd International Conference on Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
On Solving Travelling Salesman Problems by Genetic Algorithms
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Solving the Traveling Salesman Problem Using the Enhanced Genetic Algorithm
AI '01 Proceedings of the 14th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
Computers and Operations Research
The application of tabu search to the symmetric traveling salesman problem
The application of tabu search to the symmetric traveling salesman problem
An efficient simulated annealing schedule
An efficient simulated annealing schedule
New Operators of Genetic Algorithms for Traveling Salesman Problem
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Some issues of designing genetic algorithms for traveling salesman problems
Soft Computing - A Fusion of Foundations, Methodologies and Applications
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Robust Traveling Salesman Problem with Interval Data
Transportation Science
Implementation of an Effective Hybrid GA for Large-Scale Traveling Salesman Problems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An annealing framework with learning memory
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
Operations Research Letters
Journal of Mathematical Modelling and Algorithms
Genetic interval neural networks for granular data regression
Information Sciences: an International Journal
| Hi-index | 7.29 |
This paper presents a variant of the asymmetric traveling salesman problem (ATSP) in which the traveling time between each pair of cities is represented by an interval of values (wherein the actual travel time is expected to lie) instead of a fixed (deterministic) value as in the classical ATSP. Here the ATSP (with interval objective) is formulated using the usual interval arithmetic. To solve the interval ATSP (I-ATSP), a genetic algorithm with interval valued fitness function is proposed. For this purpose, the existing revised definition of order relations between interval numbers for the case of pessimistic decision making is used. The proposed algorithm is based on a previously published work and includes some new features of the basic genetic operators. To analyze the performance and effectiveness of the proposed algorithm and different genetic operators, computational studies of the proposed algorithm on some randomly generated test problems are reported.