Towards practical `neural' computation for combinatorial optimization problems
AIP Conference Proceedings 151 on Neural Networks for Computing
Component allocation and partitioning for a dual delivery placement machine
Operations Research
Sequencing of insertions in printed circuit board assembly
Operations Research
Local optimization and the traveling salesman problem
Proceedings of the seventeenth international colloquium on Automata, languages and programming
K-d trees for semidynamic point sets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
A tabu search approach to optimization of drilling operations
CIE '96 Proceedings of the 19th international conference on Computers and industrial engineering
Computers and Operations Research
Simulation and analysis of a circuit board manufacturing facility
WSC '86 Proceedings of the 18th conference on Winter simulation
Dynamic Programming Treatment of the Travelling Salesman Problem
Journal of the ACM (JACM)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved Large-Step Markov Chain Variants for the Symmetric TSP
Journal of Heuristics
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Finding Cuts in the TSP (A preliminary report)
Finding Cuts in the TSP (A preliminary report)
New Models and Heuristics for Component Placement in Printed Circuit Board Assembly
ICIIS '99 Proceedings of the 1999 International Conference on Information Intelligence and Systems
A model induced max-min ant colony optimization for asymmetric traveling salesman problem
Applied Soft Computing
Hi-index | 0.01 |
This paper presents a new class of heuristics which embed an exact algorithm within the framework of a local search heuristic. This approach was inspired by related heuristics which we developed for a practical problem arising in electronics manufacture. The basic idea of this heuristic is to break the original problem into small subproblems having similar properties to the original problem. These subproblems are then solved using time intensive heuristic approaches or exact algorithms and the solution is re-embedded into the original problem. The electronics manufacturing problem where we originally used the embedded local search approach, contains the Travelling Salesman Problem (TSP) as a major subproblem. In this paper we further develop our embedded search heuristic, HyperOpt, and investigate its performance for the TSP in comparison to other local search based approaches. We introduce an interesting hybrid of HyperOpt and 3-opt for asymmetric TSPs which proves more efficient than HyperOpt or 3-opt alone. Since pure local search seldom yields solutions of high quality we also investigate the performance of the approaches in an iterated local search framework. We examine iterated approaches of Large-Step Markov Chain and Variable Neighbourhood Search type and investigate their performance when used in combination with HyperOpt. We report extensive computational results to investigate the performance of our heuristic approaches for asymmetric and Euclidean Travelling Salesman Problems. While for the symmetric TSP our approaches yield solutions of comparable quality to 2-opt heuristic, the hybrid methods proposed for asymmetric problems seem capable of compensating for the time intensive embedded heuristic by finding tours of better average quality than iterated 3-opt in many less iterations and providing the best heuristic solutions known, for some instance classes.