DART algorithm for constrained optimisation with applications in suspension design
by Syeda Darakhshan Jabeen; Rathindra Nath Mukherjee; Jyotirmoy Saha
International Journal of Heavy Vehicle Systems (IJHVS), Vol. 26, No. 2, 2019

Abstract: We propose a new hybrid algorithm with application of suspension designs problem. The algorithm is based on divide-and-rule technique (DART) governed by artificial bee colony (ABC) algorithm. A divide phase splits the search region into subregions of smaller size and a ruling phase allows bees to rule over the selected subregion and look for a new region with best food source. The DART process is recursively applied to discover higher fitness subregion producing the optimal solution to the problem. Moreover, a new search strategy has been implemented to bias the bees towards feasible solution. A suspension problem has been formulated as a nonlinear constrained optimisation problem where the weighted sum of sprung mass jerks and their deflections are minimised under technological constraints. By the proposed algorithm the optimal passive suspension parameters have been obtained from the half car model to minimise the level of vibration and enhance passengers comfort. Moreover, the results obtained by model simulations with existing and optimised suspension parameters are compared.

Online publication date: Mon, 11-Mar-2019

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 Heavy Vehicle Systems (IJHVS):
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