Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Relaxed tours and path ejections for the traveling salesman problem

Article Abstract:

Two new local search algorithms based on an ejection chain method are proposed to solve the traveling salesman problem (TSP). The algorithmic variants namely, preliminary and full subpath ejection chain methods, are guided by a simple tabu search mechanism. Computational results reveal that both algorithmic variants find optimal and near-optimal solutions faster than the best heuristic procedures used in solving TSP.

Author: Rego, Cesar
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Technical note on the paper "An empirical study of a new metaheuristic for the traveling salesman problem" (by Shigeru Tsubakitani, James R. Evans, European Journal of Operational Research 104.(1998) 113-128)

Article Abstract:

Issues are presented concerning the primitive concepts and oversights in the "jump search" heuristic presented by S. Tsubakitani and J.R. Evans in their research paper entitled "An empirical study of a new metaheuristic for the traveling salesman problem".

Author: Rego, Cesar
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2001
Criticism and interpretation

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Data structures and ejection chains for solving large-scale traveling salesman problems

Article Abstract:

A study is done to make a new data structure to solve traveling sales man problem by improving the efficiency of the stem-and-cycle algorithm. The results indicate an improvement in the two level tree data structure.

Author: Rego, Cesar, Glover, Fred, Gamboa, Dorabela
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
United States, Science & research, Portugal, Research, Methods, Analysis, Branch and bound algorithms, Data structures

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Operations research, Management science, Models, Traveling-salesman problem
Similar abstracts:
  • Abstracts: Piecewise affine approximations for the control of a one-reservoir hydroelectric system. Heuristics for determining economic processing rates in a flexible manufacturing system
  • Abstracts: Mutual attraction. Behind the scenes. Les Creas 2006
  • Abstracts: Smarter soft kill. Boosting the staying power of the non-nuclear submarine. Integration is the key to electronic warfare at sea
  • Abstracts: Alan Greenspan's worried signals. Alan Greenspan and the embrace of the duchesses. Alan Grenspan, fiscal fiddler
  • Abstracts: Go forth and multiply. Bombs with long fuses. Bombe surprise
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.