Guided local search and its application to the traveling salesman problem

Article Abstract:

A study was conducted to analyze how Guided Local Search (GLS) and Fast Local Search (FLS) techniques can be utilized in the traveling salesman problem (TSP). The classic symmetric version of TSP was used. Eight combinations of the GLS with TSP heuristics were carried out and evaluated. Results indicated that GLS can be integrated with the neighborhood reduction scheme of FLS to promote a faster operations of algorithms.

Operations Research, Combinatorial optimization

---

Estimating the Held-Karp lower bound for the geometric TSP

Article Abstract:

A study presents two iterative approaches of estimating Held-Karp lower bound for the geometric travelling salesman problem. The approaches use subgraph speed-up technique with an arbitrary sequence length of 300 iterations for a given test number of city problem. Results reveal that sequence lengths of about 100-300 are enough to estimate HK lower bound for TSP problems with 100-10,000 cities.

Management Theory & Techniques, Methods, Iterative methods (Mathematics), Iteration (Mathematics), Management, Relaxation methods (Mathematics)

---

Similar abstracts:

• Abstracts: Variable neighborhood tabu search and its application to the median cycle problem. Relaxation of the Condorcet and Simpson conditions in voting location
• Abstracts: Computational experience with approximation algorithms for the set covering problem. Endurance in speed skating: the development of world records
• Abstracts: Approximate portfolio analysis. Huber approximation for the non-linear l(sub 1) problem. Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s)
• Abstracts: IJmuiden to join auction network. Fishermen guide plotter updates. Lake eel business keeps growing
• Abstracts: Achieving team leverage and work/life balance. Strategies for selling performance management. BPO requires up-front effort

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.