An optical technique for detecting fatigue cracks in aerospace structures

Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search

“…As is well known, the TSP belongs to a family of NP-complete problems [27] whose computational complexity rises exponentially by increasing the number of cities. For many current TSP applications such as data association, vehicle routing [21,30], data transmission in computer networks [25], scheduling, drilling of printed circuits boards [26], analysis of the structure of crystals, clustering of data arrays, assignment of routes for planes of a specified fleet, image processing and pattern recognition [2], and transportation and logistics, finding suboptimal solutions with a reasonable cost may be more advantageous, and therefore the great interest in efficient heuristics to solve the TSP.…”

A new Hybrid Discrete Bat Algorithm for Traveling Salesman Problem using ordered crossover and 3-Opt operators for Bat's local search

“…It has been an active area of research for decades. However, several issues still need to be addressed, especially, with the rise of several real world application of the TSP such as vehicle routing [1], [2], scheduling, image processing and pattern recognition [3].…”

An Improved Particle Swarm Optimization Algorithm for Traveling Salesman Problems

“…Besides, there are many practical applications of the TSP in the real world [22,23], such as data association, vehicle routing (with the additional constraints of vehicle's route, such as capacity's vehicles), data transmission in computer networks, job scheduling, DNA sequencing, drilling of printed circuits boards, clustering of data arrays, image processing and pattern recognition, analysis of the structure of crystals, transportation and logistics.…”