Sudhir B. Jagtap

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper a hybrid parallel multi-objective genetic algorithm is proposed for solving 0/1 knapsack problem. Multi-objective problems with non-convex and discrete Pareto front can take enormous computation time to converge to the true Pareto front. Hence, the classical multi-objective genetic algorithms (MOGAs) (i.e., non-Parallel MOGAs) may fail to(More)
  • 1