Ejection chains, reference structures and alternating path methods for traveling salesman problems
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Telecommunications Optimization: Heuristic and Adaptive Computation Techniques
Telecommunications Optimization: Heuristic and Adaptive Computation Techniques
Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization
INFORMS Journal on Computing
Evolving Dynamic Multi-Objective Optimization Problems with Objective Replacement
Artificial Intelligence Review
Dynamics of Local Search Trajectory in Traveling Salesman Problem
Journal of Heuristics
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Dynamic Multi-objective Optimization Evolutionary Algorithm
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 04
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Incremental Refinement of Solutions for Dynamic Multi Objective Optimization Problems
MICAI '07 Proceedings of the 2007 Sixth Mexican International Conference on Artificial Intelligence, Special Session
GRASP and path relinking for the max-min diversity problem
Computers and Operations Research
The parallel single front genetic algorithm (PSFGA) in dynamic multi-objective optimization
IWANN'07 Proceedings of the 9th international work conference on Artificial neural networks
A parallel multi-start search algorithm for dynamic traveling salesman problem
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Seeking global edges for traveling salesman problem in multi-start search
Journal of Global Optimization
Dynamic multiobjective optimization problems: test cases, approximations, and applications
IEEE Transactions on Evolutionary Computation
A new adaptive multi-start technique for combinatorial global optimizations
Operations Research Letters
| Hi-index | 0.00 |
The travelling salesman problem TSP is one of the most intensely investigated problems in optimisation applications. This paper introduces the concept of solution attractor in local search process for TSP. A solution attractor drives the local search trajectories to converge into a small region in the solution space, which contains the most promising solutions to the problem. This paper presents a method for constructing the solution attractor of local search in TSP, and then demonstrates how to apply the attractor concept to design a search strategy to tackle a complex TSP - dynamic multi-objective TSP DMOTSP.