loading
Documents

Research.Publish.Connect.

Paper

Authors: Wenhong Tian 1 ; Chaojie Huang 2 and Xinyang Wang 2

Affiliations: 1 Chongqing Institute of Green and Intelligent Technology, Chinese Academy of Sceinces and University of Electronic Science and Technology of China, China ; 2 University of Electronic Science and Technology of China, China

ISBN: 978-989-758-218-9

Keyword(s): Symmetric Traveling Salesman Problem (STSP), Triangle Inequality, Random TSP in a Unit Square, TSPLIB Instances, Approximation Ratio, k-opt, Computational Complexity.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Mathematical Modeling ; Methodologies and Technologies ; Operational Research ; Optimization ; Stochastic Optimization ; Symbolic Systems

Abstract: The traveling salesman problem (TSP) is one of the most challenging NP-hard problems. It has widely applications in various disciplines such as physics, biology, computer science and so forth. The best known approximation algorithm for Symmetric TSP (STSP) whose cost matrix satisfies the triangle inequality (called ?STSP) is Christofides algorithm which was proposed in 1976 and is a 3/2 approximation. Since then no proved improvement is made and improving upon this bound is a funda- mental open question in combinatorial optimization. In this paper, for the first time, we propose Trun- cated Generalized Beta distribution (TGB) for the probability distribution of optimal tour lengths in a TSP. We then introduce an iterative TGB approach to obtain quality-proved near optimal approximation, i.e., (1+1/2((a+1)/(a+2))^(K-1))-approximation where K is the number of iterations in TGB and a(>> 1) is the shape parameters of TGB. The result can approach the true optimum as K increases.

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.84.139.101

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Tian, W.; Huang, C. and Wang, X. (2017). A Near Optimal Approach for Symmetric Traveling Salesman Problem in Euclidean Space.In Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-218-9, pages 281-287. DOI: 10.5220/0006125202810287

@conference{icores17,
author={Wenhong Tian. and Chaojie Huang. and Xinyang Wang.},
title={A Near Optimal Approach for Symmetric Traveling Salesman Problem in Euclidean Space},
booktitle={Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2017},
pages={281-287},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006125202810287},
isbn={978-989-758-218-9},
}

TY - CONF

JO - Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - A Near Optimal Approach for Symmetric Traveling Salesman Problem in Euclidean Space
SN - 978-989-758-218-9
AU - Tian, W.
AU - Huang, C.
AU - Wang, X.
PY - 2017
SP - 281
EP - 287
DO - 10.5220/0006125202810287

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.