Forthcoming and Online First Articles

International Journal of Swarm Intelligence

International Journal of Swarm Intelligence (IJSI)

Forthcoming articles have been peer-reviewed and accepted for publication but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.

Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.

Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.

Online First articles are published online here, before they appear in a journal issue. Online First articles are fully citeable, complete with a DOI. They can be cited, read, and downloaded. Online First articles are published as Open Access (OA) articles to make the latest research available as early as possible.

Open AccessArticles marked with this Open Access icon are Online First articles. They are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.

Register for our alerting service, which notifies you by email when new issues are published online.

We also offer which provide timely updates of tables of contents, newly published articles and calls for papers.

International Journal of Swarm Intelligence (1 paper in press)

Regular Issues

  • A review of 0-1 knapsack problem by nature-inspired optimisation algorithms   Order a copy of this article
    by Ruchi Chauhan, Nirmala Sharma, Harish Sharma 
    Abstract: Nature is the origin of all the knowledge. Researches have built nature-inspired optimisation (NIO) algorithms, that follow natural principles to find solutions, for the real life problems. In the binary knapsack problem (0/1KP), a bag (or a knapsack) has to be filled with articles, where each article has a weight and a profit value, the articles are filled in the knapsack, in whole numbers, up to a weight limit, to attain the optimum profit. The 0/1KP does the optimum sub-structure selection from a given set of articles, i.e., there can be different optimum solutions for a given 0/1KP. The aim of this research is to discuss the NIO algorithms innovated for solving the 0/1KP. The review creates foundation, for future research on optimising the 0/1KP, from meta-heuristic NIO techniques.
    Keywords: nature-inspired optimisation; NIO; 0-1 knapsack problem; 0/1KP; NP-hard problems; swarm intelligence.
    DOI: 10.1504/IJSI.2022.10051132