방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| Multi-objective Tabu Search (MOTS)× | 다목적 개미 군집 최적화 (MOACO)× | |
|---|---|---|
| 분야 | 시뮬레이션 | 시뮬레이션 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1997 | 1999 |
| 창시자≠ | Hansen, M. P.; building on Glover (1989) Tabu Search | Gambardella, Taillard & Agazzi; Dorigo & Stützle |
| 유형≠ | Metaheuristic multi-objective optimization | Population-based metaheuristic |
| 원전≠ | 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. link ↗ | Gambardella, L. M., Taillard, E., & Agazzi, G. (1999). MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In D. Corne, M. Dorigo, & F. Glover (Eds.), New Ideas in Optimization (pp. 63–76). McGraw-Hill. link ↗ |
| 별칭 | MOTS, Multi-criteria Tabu Search, Pareto Tabu Search, TSMOO | MOACO, Multi-Objective ACO, Pareto Ant Colony Optimization, Multi-objective ACO |
| 관련≠ | 5 | 4 |
| 요약≠ | 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. | Multi-Objective Ant Colony Optimization (MOACO) is a swarm-intelligence metaheuristic that extends the classic Ant Colony Optimization framework to simultaneously optimize two or more conflicting objectives. Artificial ants construct candidate solutions guided by pheromone trails and heuristic information, progressively building an archive of Pareto-optimal solutions rather than converging to a single best answer. |
| ScholarGate데이터셋 ↗ |
|
|