Optimization of production profit using genetic algorithm

Based on the problems in each company, profit optimization is the main problem in the production process, precise calculation and analysis are needed to get maximum profit. The purpose of this research is to apply genetic algorithms to optimize the profits from the production process of goods. The r...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Rusmala, Suhardi, Heliawaty
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Based on the problems in each company, profit optimization is the main problem in the production process, precise calculation and analysis are needed to get maximum profit. The purpose of this research is to apply genetic algorithms to optimize the profits from the production process of goods. The research method is based on a genetic algorithm that consists of the process of chromosome formation, fitness design, and reproduction. The variables needed are the type of production, size, production cost, the selling price per item, profit per item, as well as the lowest demand and highest demand in one week. The lowest and highest limits are needed, that's why the optimization of the amount of production can be adjusted to market demand. Other data that must be taken into account is the maximum production cost per week. Maximum production cost and production capacity are needed so that the result of the solution does not exceed the maximum limit of capital provided so constraint data is needed to obtain appropriate calculations based on constraint factors. The results showed that the greatest fitness value was in the population 75 a1=297, a2=122, a3=83, a4=464, a5=70, a6=90, a7=476, a8=83, a9=85 with the resulting fitness value was 64.59 with a total profit of 64,594,570. the results of the CR-MR calculation get the results of cr=0.5 and mr=0.5 and the average fitness obtained is 59.00.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0112200