Solving bulk transportation problem using a modified particle swarm optimisation algorithm
by Gurwinder Singh; Amarinder Singh
International Journal of Swarm Intelligence (IJSI), Vol. 6, No. 2, 2021

Abstract: Particle swarm optimisation (PSO) algorithm is renowned for its ability to deal with a wide variety of real life complex problems. The adaptive ability of PSO makes it applicable to continuous as well as discrete optimisation problems. The bulk transportation problem is one such discrete optimisation problem wherein the objective is to minimise the transportation cost while satisfying the bulk demand for each destination. In this article, the PSO is modified to integrate additional modules to resolve both the infeasible intermediate solution and the non-integral variables. The proposed algorithm also maintains the condition of bulk purchase of the product from a single source. To validate the proposed PSO, different test problems have been taken and it is found that the proposed method is quite effective in its convergence capability and quality of solution.

Online publication date: Fri, 29-Oct-2021

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 Swarm Intelligence (IJSI):
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