default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShelvin Chand
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i2]Shelvin Chand, Kousik Rajesh, Rohitash Chandra:
MAP-Elites based Hyper-Heuristic for the Resource Constrained Project Scheduling Problem. CoRR abs/2204.11162 (2022)- 2021
- [j7]Jack Collins
, Shelvin Chand, Anthony Vanderkop, David Howard:
A Review of Physics Simulators for Robotic Applications. IEEE Access 9: 51416-51431 (2021) - [j6]Shelvin Chand, David Howard:
Multi-Level Evolution for Robotic Design. Frontiers Robotics AI 8: 684304 (2021) - 2020
- [c9]Shelvin Chand, David Howard:
Path towards multilevel evolution of robots. GECCO Companion 2020: 1381-1382 - [i1]Shelvin Chand, David Howard:
Path Towards Multilevel Evolution of Robots. CoRR abs/2006.03266 (2020)
2010 – 2019
- 2019
- [j5]Shelvin Chand, Hemant K. Singh, Tapabrata Ray:
Evolving heuristics for the resource constrained project scheduling problem with dynamic resource disruptions. Swarm Evol. Comput. 44: 897-912 (2019) - [j4]Shelvin Chand, Hemant K. Singh, Tapabrata Ray:
Evolving rollout-justification based heuristics for resource constrained project scheduling problems. Swarm Evol. Comput. 50 (2019) - [c8]Shelvin Chand, Hemant Kumar Singh, Tapabrata Ray, Michael J. Ryan:
Rollout based Heuristics for the Quantum Circuit Compilation Problem. CEC 2019: 974-981 - 2018
- [b1]Shelvin Chand:
Automated Design of Heuristics for the Resource Constrained Project Scheduling Problem. University of New South Wales, Sydney, Australia, 2018 - [j3]Shelvin Chand, Quang Nhat Huynh, Hemant K. Singh, Tapabrata Ray, Markus Wagner:
On the use of genetic programming to evolve priority rules for resource constrained project scheduling problems. Inf. Sci. 432: 146-163 (2018) - [j2]Quang Nhat Huynh, Shelvin Chand, Hemant Kumar Singh, Tapabrata Ray:
Genetic Programming With Mixed-Integer Linear Programming-Based Library Search. IEEE Trans. Evol. Comput. 22(5): 733-747 (2018) - [c7]Shelvin Chand, Hemant Kumar Singh, Tapabrata Ray:
Team Selection Using Multi-/Many-Objective Optimization with Integer Linear Programming. CEC 2018: 1-8 - 2017
- [c6]Shelvin Chand, Hemant Kumar Singh, Tapabrata Ray:
A heuristic algorithm for solving resource constrained project scheduling problems. CEC 2017: 225-232 - [c5]Mohamed El Yafrani, Shelvin Chand, Aneta Neumann, Belaïd Ahiod, Markus Wagner:
Multi-objectiveness in the single-objective traveling thief problem. GECCO (Companion) 2017: 107-108 - 2016
- [j1]Rohitash Chandra, Shelvin Chand:
Evaluation of co-evolutionary neural network architectures for time series prediction with mobile application in finance. Appl. Soft Comput. 49: 462-473 (2016) - [c4]Shelvin Chand, Hemant Kumar Singh, Tapabrata Ray:
Finding robust solutions for resource constrained project scheduling problems involving uncertainties. CEC 2016: 225-232 - [c3]Shelvin Chand, Markus Wagner:
Fast Heuristics for the Multiple Traveling Thieves Problem. GECCO 2016: 293-300 - 2014
- [c2]Shelvin Chand, Rohitash Chandra:
Multi-objective cooperative coevolution of neural networks for time series prediction. IJCNN 2014: 190-197 - [c1]Shelvin Chand, Rohitash Chandra:
Cooperative coevolution of feed forward neural networks for financial time series problem. IJCNN 2014: 202-209
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
