IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v6y2015i1p35-46.html
   My bibliography  Save this article

An Approximate Algorithm for Triangle TSP with a Four-Vertex-Three-Line Inequality

Author

Listed:
  • Yong Wang

    (School of Renewable Energy, North China Electric University, Beijing, China)

Abstract

Traveling salesman problem (TSP) is a classic combinatorial optimization problem. The time complexity of the exact algorithms is generally an exponential function of the scale of TSP. This work gives an approximate algorithm with a four-vertex-three-line inequality for the triangle TSP. The time complexity is O(n2) and it can generate an approximation less than 2 times of the optimal solution. The paper designs a simple algorithm with the inequality. The algorithm is compared with the double-nearest neighbor algorithm. The experimental results illustrate the algorithm find the better approximations than the double-nearest neighbor algorithm for most TSP instances.

Suggested Citation

  • Yong Wang, 2015. "An Approximate Algorithm for Triangle TSP with a Four-Vertex-Three-Line Inequality," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 6(1), pages 35-46, January.
    • Handle: RePEc:igg:jamc00:v:6:y:2015:i:1:p:35-46
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2015010103
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yajun Yang & Zhongfei Li & Xin Wang & Qinghua Hu, 2019. "Finding the Shortest Path with Vertex Constraint over Large Graphs," Complexity, Hindawi, vol. 2019, pages 1-13, February.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jamc00:v:6:y:2015:i:1:p:35-46. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.