Home > Computer Science > Other > Volume-1 > Issue-4 > Clustered Genetic Algorithm to solve Multidimensional Knapsack Problem

Clustered Genetic Algorithm to solve Multidimensional Knapsack Problem

Call for Papers

Volume-8 | Advancing Multidisciplinary Research and Analysis - Exploring Innovations

Last date : 28-Mar-2024

Best International Journal
Open Access | Peer Reviewed | Best International Journal | Indexing & IF | 24*7 Support | Dedicated Qualified Team | Rapid Publication Process | International Editor, Reviewer Board | Attractive User Interface with Easy Navigation

Journal Type : Open Access

First Update : Within 7 Days after submittion

Submit Paper Online

For Author

Research Area


Clustered Genetic Algorithm to solve Multidimensional Knapsack Problem


Dr. Prabha Shreeraj Nair

https://doi.org/10.31142/ijtsrd2237



Dr. Prabha Shreeraj Nair "Clustered Genetic Algorithm to solve Multidimensional Knapsack Problem" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-4, June 2017, pp.737-745, URL: https://www.ijtsrd.com/papers/ijtsrd2237.pdf

Genetic Algorithm (GA) has emerged as a powerful tool to discover optimal for multidimensional knapsack problem (MDKP). Multidimensional knapsack problem has recognized as NP-hard problem whose applications in many areas like project selection, capital budgeting, loading problems, cutting stock etc. Attempts has made to develop cluster genetic algorithm (CGA) by mean of modified selection and modified crossover operators of GA. Clustered genetic algorithm consist of (1) fuzzy roulette wheel selection for individual selection to form the mating pool (2) A different kind of crossover operator which employ hierarchical clustering method to form two clusters from individuals of mating pool. CGA performance has examined against GA with respect to 30 benchmark problems for multi-dimensional knapsack. Experimental results show that CGA has significant improvement over GA in relation to discover optimal and CPU running time. The data set for MDKP

Multidimensional knapsack problem, Genetic algo-rithm, Fitness function, Crossover, Mutation


IJTSRD2237
Volume-1 | Issue-4, June 2017
737-745
IJTSRD | www.ijtsrd.com | E-ISSN 2456-6470
Copyright © 2019 by author(s) and International Journal of Trend in Scientific Research and Development Journal. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0) (http://creativecommons.org/licenses/by/4.0)

International Journal of Trend in Scientific Research and Development - IJTSRD having online ISSN 2456-6470. IJTSRD is a leading Open Access, Peer-Reviewed International Journal which provides rapid publication of your research articles and aims to promote the theory and practice along with knowledge sharing between researchers, developers, engineers, students, and practitioners working in and around the world in many areas like Sciences, Technology, Innovation, Engineering, Agriculture, Management and many more and it is recommended by all Universities, review articles and short communications in all subjects. IJTSRD running an International Journal who are proving quality publication of peer reviewed and refereed international journals from diverse fields that emphasizes new research, development and their applications. IJTSRD provides an online access to exchange your research work, technical notes & surveying results among professionals throughout the world in e-journals. IJTSRD is a fastest growing and dynamic professional organization. The aim of this organization is to provide access not only to world class research resources, but through its professionals aim to bring in a significant transformation in the real of open access journals and online publishing.

Thomson Reuters
Google Scholer
Academia.edu

ResearchBib
Scribd.com
archive

PdfSR
issuu
Slideshare

WorldJournalAlerts
Twitter
Linkedin