Optimising the bi-objective multidimensional integer knapsack problem using non-dominated sorting particle swarm optimisation
by Jafar Bagherinejad; Mina Dehghani
International Journal of Industrial and Systems Engineering (IJISE), Vol. 23, No. 3, 2016

Abstract: The knapsack problem (KP) and its multidimensional version are basic problems in combinatorial optimisation. In this paper, we consider the bi-objective multidimensional integer knapsack problem (BOMIKP), for which the aim is to approximate the set of non-dominated solutions using an evolutionary algorithm named non-dominated sorting particle swarm optimisation (NSPSO). The proposed methodology is based on a new variant of particle swarm optimisation (PSO) specialised in multi-objective optimisation. To aid the decision maker choosing the best compromise solution from the Pareto front, the fuzzy-based mechanism is employed for this purpose. For ensuring the robustness of the proposed method, the computational results are compared with those obtained by non-dominated sorting genetic algorithm II (NSGA-I) and multi-objective particle swarm optimisation (MOPSO) algorithm. Results show the advantages and effectiveness of the used procedures in reporting the optimal Pareto front. In addition, the results indicate that while MOPSO is able to generate Pareto solutions in significantly less amount of time, NSPSO and NSGA-II are capable of providing better quality results and better distribution of solutions in the trade-off surface.

Online publication date: Sun, 05-Jun-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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