Sulabh Bansal

According to our database, Sulabh Bansal authored at least 8 papers between 2009 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2019

A Generalized Parallel Quantum Inspired Evolutionary Algorithm Framework for Hard Subset Selection Problems: A GPQIEA for Subset Selection.

Sulabh Bansal, C. Patvardhan

Int. J. Appl. Evol. Comput., 2019

2018

An Improved Generalized Quantum-Inspired Evolutionary Algorithm for Multiple Knapsack Problem.

Sulabh Bansal, C. Patvardhan

Int. J. Appl. Evol. Comput., 2018

2017

Towards the right amount of randomness in quantum-inspired evolutionary algorithms.

Chellapilla Patvardhan, Sulabh Bansal, Anand Srivastav

Soft Comput., 2017

2016

Parallel improved quantum inspired evolutionary algorithm to solve large size Quadratic Knapsack Problems.

C. Patvardhan, Sulabh Bansal, Anand Srivastav

Swarm Evol. Comput., 2016

2015

Quantum-Inspired Evolutionary Algorithm for difficult knapsack problems.

Chellapilla Patvardhan, Sulabh Bansal, Anand Srivastav

Memetic Comput., 2015

Solving the 0-1 Quadratic Knapsack Problem with a competitive Quantum Inspired Evolutionary Algorithm.

Chellapilla Patvardhan, Sulabh Bansal, Anand Srivastav

J. Comput. Appl. Math., 2015

2014

Solution of "Hard" Knapsack Instances Using Quantum Inspired Evolutionary Algorithm.

C. Patvardhan, Sulabh Bansal, Anand Srivastav

Int. J. Appl. Evol. Comput., 2014

2009

Is Stochastic Ranking Really better than Feasibility Rules for Constraint Handling in Evolutionary Algorithms?

Sulabh Bansal, Ashish Mani, Chellapilla Patvardhan

Proceedings of the World Congress on Nature & Biologically Inspired Computing, 2009