Management Science and Financial Engineering
- 제3권1호
- /
- Pages.75-88
- /
- 1997
- /
- 2287-2043(pISSN)
- /
- 2287-2361(eISSN)
DEVELOPMENT OF A TABU SEARCH HEURISTIC FOR SOLVING MULTI-OBJECTIVE COMBINATORIAL PROBLEMS WITH APPLICATIONS TO CONSTRUCTING DISCRETE OPTIMAL DESIGNS
- JOO SUNG JUNG (Department of Manpower Management, Korea Institute for Defense Analyses) ;
- BONG JIN YUM (Department of Industrial Engineering, Korea Advanced Institute of Science and Technology)
- 발행 : 1997.05.01
초록
Tabu search (TS) has been successfully applied for solving many complex combinatorial optimization problems in the areas of operations research and production control. However, TS is for single-objective problems in its present form. In this article, a TS-based heuristic is developed to determine Pareto-efficient solutions to a multi-objective combinatorial optimization problem. The developed algorithm is then applied to the discrete optimal design problem in statistics to demonstrate its usefulness.
키워드