Optimizing the Greedy Algorithm Used in the TSP Abstract Problems

Hang Yu; Kai Zhang

doi:10.4028/www.scientific.net/AMM.651-653.2352

Paper Titles

Measured Scan Data Reduction Combination Algorithm Based on Scan Line
p.2335

New Criterion for Stability of Linear Systems with Interval Time-Varying Delay
p.2339

New OFDM Channel Estimation Method Based on ISI Cancellation
p.2343

Numerical Simulation of the Basketball Flight Trajectory Based on FLUENT Fluid Solid Coupling Mechanics
p.2347

Optimizing the Greedy Algorithm Used in the TSP Abstract Problems
p.2352

Paper Currency CIS Image Fuzzy Enhancement and Boundary Detection
p.2356

Parallel Filtering Algorithm in Three Dimensions for IMM Maneuvering Target Tracking
p.2362

Research of Speech Enhancement Based on Adaptive Noise Cancellation Methods
p.2368

Research on Infrared Imaging Modeling and Simulation of Armored Vehicles
p.2372

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 651-653Optimizing the Greedy Algorithm Used in the TSP...

Optimizing the Greedy Algorithm Used in the TSP Abstract Problems

Abstract:

TSP problem is a class of classical problems in the combinatorial optimization problem; it has important applications in gene sequencing, robot control and other areas, especially in the computer domain, applied more widely. This paper considers abstracting the problem of stitching and reduction for scraps of paper as a class of TSP problem, and use the optimized greedy algorithm, achieve automatic image stitching shredding by the use of computer graphics technology. Contents of this paper make a useful attempt to study the automatic stitching algorithm for scraps of paper.

You might also be interested in these eBooks

Material Science, Civil Engineering and Architecture Science, Mechanical Engineering and Manufacturing Technology II

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 651-653)

Pages:

2352-2355

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.651-653.2352

Citation:

Cite this paper

Online since:

September 2014

Authors:

Hang Yu*, Kai Zhang

Keywords:

Greedy Algorithm, Image Processing, Paper Splicing, TSP

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] WANG Jian-wen, DAI Guang-ming, XIE Bai-qiao, ZHANG Quan-yuan. A Survey of Solving the Traveling Salesman Problem [J]. Computer Engineering & Science, 2008, 30(2): 72-74.

Google Scholar

[2] XU Zhi-cong. The Research of TSP Problem and Solution [J]. Popular Science & Technology, 2008(10): 50-51.

Google Scholar

[3] LIU Xin, LIU Ren-ren, HOU Jing-chuan. Whole-priority algorithm for traveling salesman problem[J]. Journal of Computer Applications, 2007, 27(5): 1024-1027.

Google Scholar

[4] ZOU Peng, ZHOU Zhi, CHEN Guo-Liang, GU Jun. A Multilevel Reduction Algorithm to TSP [J]. Journal of Software, 2003, 14(1): 35-41.

Google Scholar

[5] HU Xiao-hui, LI Xiao-yang, CHEN Jun-lian. Hybrid Genetic Algorithm Based on Strategy of Greedy for TSP[J]. Journal of Lanzhou Jiaotong University, 2009, 28(3): 58-61.

Google Scholar

[6] YU Hui, HOU Zai ke, HE Xu li, et al. DESIGN OF FEATURE-BASED IMAGE MOSAICING ALGORITHM [J]. Journal of the University of Petroleum, China( Edition of Natural Science), 2003, 27(2): 114-118.

Google Scholar

[7] HOU Shuwei, GUO Baolong. A Fast Automatic Image Stitching Algorithm [J]. Computer Engineering, 2005, 31(15): 70-72.

Google Scholar

[8] JIA Hai-yan, ZHU Liang-jia, ZHOU Zong-tan, HU De-wen. A Shape Matching Method for Automatic Reassembly of Paper Fragments [J]. Computer Simulation, 2006, 23(11): 180-183.

Google Scholar