\bibitem{AdamsBZ1988} Adams J., Balas E., Zawack D.: The Shifting Bottleneck Procedure for Job Shop Scheduling. Management Science \textbf{34}(4), 391--401 (1998). \url{https://doi.org/10.1287/mnsc.34.3.391}


\bibitem{AlvimTaillard2013} Alvim A.C.F., Taillard {\'E}.D.: POPMUSIC for the World Location Routing Problem. EURO Journal on Transportation and Logistics \textbf{2}(3), 231--254 (2013). \url{https://doi.org/10.1007/s13676-013-0024-2}
 
\bibitem{ApplegateBCC1999} Applegate D.L., Bixby R.E., Chv{\'a}tal V., Cook W.J.: Concorde: A code for solving Traveling Salesman Problems.
  \url{https://github.com/matthelb/concorde} (1999). Accessed 16 June 2022

\bibitem{BattitiTecchiolli1994} Battiti R., Tecchiolli G.: The Reactive Tabu Search,  ORSA Journal on Computing \textbf{6}, {126--140} (1994). \url{https://doi.org/10.1287/ijoc.6.2.126}

\bibitem{BradleyTibshirani1994} Bradley E., Tibshirani R.J.: An Introduction to the Bootstrap, Chapman and Hall (1994)

\bibitem{Brelaz1979} Br{\'e}laz D.: New Methods to Color the Vertices of a Graph. Communications of the ACM \textbf{22}(4), 251--256 (1979). \url{https://doi.org/10.1145/359094.359101}

\bibitem{Cerny1985} Černý V.: Thermodinamical Approach to the Traveling Salesman Problem: An efficient Simulation Algorithm. Journal of Optimization Theory and Applications \textbf{45}(1), {41--51} (1985). \url{https://doi.org/10.1007/BF00940812}


\bibitem{CHARON1993133} Charon I., Hudry O.: The Noising Method: a New Method for Combinatorial Optimization. Operations Research Letters \textbf{14}(3), 133--137 (1993). \url{https://doi.org/10.1016/0167-6377(93)90023-A}

\bibitem{ColorniDM1991} Colorni A., Dorigo M., Maniezzo V.:  Distributed Optimization by Ant Colonies.  In: Actes de la premi\`{e}re conf\'{e}rence europ\'{e}enne sur la vie artificielle, {pp.~134--142}, Paris. {Elsevier},  (1991)

\bibitem{Cook1971} Cook S.A.: {The Complexity of Theorem-Proving Procedures}. In: Proceedings of the third annual ACM symposium on Theory of computing {151--158}. {ACM} (1971). \url{https://doi.org/10.1145/800157.805047}

\bibitem{Croes1958} Croes G.A.: {A Method for Solving Traveling Salesman Problems}. Operations Research \textbf{6}, {791--812} (1958). \url{https://doi.org/10.1287/opre.6.6.791}

\bibitem{Dakin1965} Dakin R.J.: {A Tree Search Algorithm for Mixed Integer Programming Problems}. The Computer Journal \textbf{8}(3), {250--255} (1965). \url{https://doi.org/10.1093/comjnl/8.3.250}

\bibitem{DeneubourgGPFL1987} Deneubourg J., Goss S., Pasteels J., Fresneau D., Lachaud J.: {Self-Organization Mechanisms in Ant Societies (II) : Learning in Foraging and Division of Labor}. In: Pasteels J., et al. (eds.) From Individual to Collective Behavior in Social Insects, Experientia supplementum \textbf{54}, {177--196}. Birkhäuser, Basel (1987)

\bibitem{DorigoGambardella1997} Dorigo M., Gambardella L.M.: {Ant Colony System : A Cooperative Learning Approach to the Traveling Salesman Problem}. IEEE Transactions on Evolutionary Computation \textbf{1}(1),  {53--66} (1997). \url{https://doi.org/10.1109/4235.585892}

\bibitem{Dueck1993} Dueck G.: {New Optimization Heuristics: The Great Deluge Algorithm and the Record-to-Record Travel}. {Journal of Computational Physics} \textbf{104}(1), {86--92} (1993). \url{https://doi.org/10.1006/jcph.1993.1010}

\bibitem{DueckScheuer1990} Dueck G., Scheuer T.: {Threshold accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing}. {Journal of Computational Physics}  \textbf{90}(1), {161--175}(1990). \url{https://doi.org/10.1016/0021-9991(90)90201-B}

\bibitem{DuinVoss1999} Duin C., Vo\ss\ S.: {The Pilot Method: A Strategy for Heuristic Repetition with Application to the Steiner Problem in Graphs}. {Networks} \textbf{34}, {181-191} (1999). \url{https://doi.org/10.1002/(SICI)1097-0037(199910)34:3\%3C181::AID-NET2\%3E3.0.CO;2-Y}

\bibitem{FeoResende1995} Feo T.A., Resende M.G.C.: {Greedy Randomized Adaptive Search Procedure}. {Journal of Global Optimization} \textbf{6}, {109--133} (1995). \url{https://doi.org/10.1007/BF01096763}

\bibitem{FurcyKoenig2005} Furcy D., Koenig S.: {Limited Discrepancy Beam Search}. {Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI)}, {pp.~125--131} (2005)

\bibitem{GareyJohnson1979} Garey M.R., Johnson D.S.: {Computers and Intractability --- A Guide to the Theory of NP-Completeness}. {W. H. Freeman \& Co.} (1979)

\bibitem{GilliKH2006} Gilli M., K\"ellezi E., Hysi H.: {A Data-Driven Optimization Heuristic for Downside Risk Minimization}. {Journal of Risk} \textbf{8}(3), {1--19} (2006)

\bibitem{Glover1977} Glover F.: {Heuristics for Integer Programming Using Surrogate Constraints}. {Decision Sciences} \textbf{8}(1), {156--166} (1977). \url{https://doi.org/10.1111/j.1540-5915.1977.tb01074.x}

\bibitem{glover86} Glover F.: {Future Paths for Integer Programming and Links to Artificial Intelligence}. {Computers and Operations Research} \textbf{13}(5), {533--549} (1986). \url{https://doi.org/10.1016/0305-0548(86)90048-1}

\bibitem{glover89} Glover F.: {Tabu Search~---~part I}. {ORSA Journal on Computing} \textbf{1}(3), {190--206} (1989). \url{https://doi.org/10.1287/ijoc.1.3.190}

\bibitem{glover90} Glover F.: {Tabu Search~---~part II}. {ORSA Journal on Computing} \textbf{2}(1), {4--32} (1990). \url{https://doi.org/10.1287/ijoc.2.1.4}

\bibitem{Glover1996} Glover F.: {Ejection Chains, Reference Structures and Alternating Path Methods
for Traveling Salesman Problems}. {Discrete Applied Mathematics} \textbf{65}, {223--253} (1996). \url{https://doi.org/10.1016/0166-218X(94)00037-E}

\bibitem{Glover1997} Glover F.: {Tabu Search and Adaptive Memory Programming --- Advances, Applications and Challenges}.
  In: Barr R.S., Helgason R.V., Kennington J.L. (eds.) {Interfaces in Computer Science and Operations Research: Advances in Metaheuristics, Optimization, and Stochastic Modeling Technologies}. {pp. 1--75}. {Springer}, {Boston} (1997). \url{https://doi.org/10.1007/978-1-4615-4102-8\_1}

\bibitem{Glover1998} Glover F.: {A Template for Scatter Search and Path Relinking}. In: Hao J.K., Lutton E., Ronald E., Schoenauer M., Snyers D. (eds.)
{Artiﬁcial Evolution, Lecture Notes in Computer Science} \textbf{1363}, {13--54} (1998). \url{https://doi.org/10.1007/BFb0026589}

\bibitem{GloverLaguna97} Glover F., Laguna M.: {Tabu Search}. {Kluwer, Dordrecht} (1997)


\bibitem{GreistorferStaneckManiezzo2019} Greistorfer P., Staněk R., Maniezzo V.: {The Magnifying Glass Heuristic for the Generalized Quadratic Assignment Problem}. {Metaheuristic International Conference (MIC'19) proceedings}, {Cartagena, Columbia} (2019)

\bibitem{Helsgaun2000} Helsgaun K.: {An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic}.
{European Journal of Operational Research} \textbf{126}(1), {106--130} (2000). \url{https://doi.org/10.1016/S0377-2217(99)00284-2}

\bibitem{Helsgaun2018} Helsgaun K.: {Using {POPMUSIC} for {C}andidate {S}et {G}eneration in the {L}in-{K}ernighan-{H}elsgaun {TSP} {S}olver}. {Department of Computer Science, Roskilde University, Denmark (2018)

\bibitem{Holland1975} Holland J.: {Adaptation in Natural and Artificial Systems}. {The University of Michigan Press},  {Ann Harbor} (1975)


\bibitem{Jarnik1930} Jarník V.: {O jistém problému minimálním. (Z dopisu panu O. Borůvkovi} {[On a certain problem of minimization (from a letter to O. Borůvka)], in Czech}. {Práce moravské přírodovědecké společnosti} \textbf{6}(4), {57--63} (1930). \url{http://dml.cz/dmlcz/500726}
 

\bibitem{Jarnik1934} Jarník V.: {O minimálních grafech, obsahujících n daných bodů} {[On minimal graphs containing n given points], in Czech}. {Časopis pro Pěstování Matematiky a Fysiky} \textbf{63}(8) {223--235} (1934). \url{https://doi.org/10.21136/CPMF.1934.122548}

\bibitem{JovanovicMilanVoss2019} Jovanovic R., Tuba M., Vo{\ss} S.: {Fixed Set Search Applied to the Traveling Salesman Problem}. In: Blum C., Gambini Santos H., Pinacho-Davidson P., Godoy del Campo J. (eds.)  {Hybrid Metaheuristics}. Lecture Notes in Computer Science, vol.~11299, {pp.~63--77} {Springer}, {Cham} (2019). \url{https://doi.org/10.1007/978-3-030-05983-5\_5}

\bibitem{KaufmanRosseeuw1987} Kaufman L., Rousseeuw P.J.: {Clustering by means of Medoids}. In:
{DodgeY.  (ed.)} {Statistical Data Analysis Based on the $L_{1}$-Norm and Related Methods}, {pp. 405--416} {North-Holland, Amsterdam} (1987)

\bibitem{KennedyEberhart1995} Kennedy J., Eberhart R.C.: {Particle Swarm Optimization}. {IEEE International Conference on Neural Networks}. vol.~IV,  {pp.~1942--1948} {Piscataway, NJ}. {IEEE Service Center, Perth} (1995). \url{https://doi.org/10.1109/ICNN.1995.488968}
}

\bibitem{KirkpatrickGV1983}  Kirkpatrick S., Gelatt C.D., Vecchi M.P.: {Optimization by Simulated Annealing}. {Science} \textbf{220} (4598), {671--680} (1983). \url{https://doi.org/10.1126/science.220.4598.671}

\bibitem{LagunaMarti1999} Laguna M., Mart\'{i} R.: {GRASP and Path Relinking for 2-layer Straight Line Crossing Minimization}. {INFORMS Journal on Computing} \textbf{11}(1), {44--52} (1999). \url{https://doi.org/10.1287/ijoc.11.1.44}

\bibitem{LEcuyer1996} L'Ecuyer P.: {Combined Multiple Recursive Random Number Generators}. {Operations Research} \textbf{44}(5), {816--822} (1996). \url{http://www.jstor.org/stable/171570}

\bibitem{LinKernighan1973} Lin S., Kernighan B. W.: {An Effective Heuristic Algorithm for the Traveling-Salesman Problem}. {Operations Research} \textbf{21}(2), {498--516} (1973). \url{https://www.jstor.org/stable/169020}

\bibitem{Lones2020} Lones M.: Mitigating Metaphors: A Comprehensible Guide to Recent Nature-Inspired Algorithms. {SN Computer Science} \textbf{1}(49), (2020). \url{https://doi.org/10.1007/s42979-019-0050-8}

\bibitem{Lowerre1976} Lowerre B.: {The Harpy Speech Recognition System}. Ph. D. Thesis,  {Carnegie Mellon University} (1976)

\bibitem{LOPEZIBANEZ201643} López-Ibáñez M., Dubois-Lacoste J., {Pérez Cáceres} L., Birattari M., Stützle T.:  {The Irace Package: Iterated Racing for Automatic Algorithm Configuration}. {Operations Research Perspectives} \textbf{3},  {43--58} (2016). https://doi.org/10.1016/j.orp.2016.09.002

\bibitem{MartelloToth1990} Martello S., Toth P.: {Knapsack Problems --- Algorithms and Computer Implementations}. {Wiley}, {Chichester} (1990)

\bibitem{hansen99} Hansen P., Mladenovi\'c N.: {An Introduction to Variable Neighborhood Search}. In: {Vo\ss\ S. , Martello S., Osman I.H., Roucairol C. (eds.)} {Meta-heuristics~: Advances and Trends in Local Search Paradigms for Optimization}, {pp. 422--458}, {Kluwer}, {Dordrecht} (1999). \url{https://doi.org/10.1007/978-1-4615-5775-3\_30}

\bibitem{moscato99} Moscato P: {Memetic Algorithms: A Short Introduction}. In: {CorneD., Glover F., Dorigo M. (eds.)} {New Ideas in Optimisation}, {pp. 219--235}, {McGraw-Hill}, {London} (1999)

\bibitem{Or1976} Or I.: {Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking}. Ph. D. Thesis, {Northwestern University} (1976)

\bibitem{OstermanRego2016} Osterman C., Rego C.: {A k-level Data Structure for Large-scale Traveling Salesman Problems}. {Annals of Operations Research} \textbf{244}(2), {1--19} (2016). \url{https://doi.org/10.1007/s10479-016-2159-7}

\bibitem{Paquete_et_al2004}  Paquete L., Chiarandini M., St{\"u}tzle T.: {Pareto Local Optimum Sets in the Biobjective Traveling Salesman Problem: An Experimental Study}. In: {Gandibleux, X., Sevaux, M., Sörensen, K., T’kindt, V. (eds.)}
  {Multiobjective Optimisation. Lecture Notes in Economics and Mathematical Systems}, vol. 535, {pp.~177--200} {Springer} (2004). \url{https://doi.org/10.1007/978-3-642-17144-4\_7}

\bibitem{Rechenberg1973} Rechenberg I.: {Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution}. {Frommann-Holzboog}, {Stuttgart} (1973). \url{https://doi.org/10.1002/fedr.19750860506}

\bibitem{Reinelt1990} Reinelt G.: {{TSPLIB} --- {A} T.S.P. Library}.
 (1990). \url{http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95}. Accessed 16 June 2022

\bibitem{ResendeRibeiro2016} Resende M.G.C., Riberio C.C.: {Optimization by GRASP: Greedy Randomized Adaptive Search Procedures}.
  {Springer}, {New-York}, (2016). \url{https://doi.org/10.1007/978-1-4939-6530-4}

\bibitem{Sahling_et_al2009} Sahling F., Buschkühl L., Tempelmeier H., Helber S.: {Solving a Multi-level Capacitated Lot Sizing Problem with Multi-period Setup Carry-over via a Fix-and-Optimize Heuristic}. {Computers and Operations Research} \textbf{36}(9), {2546--2553} (2009). \url{https://doi.org/10.1016/j.cor.2008.10.009}

\bibitem{Shaw1998} Shaw P.: {Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems}. {4. International Conference of Principles and Practice of Constraint Programming}, {pp.~417--431}. {Springer-Verlag} (1998). \url{https://doi.org/10.1007/3-540-49481-2\_30}

\bibitem{SniedovichVoss2006}  Sniedovich M., Vo\ss\ S.: {The Corridor Method: a Dynamic Programming Inspired Metaheuristic}. {Control and Cybernetics} \textbf{35}(3), {551--578} (2006). \url{http://eudml.org/doc/209435}

\bibitem{SorensenSeveaux2006} S\"{o}rensen K., Seveaux M.: {MA|PM: Memetic Algorithms with Population Management}.   
  {Computers \& Operations Research} \textbf{33}, {1214--1225} (2006). \url{https://doi.org/10.1016/j.cor.2004.09.011}

\bibitem{StuetzleHoos2000} St\"utzle T., Hoos  H.H.: {MAX MIN Ant System}. {Future Generation Computer Systems} \textbf{16}(8), {889--914} (2000). \url{https://doi.org/10.1016/S0167-739X(00)00043-1}

\bibitem{Taillard1993Networks} Taillard {\'E}.D.: {Parallel Iterative Search Methods for Vehicle Routing Problems}. {Networks} \textbf{23}(8), {661--673} (1993). \url{https://doi.org/10.1002/net.3230230804}

\bibitem{Taillard1995} Taillard {\'E}.D.: {Comparison of Iterative Searches for the Quadratic Assignment Problem}. {Location Science} \textbf{3}(2), {87--105} (1995). \url{https://doi.org/10.1016/0966-8349(95)00008-6}

\bibitem{Taillard1998HDR} Taillard {\'E}.D.: {La programmation {\`a} m{\'e}moire adaptative et les algorithmes pseudo-gloutons: nouvelles perspectives pour les m{\'e}ta-heuristiques}. {HDR Thesis}, {Universit{\'e} de Versailles-Saint-Quentin-en-Yvelines} (1998)

\bibitem{Taillard2003JOH} Taillard {\'E}.D.:
  {Heuristic Methods for Large Centroid Clustering Problems}.
  {J. Heuristics} \textbf{9}(1), {51--73} (2003). \url{https://doi.org/10.1023/A:1021841728075}

\bibitem{Taillard2005} Taillard {\'E}.D.: {Tutorial : Few guidelines for analyzing methods}.
  {Metaheuristic International Conference (MIC'05) proceedings}, {Wien, Austria} (2005)
  
\bibitem{Taillard2022} Taillard {\'E}.D.:
	{A Linearithmic Heuristic for the Travelling Salesman Problem}.
	{European Journal of Operational Research} \textbf{297}(2), {442--450} (2022). \url{https://doi.org/10.1016/j.ejor.2021.05.034}

\bibitem{TaillardWZ2008} Taillard {\'E}.D., Waelti P., Zuber J.: {Few Statistical Tests for Proportions Comparison}.
  {European Journal of Operational Research} \textbf{185}(3), {1336--1350} (2008). \url{https://doi.org/10.1016/j.ejor.2006.03.070}

\bibitem{TothVigo2003} {Toth P.,  Vigo D.}: {The Granular Tabu Search and Its Application to the Vehicle-Routing Problem}. {INFORMS J. on Computing} \textbf{15}(4),  {333--346} (2003). \url{https://doi.org/10.1287/ijoc.15.4.333.24890}

\bibitem{1832handlungsreisende} Voigt(ed.)
  {Der Handlungsreisende wie er sein soll und was er zu thun hat, um Auftr{\"a}ge zu erhalten und eines gl{\"u}cklichen Erfolgs in seinen Gesch{\"a}ften gewi{\ss} zu sein ; Mit einem Titelkupf}. Voigt, Ilmenau (1832)

\bibitem{WolpertMacready1997} Wolpert D.H., Macready W.G.: {No Free Lunch Theorems for Optimization}. {IEEE Transaction on Evolutionary computation} \textbf{1}(1), 67--82 (1997). \url{https://doi.org/10.1109/4235.585893}

\bibitem{XavierXavier2016} Xavier A.E., Xavier V.L.: {Flying Elephants: a General Method for Solving non-differentiable Problems}.
{Journal of Heuristics} \textbf{22}(4), {649--664} (2016). \url{https://doi.org/10.1007/s10732-014-9268-8}


