A taboo search based approach to find the Pareto optimal set in multiple objective optimization

被引:80
作者
Baykasoglu, A
Owen, S
Gindy, N
机构
[1] Univ Nottingham, Dept Mfg Engn & Operat Management, Nottingham NG7 2RD, England
[2] Univ Gaziantep, Dept Ind Engn, TR-27310 Gaziantep, Turkey
基金
英国工程与自然科学研究理事会;
关键词
Pareto optimality; taboo search; multiple objective optimization;
D O I
10.1080/03052159908941394
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Taboo search is a heuristic optimization technique which works with a neighbourhood of solutions to optimize a given objective function. It is generally applied to single objective optimization problems. Taboo search has the potential for solving multiple objective optimization (MOO) problems, because it works with more than one solution at a time, and this gives it the opportunity to evaluate multiple objective functions simultaneously. In this paper, a taboo search based algorithm is developed to find Pareto optimal solutions in multiple objective optimization problems. The developed algorithm has been tested with a number of problems and compared with other techniques. Results obtained from this work have proved that a taboo search based algorithm can find Pareto optimal solutions in MOO effectively.
引用
收藏
页码:731 / 748
页数:18
相关论文
共 18 条