The Strip Algorithm (SA) is a constructive heuristic which has been tried on the Euclidean Travelling Salesman Problem (TSP) and other planar network problems with some success. Its attraction is its efficiency. In its simplest form, it can find tours of length Ω(n) in (Formula presented) operations where n is the number of nodes. Here, we set out to investigate new variants such as the 2-Part Strip Algorithm (2-PSA), the Spiral Strip Algorithm (SSA) and the Adaptive Strip Algorithm (ASA). The latter is particularly suited for Euclidean TSPs with non-uniform distribution of cities across the grid; i.e problems with clustered cities. These cases present an overall low density, but high localised densities. ASA takes this into account in that smaller strips are generated where the density is high. All three algorithms are analysed, implemented and computationally tested against each other and the Classical Strip Algorithm. Computational results are included.
CITATION STYLE
Selamoğlu, B. İ., Salhi, A., & Sulaiman, M. (2018). Strip algorithms as an efficient way to initialise population-based metaheuristics. In Operations Research/ Computer Science Interfaces Series (Vol. 62, pp. 319–331). Springer New York LLC. https://doi.org/10.1007/978-3-319-58253-5_18
Mendeley helps you to discover research relevant for your work.