Skip to main content
SpringerLink
Log in

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

  • General Paper
  • Published:
Journal of the Operational Research Society

Abstract

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 neighbourhood structure, which exploits both the permutation and knapsack features of BWTSP. We also embed our TS as a heuristic procedure to improve the upper bound in a mixed-integer linear programming method. Extensive computational experiment on both benchmark and randomly generated instances shows effectiveness and efficiency of our algorithms. Our algorithms are able to obtain optimal and near optimal solutions to small instances in seconds, and find feasible solutions to large instances that have not been solved by the existing methods in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10

Similar content being viewed by others

References

  • Aarts E and Lenstra JK (2003). Local Search in Combinatorial Optimization. Princeton University Press: Princeton.

    Google Scholar 

  • Boland N, Clarke LW and Nemhauser GL (2000). The asymmetric traveling salesman problem with replenishment arcs. European Journal of Operational Research 123(2): 408–427.

    Article  Google Scholar 

  • Bourgeois M, Laporte G and Semet F (2003). Heuristics for the black and white traveling salesman problem. Computers & Operations Research 30(1): 75–85.

    Article  Google Scholar 

  • Cosares S, Deutsch DN, Saniee I and Wasem OJ (1995). SONET toolkit: A decision support system for designing robust and cost-effective fiber-optic networks. Interfaces 25(1): 20–40.

    Article  Google Scholar 

  • Desrochers M and Laporte G (1991). Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints. Operations Research Letters 10(1): 27–36.

    Article  Google Scholar 

  • Gendreau M, Hertz A and Laporte G (1992). New insertion and postoptimization procedures for the travelling salesman problem. Operations Research 40(6): 1086–1094.

    Article  Google Scholar 

  • Ghiani G, Laporte G and Semet F (2006). The black and white traveling salesman problem. Operations Research 54(2): 366–378.

    Article  Google Scholar 

  • Glover F (1989). Tabu search—Part I. ORSA Journal on Computing 1(3): 190–206.

    Article  Google Scholar 

  • Glover F (1990). Tabu search—Part II. ORSA Journal on Computing 2(1): 4–32.

    Article  Google Scholar 

  • Glover F and Kochenberger G (2005). Handbook of Metaheuristics. Springer: Dordrecht.

    Google Scholar 

  • Glover F and Laguna M (1997). Tabu Search. Kluwer Academic Publishers: Boston.

    Book  Google Scholar 

  • Gendreau M, Hertz A and Laporte G (1994). A Tabu search heuristic for the vehicle routing problem. Management Science 40(10): 1276–1290.

    Article  Google Scholar 

  • Hertz A, Laporte G and Mittaz M (2000). A Tabu search heuristic for the capacitated arc routing problem. Operations Research 48(1): 129–135.

    Article  Google Scholar 

  • Jiang H, Zhang XY, Li M and Che H (2007). Using Gavish-Grave(s) LP to formulate the directed black and white traveling salesman problem. In: Jiang H, Zhang X, Li M and Che H (eds).. Lecture Notes in Computer Science. pp 293–298.

  • Laporte G and Pascoal M (2011). Minimum cost path problems with relays. Computers & Operations Research 38(1): 165–173.

    Article  Google Scholar 

  • Mak V and Boland N (2000). Heuristics approaches to the asymmetric travelling salesman problem with replenishment arcs. International Transactions in Operational Research 7(4–5): 431–447.

    Article  Google Scholar 

  • Mak V and Boland N (2007). Polyhedral results and exact algorithms for the asymmetric. Discrete Applied Mathematics 155(16): 2093–2110.

    Article  Google Scholar 

  • Oncan T, Altinel IK and Laporte G (2009). A comparative analysis of several asymmetric traveling salesman problem formulations. Computers & Operations Research 36(3): 637–654.

    Article  Google Scholar 

  • Taillard VE, Badeau P, Gendreau M, Guertin F and Potvin J-Y (1997). A Tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31(2): 170–186.

    Article  Google Scholar 

  • Talluri KT (1998). The four-day aircraft maintenance routing problem. Transportation Science 32(1): 43–53.

    Article  Google Scholar 

  • Wasem OJ (1991). An algorithm for designing rings in survivable fiber networks. IEEE Transactions on Reliability 40(4): 428–432.

    Article  Google Scholar 

Download references

Acknowledgements

Haitao Li's research is supported by the Thousand Talents Program of China. The authors also thank two anonymous referees for their valuable comments that help improve the contents and presentation of this paper.

Author information

Authors and Affiliations

  1. Tianjin University of Commerce, Tianjin, China

    Haitao Li

  2. University of Missouri, St. Louis, USA

    Haitao Li

  3. University of Mississippi, Oxford, USA

    Bahram Alidaee

Authors
  1. Haitao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bahram Alidaee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Haitao Li.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, H., Alidaee, B. Tabu search for solving the black-and-white travelling salesman problem. J Oper Res Soc 67, 1061–1079 (2016). https://doi.org/10.1057/jors.2015.122

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.2015.122

Keywords

Search

Navigation