A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Data structures and ejection chains for solving large-scale traveling salesman problems
2005
European Journal of Operational Research
Data structures play a crucial role in the efficient implementation of local search algorithms for problems that require circuit optimization in graphs. The traveling salesman problem (TSP) is the benchmark problem used in this study where two implementations of the stem-and-cycle (S&C) ejection chain algorithm are compared. The first implementation uses an Array data structure organized as a doubly linked list to represent TSP tours as well as the S&C reference structure. The second
doi:10.1016/j.ejor.2004.04.023
fatcat:ezf63jtqrzb7xh73vvvl5cuzmy