Tabu search for solving the black-and-white travelling salesman problem

@article{Li2016TabuSF,
  title={Tabu search for solving the black-and-white travelling salesman problem},
  author={Haitao Li and Bahram Alidaee},
  journal={Journal of the Operational Research Society},
  year={2016},
  volume={67},
  pages={1061-1079}
}
The black-and-white travelling salesman problem (BWTSP) is an extension to the well-known TSP by partitioning the set of vertices into black and white vertices, and imposing cardinality and length constraints between two consecutive black vertices in a Hamiltonian tour. BWTSP has various applications in aircraft routing, telecommunication network design and logistics. In this paper, we develop several tabu search (TS) heuristics for solving the BWTSP. Our TS is built upon a new efficient… CONTINUE READING

Citations

Publications citing this paper.

A Discrete Fruit Fly Optimization Algorithm for Traveling Salesman Problem

  • 2017 International Conference on Industrial Informatics - Computing Technology, Intelligent Technology, Industrial Information Integration (ICIICII)
  • 2017
VIEW 1 EXCERPT
CITES METHODS