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
Tabu Search
Telecommunications Optimization: Heuristic and Adaptive Computation Techniques
Telecommunications Optimization: Heuristic and Adaptive Computation Techniques
Evolutionary Optimization in Dynamic Environments
Evolutionary Optimization in Dynamic Environments
Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Applying Population Based ACO to Dynamic Optimization Problems
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization
INFORMS Journal on Computing
Evolutionary Computation in Dynamic and Uncertain Environments (Studies in Computational Intelligence)
A self-organizing random immigrants genetic algorithm for dynamic optimization problems
Genetic Programming and Evolvable Machines
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Genetic algorithms with memory-and elitism-based immigrants in dynamic environments
Evolutionary Computation
GRASP and path relinking for the max-min diversity problem
Computers and Operations Research
Seeking global edges for traveling salesman problem in multi-start search
Journal of Global Optimization
A new approach to solving dynamic traveling salesman problems
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
IEEE Transactions on Evolutionary Computation
A hybrid discrete particle swarm optimization with pheromone for dynamic traveling salesman problem
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
International Journal of Metaheuristics
| Hi-index | 0.00 |
This paper introduces a multi-start search approach to dynamic traveling salesman problem (DTSP). Our experimental problem is stochastic and dynamic. Our search algorithm is dynamic because it explicitly incorporates the interaction of change and search over time. The result of our experiment demonstrates the effectiveness and efficiency of the algorithm. When we use a matrix to construct the solution attractor from the set of local optima generated by the multi-start search, the attractor-based search can provide even better result.