A TABOO SEARCH BASED APPROACH TO FIND THE PARETO OPTIMAL SET IN MULTIPLE OBJECTIVE OPTIMIZATION |
| |
| Authors: | ADIL BAYKASOGLU STEPHEN OWEN NABIL GINDY |
| |
| Affiliation: | 1. Department of Manufacturing Engineering and Operations Management , University of Nottingham , University Park, Nottingham, NG7 2RD, UK;2. Department of Industrial Engineering , University of Gaziantep , Gaziantep, 27310, Turkey;3. Department of Manufacturing Engineering and Operations Management , University of Nottingham , University Park, Nottingham, NG7 2RD, UK |
| |
| Abstract: | 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. |
| |
| Keywords: | Pareto optimality taboo search multiple objective optimization |
|
|
