A pruned Pareto set for multi-objective optimisation problems via particle swarm and simulated annealing Online publication date: Thu, 09-May-2019
by Ahmad Abubaker; Adam Baharum; Mahmoud Alrefaei
International Journal of Operational Research (IJOR), Vol. 35, No. 1, 2019
Abstract: A Pareto optimal set, which is obtained from solving multi-objective optimisation problems, usually contain a large number of optimal solutions. This situation poses a challenge for decision makers in choosing a suitable solution from a large number of overlapping and complex Pareto solutions. This paper proposes a new procedure for solving multi-objective optimisation problems by reducing the size of the Pareto set. The procedure is divided into two major stages. In the first stage, the multi-objective simulated annealing algorithm is used to solve a multi-objective optimisation problem by constructing the Pareto optimal set. In the second stage, the automatic clustering algorithm is used to prune the Pareto set. This procedure is implemented to solve two multi-objective optimisation problems, namely, the 0/1 multi-objective multi-dimensional knapsack problem and the multi-objective inventory system. The procedure enables the decision maker to select an appropriate solution efficiently.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook