IDEAS home Printed from https://ideas.repec.org/a/ids/ijisen/v23y2016i3p263-289.html
   My bibliography  Save this article

Optimising the bi-objective multidimensional integer knapsack problem using non-dominated sorting particle swarm optimisation

Author

Listed:
  • Jafar Bagherinejad
  • Mina Dehghani

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.

Suggested Citation

  • Jafar Bagherinejad & Mina Dehghani, 2016. "Optimising the bi-objective multidimensional integer knapsack problem using non-dominated sorting particle swarm optimisation," International Journal of Industrial and Systems Engineering, Inderscience Enterprises Ltd, vol. 23(3), pages 263-289.
    • Handle: RePEc:ids:ijisen:v:23:y:2016:i:3:p:263-289
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=76867
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijisen:v:23:y:2016:i:3:p:263-289. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=188 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.