Constructive genetic algorithm with penalty function for a concurrent real-time optimization in embedded system design process

In this paper we present a genetic programming based constructive algorithm with penalty function for a concurrent real-time optimization in embedded system design process.Proposed approach uses genetic programming mechanism to optimize detecting and assignment of unexpected tasks process in embedded system design.Unlike others methodologies the approach described in this paper uses a penalty in objective function in optimization process.As a result during the evolution generations of individuals can also contain solutions which violate time constraints.Thus the approach is more proof to stop in local minima of optimizing parameters.Therefore the final result could be better adapted to the environment and the optimization process can be cheaper and more effective.

Authors

Institutions

Publication Details

Journal
Annals of Computer Science and Information Systems
Published
2025-10-15
DOI
https://doi.org/10.15439/2025f5892
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Constructive genetic algorithm with penalty function for a concurrent real-time optimization in embedded system design process

Maciej Ogorzałek, Adam M. Górski
Annals of Computer Science and Information Systems
Scheduling and Optimization Algorithms
article

Constructive genetic algorithm with penalty function for a concurrent real-time optimization in embedded system design process

Maciej Ogorzałek, Adam M. Górski
article en

Abstract

In this paper we present a genetic programming based constructive algorithm with penalty function for a concurrent real-time optimization in embedded system design process.Proposed approach uses genetic programming mechanism to optimize detecting and assignment of unexpected tasks process in embedded system design.Unlike others methodologies the approach described in this paper uses a penalty in objective function in optimization process.As a result during the evolution generations of individuals can also contain solutions which violate time constraints.Thus the approach is more proof to stop in local minima of optimizing parameters.Therefore the final result could be better adapted to the environment and the optimization process can be cheaper and more effective.

Annals of Computer Science and Information SystemsVol. 44
Jagiellonian University (PL)
Openalex Percentile: Top 31%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.