TY - GEN
T1 - Application of greedy and heuristic algorithm-based optimisation methods towards aerodynamic shape optimisation
AU - Brahmachary, Shuvayan
AU - Natarajan, Ganesh
AU - Kulkarni, Vinayak
AU - Sahoo, Niranjan
AU - Nanda, Soumya Ranjan
N1 - Publisher Copyright:
© Springer Nature Singapore Pte Ltd. 2019.
PY - 2019
Y1 - 2019
N2 - In the present work, application of evolutionary algorithm and gradient-based optimisation techniques are extended towards obtaining minimum drag axisymmetric bodies in hypersonic flows. An attempt has been made to study the comparative performance of greedy and heuristic algorithm-based optimisation algorithm of interest with its application towards generating optimal shape configurations. We compare the performance of memetic meta-heuristic-based shuffled frog-leaping algorithm (SFLA), biological evolution-based genetic algorithm (GA), stochastic method-based simulated annealing (SA) and gradient-based steepest descent (SD) method. The suitability of each optimisation algorithm is analysed for a common test case of minimum drag axisymmetric body with the use of theoretical correlation as its flow solver. This is then followed by the implementation of a computationally expensive but accurate in-house Euler flow solver based on Immersed Boundary (IB) method, which results in a discrete solution space. This naturally results in greater computational cost per function evaluation. Results indicate that evolutionary algorithm-based optimisation technique requires much greater number of function evaluations as compared to gradient-based optimisation technique. Moreover, for a uni-modal problem considered in this work, the choice of gradient-based optimisation method proves to be quite robust and computationally efficient.
AB - In the present work, application of evolutionary algorithm and gradient-based optimisation techniques are extended towards obtaining minimum drag axisymmetric bodies in hypersonic flows. An attempt has been made to study the comparative performance of greedy and heuristic algorithm-based optimisation algorithm of interest with its application towards generating optimal shape configurations. We compare the performance of memetic meta-heuristic-based shuffled frog-leaping algorithm (SFLA), biological evolution-based genetic algorithm (GA), stochastic method-based simulated annealing (SA) and gradient-based steepest descent (SD) method. The suitability of each optimisation algorithm is analysed for a common test case of minimum drag axisymmetric body with the use of theoretical correlation as its flow solver. This is then followed by the implementation of a computationally expensive but accurate in-house Euler flow solver based on Immersed Boundary (IB) method, which results in a discrete solution space. This naturally results in greater computational cost per function evaluation. Results indicate that evolutionary algorithm-based optimisation technique requires much greater number of function evaluations as compared to gradient-based optimisation technique. Moreover, for a uni-modal problem considered in this work, the choice of gradient-based optimisation method proves to be quite robust and computationally efficient.
UR - http://www.scopus.com/inward/record.url?scp=85059002286&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85059002286&partnerID=8YFLogxK
U2 - 10.1007/978-981-13-1592-3_75
DO - 10.1007/978-981-13-1592-3_75
M3 - Conference contribution
AN - SCOPUS:85059002286
SN - 9789811315916
T3 - Advances in Intelligent Systems and Computing
SP - 937
EP - 948
BT - Soft Computing for Problem Solving - SocProS 2017
A2 - Bansal, Jagdish Chand
A2 - Nagar, Atulya
A2 - Ojha, Akshay Kumar
A2 - Das, Kedar Nath
A2 - Deep, Kusum
PB - Springer Verlag
T2 - 7th International Conference on Soft Computing for Problem Solving, SocProS 2017
Y2 - 23 December 2017 through 24 December 2017
ER -