SCIENCE CHINA Information Sciences, Volume 64 , Issue 5 : 150101(2021) https://doi.org/10.1007/s11432-020-3115-5

Focal distance tabu search

More info
  • ReceivedMay 10, 2020
  • AcceptedAug 4, 2020
  • PublishedApr 12, 2021



We are grateful to the anonymous reviewers for their valuable comments which helped us to improve the paper.


[1] Lucas A. Ising formulations of many NP problems. Front Phys, 2014, 2: 5 CrossRef ADS arXiv Google Scholar

[2] Kochenberger G, Hao J K, Glover F. The unconstrained binary quadratic programming problem: a survey. J Comb Optim, 2014, 28: 58-81 CrossRef Google Scholar

[3] Glover F, Kochenberger G, Du Y. Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models. 4OR-Q J Oper Res, 2019, 17: 335-371 CrossRef Google Scholar

[4] Vyskocil T, Pakin S, Djidjev H N. Embedding inequality constraints for quantum annealling optimization. In: Quantum Technology and Optimization Problems. Cham: Springer, 2019. 11413. Google Scholar

[5] Glover F. Future paths for integer programming and links to artificial intelligence. Comput Operations Res, 1986, 13: 533-549 CrossRef Google Scholar

[6] Glover F. HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS. Decision Sci, 1977, 8: 156-166 CrossRef Google Scholar

[7] Dueck G, Scheuer T. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys, 1990, 90: 161-175 CrossRef Google Scholar

[8] Osman I H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res, 1993, 41: 421-451 CrossRef Google Scholar

[9] Dueck G. New Optimization Heuristics. The Great Deluge Algorithm and the Record-to-Record Travel. J Comput Phys, 1993, 104: 86-92 CrossRef ADS Google Scholar

[10] Glover F. Tabu Thresholding: Improved Search by Nonmonotonic Trajectories. ORSA J Computing, 1995, 7: 426-442 CrossRef Google Scholar

[11] Glover F, Kochenberger G A. Critical Event Tabu Search for Multidimensional Knapsack Problems. In: Meta-Heuristics: Theory & Applications, Boston: Springer. 1996. 407--427. Google Scholar

[12] Battiti R, Tecchiolli G. The Reactive Tabu Search. ORSA J Computing, 1994, 6: 126-140 CrossRef Google Scholar

[13] Kelly J P, Laguna M, Glover F. A study of diversification strategies for the quadratic assignment problem. Comput Operations Res, 1994, 21: 885-893 CrossRef Google Scholar

[14] Woodruff D L, Zemel E. Hashing vectors for tabu search. Ann Oper Res, 1993, 41: 123-137 CrossRef Google Scholar

[15] Glover F, Kochenberger G, Alidaee B, et al. Tabu Search with Critical Event Memory: An Enhanced Application for Binary Quadratic Programs. In: Meta-Heuristics. Boston: Springer, 1998. 83--109. Google Scholar

[16] Lourenço H R, Martin O C, Stüzle T. Iterated local search: framework and applications. In: Handbook of Metaheuristics. Boston: Springer 363--397. Google Scholar

[17] Coelho V N, Grasas A, Ramalhinho H. An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints. Eur J Operational Res, 2016, 250: 367-376 CrossRef Google Scholar

[18] Benlic U, Hao J K. Breakout local search for the quadratic assignment problem. Appl Math Computation, 2013, 219: 4800-4815 CrossRef Google Scholar

[19] Fu Z H, Hao J K. Breakout local search for the Steiner tree problem with revenue, budget and hop constraints. Eur J Operational Res, 2014, 232: 209-220 CrossRef Google Scholar

[20] Lu Z, Hao J K, Zhou Y. Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem. Comput Operations Res, 2019, 111: 43-57 CrossRef Google Scholar

[21] Burke E K, Bykov Y. The late acceptance Hill-Climbing heuristic. Eur J Operational Res, 2017, 258: 70-78 CrossRef Google Scholar

[22] Namazi M, Sanderson C, Newton M A H, et al. Diversified Late Acceptance Search. In: Advances in Artificial Intelligence. Cham: Springer, 2018, 11320: 299--311. Google Scholar

[23] Resende M G C, Ribeiro C C. Greedy Randomized Adaptive Search Procedures: Advances and Extensions. In: Handbook of Metaheuristics. 3rd ed. Cham: Springer, 2019. 169--220. Google Scholar

[24] Peng B, Liu D, Su Z, et al. Solving the Incremental Graph Drawing Problem by Solution-based Multiple Neighborhood Tabu Search. Research Report, School of Business Administration, Southwestern University of Finance and Economics, Chengdu, China. 2019. Google Scholar

[25] Glover F. Analyzing and Exploiting Landscape Patterns in Combinatorial Optimization. School of Engineering and Applied Science, University of Colorado (in preparation). 2019. Google Scholar


Contact and support