Predictive Modeling of Engineering Placement Outcomes Using Genetic Algorithms

It is difficult to predict where engineering graduates will be employed due to various factors including market needs, technical skills, personal qualities, and academic achievement. Traditional techniques often produce less-than-ideal results because they are unable to fully capture the complex interactions between these factors. In this paper, we provide a novel method to tackle this problem by using genetic algorithm (GA) placement prediction capabilities. Genetic algorithms mimic the principles of evolution to find optimal solutions in a large solution space. The process of natural selection inspires them. GA effectively searches the solution space by listing possible solutions as chromosomes and performing selection, crossover, and mutation operations to identify optimal solutions.

Authors

Institutions

Publication Details

Published
2024-09-12
DOI
https://doi.org/10.1109/sparc61891.2024.10828827
Citations
2
Primary Topic
Engineering Education and Curriculum Development
Type
article
Field-Weighted Citation Impact
0.64
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Predictive Modeling of Engineering Placement Outcomes Using Genetic Algorithms

A.S. Pandya, Anshu Kumar Dwivedi, Puneet Sharma, P. Harshini
2 citations
Engineering Education and Curriculum Development
0.64
article

Predictive Modeling of Engineering Placement Outcomes Using Genetic Algorithms

A.S. Pandya, Anshu Kumar Dwivedi, Puneet Sharma, P. Harshini
article en
2 citations

Abstract

It is difficult to predict where engineering graduates will be employed due to various factors including market needs, technical skills, personal qualities, and academic achievement. Traditional techniques often produce less-than-ideal results because they are unable to fully capture the complex interactions between these factors. In this paper, we provide a novel method to tackle this problem by using genetic algorithm (GA) placement prediction capabilities. Genetic algorithms mimic the principles of evolution to find optimal solutions in a large solution space. The process of natural selection inspires them. GA effectively searches the solution space by listing possible solutions as chromosomes and performing selection, crossover, and mutation operations to identify optimal solutions.

Bennett University (IN), Centre for Artificial Intelligence and Robotics (IN)
Openalex Percentile: Top 25%
Engineering Education and Curriculum Development
0.64
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.