Improving Efficiency of Heuristics for the Large Scale Traveling Thief Problem

@inproceedings{Mei2014ImprovingEO,
  title={Improving Efficiency of Heuristics for the Large Scale Traveling Thief Problem},
  author={Yi Mei and Xiaodong Li and Xin Yao},
  booktitle={SEAL},
  year={2014}
}
The Traveling Thief Problem (TTP) is a novel problem that combines the well-known Traveling Salesman Problem (TSP) and Knapsack Problem (KP). In this paper, the complexity of the local-searchbased heuristics for solving TTP is analyzed, and complexity reduction strategies for TTP are proposed to speed up the heuristics. Then, a two-stage local search process with fitness approximation schemes is designed to further improve the efficiency of heuristics. Finally, an efficient Memetic Algorithm… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 19 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Similar Papers

Loading similar papers…