Affiliations: [a] Mathematics and Statistics Department, Faculty of Science, Taif University, Saudi Arabia
| [b] Department of Basic Engineering Sciences, Faculty of Engineering, Menofia University, Shebin EL-Kom, Egypt
| [c] Department of Mathematics, College of Science, King Saud University, Saudi Arabia
| [d] Department of Physics and Computer Science, Wilfrid Laurier University, Waterloo, Canada
Correspondence:
[*]
Corresponding author. S. Abdel-Khalek, Mathematics and Statistics Department, Faculty of Science, Taif University, P.O. Box 11099, Taif 21944, Saudi Arabia. E-mail: afarouk@wlu.ca.
Abstract: The application and analysis of effective blood supply chain network under natural disaster imposed many critical challenges which addressed through an optimization of multiple objectives functions. In this article, relies on reference point algorithm, a user-preference based enriched swarm optimization algorithm is proposed where, inner reference points were produced depending on the perturbed reference point. For each inner reference point, weakly/ɛ-properly Pareto optimal solution was generated using augmented achievement function. All the generated solutions (points) are presented as potential positions for particles in the particle swarm optimization PSO. The proposed algorithm has been reinforced with a novel chaotic contraction operator to retain the feasibility of the particles. To prove the validity of our algorithm, the obtained results are compared with true Pareto optimal front and three of the most salient evolutionary algorithms using inverted generational distance metric IGD. In addition it was implement to detect the most cost and time efficient blood supply chain to provide the required blood types demand on the blood transfusion center in emergence situation, where, it is required to solve this real life application with predefined supply time and predefined supply cost, which is considered as reference point to get the nearby Pareto optimal solution. By the experimental outcomes, we proved that the proposed algorithm is capable to find the set of Paetro optimal solutions nearby the predefined reference points.
