방법 비교

	Agent-Based Tabu Search	Multi-objective Tabu Search (MOTS)
분야	시뮬레이션	시뮬레이션
계열	Process / pipeline	Process / pipeline
기원 연도	1989–1995	1997
창시자	Glover, F. (tabu search); multi-agent extension by various researchers in the 1990s–2000s	Hansen, M. P.; building on Glover (1989) Tabu Search
유형	Hybrid metaheuristic — agent-based distributed tabu search	Metaheuristic multi-objective optimization
원전	Glover, F. (1989). Tabu search — Part I. ORSA Journal on Computing, 1(3), 190–206.	Hansen, M. P. (1997). Tabu search for multiobjective optimization: MOTS. Presented at the 13th International Conference on Multiple Criteria Decision Making (MCDM), Cape Town, South Africa.
별칭	ABTS, Multi-Agent Tabu Search, Distributed Tabu Search, Cooperative Tabu Search	MOTS, Multi-criteria Tabu Search, Pareto Tabu Search, TSMOO
관련	4	5
요약	Agent-Based Tabu Search (ABTS) embeds the tabu search metaheuristic inside a multi-agent framework where autonomous agents each run independent or cooperating tabu search threads, sharing promising solutions to escape local optima and collectively explore large combinatorial or continuous search spaces more effectively than a single-thread implementation.	Multi-objective Tabu Search (MOTS) is a metaheuristic algorithm that extends the classic Tabu Search framework to simultaneously optimize two or more conflicting objective functions. Instead of a single optimum, it seeks to approximate the Pareto front — the set of solutions where no objective can be improved without worsening another — making it suitable for complex combinatorial and continuous optimization problems in engineering, logistics, and operations research.