A New Hybrid Meta-Heuristics Algorithms to Solve APP Problems

13Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, a new hybrid algorithm for linear programming model based on Aggregate production planning problems is proposed. The new hybrid algorithm of a simulated annealing (SA) and particle swarm optimization (PSO) algorithms. PSO algorithm employed for a good balance between exploration and exploitation in SA in order to be effective and efficient (speed and quality) for solving linear programming model. Finding results show that the proposed approach is achieving within a reasonable computational time comparing with PSO and SA algorithms.

Cite

CITATION STYLE

APA

Kalaf, B. A., Mohammed, G. J., & Salman, M. D. (2021). A New Hybrid Meta-Heuristics Algorithms to Solve APP Problems. In Journal of Physics: Conference Series (Vol. 1897). IOP Publishing Ltd. https://doi.org/10.1088/1742-6596/1897/1/012011

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free