Collaborative optimization under a control framework for ATSP

Authors:
Jie Bai;Jun Zhu;Gen-Ke Yang;Chang-Chun Pan
Affiliations:
Automation Department of Shanghai Jiao Tong University, Shanghai, China;Jiangsu Jun-Long Electrical Technology CO., Ltd.;Automation Department of Shanghai Jiao Tong University, Shanghai, China;Automation Department of Shanghai Jiao Tong University, Shanghai, China
Venue:
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
Year:
2011

Citing 12
Cited 0

An improved solution to the traveling salesman problem with thousands of nodes

Communications of the ACM - Special section on management of information systems
Simulated annealing: theory and applications

Simulated annealing: theory and applications
A parallel tabu search algorithm for large traveling salesman problems

Discrete Applied Mathematics
Exact solution of large-scale, asymmetric traveling salesman problems

ACM Transactions on Mathematical Software (TOMS)
A polyhedral approach to the asymmetric traveling salesman problem

Management Science
Algorithms and codes for dense assignment problems: the state of the art

Discrete Applied Mathematics
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem

Computers and Operations Research
Ant colony optimization theory: a survey

Theoretical Computer Science
A method of solving a large-scale rolling batch scheduling problem in steel production using a variant of column generation

Computers and Industrial Engineering
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
The hyper-cube framework for ant colony optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A collaborative optimization algorithm under a control framework is developed for the asymmetric traveling salesman problem (ATSP). The collaborative approach is not just a simple combination of two methods, but a deep collaboration in a manner like the feedback control. A notable feature of the approach is to make use of the collaboration to reduce the search space while maintaining the optimality. Compared with the previous work of the reduction procedure by Carpaneto, Dell'Amico et al. (1995) we designed a tighter and more generalized reduction procedure to make the collaborative method more powerful. Computational experiments on benchmark problems are given to exemplify the approach.