You can view the full text of this article for free using the link below.

Title: Optimal orbital elements of binary stars based on flower pollination algorithm

Authors: Mohamed Abdel-Basset; Ibrahim El-henawy; Nabil Diab

Addresses: Department of Operations Research, Faculty of Computers and Informatics, Zagazig University, El-Zera Square, Zagazig, Sharqiyah 44519, Egypt ' Department of Computer Science, Faculty of Computers and Informatics, Zagazig University, El-Zera Square, Zagazig, Sharqiyah, Egypt ' Department of Computer Science, Higher Technological Institute (HTI), Cairo, Egypt

Abstract: In the field of eclipsing binary stars, the relative coordinate positions of each star with respect to the other stars in the system are adapted. Therefore the orbital parameters of the system will be adapted by the criterion of dynamical and physical (photometric) properties. Orbital elements have been determined for binaries from a combination of velocities in the literature. The formulas that are obtained for computing the orbital elements are determined from the directions of the bases of space data. So the present work is a new presented method for the determination of optimal orbital elements of binary stars based on flower pollination algorithm. The proposed algorithm seek to solve the problem of detecting global minimisers as a function instead of problem of finding periodic orbits, to get a best fit of Keplerian and phase curves. The experimental results implemented on star η Bootis of MK type G0 IV. Demonstrate that the flower pollination algorithm (FPA) reaches good results compared to the results of the standard particle swarm optimisation and other optimisation algorithms.

Keywords: flower pollination algorithm; FPA; meta-heuristics; optimisation; orbital element; binary stars.

DOI: 10.1504/IJMMNO.2019.096920

International Journal of Mathematical Modelling and Numerical Optimisation, 2019 Vol.9 No.1, pp.56 - 69

Received: 10 Jan 2018
Accepted: 24 Feb 2018

Published online: 04 Dec 2018 *

Full-text access for editors Access for subscribers Free access Comment on this article