.png){kind=icon}
Return
A genetic algorithm for subset sum problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2003.12.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents an improved genetic algorithm (GA) for solving the subset sum problem (SSP). Unlike a conventional GA, the proposed algorithm performs conditional (and not probable) crossover and mutation. Simulation results show that the proposed GA is capable of finding an optimal solution for the SSP. (C) 2003 Elsevier B.V. All rights reserved.
Keywords:
genetic algorithm
crossover
mutation
subset sum problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave