A pruned Pareto set for multi-objective optimisation problems via particle swarm and simulated annealing. (6th May 2019)

• Record Type: Journal Article
• Authors: Abubaker, Ahmad; Baharum, Adam; Alrefaei, Mahmoud
• Is Part Of: International journal of operational research. Volume 35:Number 1(2019)
• Page Start: 67
• Page End: 86
• Publication Date: 2019-05-06
• Subjects: multi-objective problem -- inventory control -- simulated annealing -- particle swarm optimisation -- automatic clustering; Operations research -- Periodicals; 003.05
• Languages: English
• ISSNs: 1745-7645

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.