পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| জেনেটিক অ্যালগরিদম× | মিশ্র-পূর্ণসংখ্যা প্রোগ্রামিং× | |
|---|---|---|
| ক্ষেত্র≠ | অনুকূলকরণ | অনুকরণ |
| পরিবার | Process / pipeline | Process / pipeline |
| উদ্ভবের বছর≠ | 1975 | 1958–1960 |
| প্রবর্তক≠ | John Henry Holland | Ralph Gomory (branch-and-bound cuts, 1958); Land & Doig (branch-and-bound, 1960) |
| ধরন≠ | Population-based metaheuristic | Mathematical optimization |
| মৌলিক উৎস≠ | Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press. link ↗ | Nemhauser, G. L., Wolsey, L. A. (1988). Integer and Combinatorial Optimization. Wiley-Interscience, New York. ISBN: 9780471359432 |
| অপর নাম≠ | GA, evolutionary algorithm, Genetik Algoritma — Evrimsel Optimizasyon | MIP, Mixed-Integer Linear Programming, MILP, Integer Programming |
| সম্পর্কিত≠ | 5 | 6 |
| সারসংক্ষেপ≠ | A genetic algorithm (GA) is a population-based metaheuristic optimization method introduced by John Henry Holland (1975) that mimics the principles of natural selection. It maintains a population of candidate solutions and iteratively improves them through selection, crossover, and mutation operators, making it especially powerful on discontinuous, non-convex, and multi-modal search spaces where classical gradient-based methods fail. | Mixed-Integer Programming (MIP) is a mathematical optimization framework in which some decision variables must take integer values while others may be continuous. It generalizes linear programming and is widely used in operations research, logistics, scheduling, resource allocation, and engineering design, where indivisibility constraints — such as yes/no decisions or whole-unit quantities — arise naturally. |
| ScholarGateডেটাসেট ↗ |
|
|