Applied-Analytics Tabu search, also called adaptive memory programming, is a method for solving challenging problems in the field of optimization. The goal is to identify the best decisions or actions in order to maximize some measure of merit (such as maximizing profit, effectiveness, quality, and social or scientific benefit) or to minimize some measure of demerit (cost, inefficiency, waste, and social or scientific loss). (Fred Glover and Manuel Laguna 2013)[ Glover F., Laguna M. (2013) Tabu Search∗. In: Pardalos P., Du DZ., Graham R. (eds) Handbook of Combinatorial Optimization. Springer, New York, NY. https://doi-org.ezproxy.lib.ou.edu/10.1007/978-1-4419-7997-1_17]