Abstract
Abstract:A New Genetic Algorithm (NGA) for solving the Multiple Choice MultidimensionalKnapsack Problem (MMKP) is presented in this paper. The MMKP can be applied tosolve a wide variety of real life problems i.e., in any area where tasks must be scheduledor budgeted. This paper introduces NGA algorithm that hybridize the solutionconstruction mechanism of GA operators (hybrid selection operator, hybrid cross-overoperator and new hybrid mutation operator) for permutation encoding genetic algorithm.In addition we present a strong initial population is created by the Maximizing Valueper Resources Consumption (MVRC) heuristic algorithm. The experimental resultsshow that the method is very efficient and competitive to solve the MMKP comparedwith the better existing methods
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
