default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSamadhi Nallaperuma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j8]Wanru Gao, Samadhi Nallaperuma, Frank Neumann:
Feature-Based Diversity Optimization for Problem Instance Classification. Evol. Comput. 29(1): 107-128 (2021)- [j7]Shahin Jalili
, Samadhi Nallaperuma, Edward C. Keedwell, Alex Dawn, Laurence Oakes-Ash:
Application of metaheuristics for signal optimisation in transportation networks: A comprehensive survey. Swarm Evol. Comput. 63: 100865 (2021)
2010 – 2019
- 2019
- [j6]Samadhi Nallaperuma, Pietro S. Oliveto, Jorge Pérez Heredia, Dirk Sudholt:
On the Analysis of Trajectory-Based Search Algorithms: When is it Beneficial to Reject Improvements? Algorithmica 81(2): 858-885 (2019) - 2018
- [j5]Markus Wagner, Marius Lindauer, Mustafa Misir, Samadhi Nallaperuma, Frank Hutter:
A case study of algorithm selection for the traveling thief problem. J. Heuristics 24(3): 295-320 (2018) - [c12]David I. Fletcher, Robert F. Harrison, Twin Karmakharm, Samadhi Nallaperuma, Paul Richmond:
RateSetter: roadmap for faster, safer, and better platform train interface design and operation using evolutionary optimisation. GECCO 2018: 1230-1237 - 2017
- [j4]Samadhi Nallaperuma, Frank Neumann, Dirk Sudholt:
Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem. Evol. Comput. 25(4) (2017) - [j3]Mohammad Reza Bonyadi, Zbigniew Michalewicz, Samadhi Nallaperuma, Frank Neumann:
Ahura: A Heuristic-Based Racer for the Open Racing Car Simulator. IEEE Trans. Comput. Intell. AI Games 9(3): 290-304 (2017) - [c11]Samadhi Nallaperuma, Pietro S. Oliveto, Jorge Pérez Heredia, Dirk Sudholt:
When is it beneficial to reject improvements? GECCO 2017: 1391-1398 - 2016
- [c10]Tobias Friedrich, Timo Kötzing, Martin S. Krejca, Samadhi Nallaperuma, Frank Neumann, Martin Schirneck:
Fast Building Block Assembly by Majority Vote Crossover. GECCO 2016: 661-668 - [c9]Vanessa Volz, Samadhi Nallaperuma, Boris Naujoks:
GECCO'16 Student Workshop Chairs' Welcome & Organization. GECCO (Companion) 2016: 991-992 - [c8]Wanru Gao, Samadhi Nallaperuma, Frank Neumann:
Feature-Based Diversity Optimization for Problem Instance Classification. PPSN 2016: 869-879 - [i2]Markus Wagner, Marius Lindauer, Mustafa Misir, Samadhi Nallaperuma, Frank Hutter:
A case study of algorithm selection for the traveling thief problem. CoRR abs/1609.00462 (2016) - 2015
- [j2]Samadhi Nallaperuma, Markus Wagner, Frank Neumann:
Analyzing the Effects of Instance Features and Algorithm Parameters for Max-Min Ant System and the Traveling Salesperson Problem. Frontiers Robotics AI 2: 18 (2015) - [i1]Wanru Gao, Samadhi Nallaperuma, Frank Neumann:
Feature-Based Diversity Optimization for Problem Instance Classification. CoRR abs/1510.08568 (2015) - 2014
- [j1]Andrew M. Sutton, Frank Neumann, Samadhi Nallaperuma:
Parameterized Runtime Analyses of Evolutionary Algorithms for the Planar Euclidean Traveling Salesperson Problem. Evol. Comput. 22(4): 595-628 (2014) - [c7]Samadhi Nallaperuma, Frank Neumann, Mohammad Reza Bonyadi, Zbigniew Michalewicz:
EVOR: an online evolutionary algorithm for car racing games. GECCO 2014: 317-324 - [c6]Samadhi Nallaperuma, Frank Neumann, Dirk Sudholt:
A fixed budget analysis of randomized search heuristics for the traveling salesperson problem. GECCO 2014: 807-814 - [c5]Samadhi Nallaperuma, Markus Wagner, Frank Neumann:
Parameter Prediction Based on Features of Evolved Instances for Ant Colony Optimization and the Traveling Salesperson Problem. PPSN 2014: 100-109 - 2013
- [c4]Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann:
Fixed-parameter evolutionary algorithms for the Euclidean Traveling Salesperson problem. IEEE Congress on Evolutionary Computation 2013: 2037-2044 - [c3]Samadhi Nallaperuma, Andrew M. Sutton, Frank Neumann:
Parameterized complexity analysis and more effective construction methods for ACO algorithms and the euclidean traveling salesperson problem. IEEE Congress on Evolutionary Computation 2013: 2045-2052 - [c2]Samadhi Nallaperuma, Markus Wagner, Frank Neumann, Bernd Bischl, Olaf Mersmann, Heike Trautmann:
A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem. FOGA 2013: 147-160 - [c1]Samadhi Nallaperuma, Markus Wagner, Frank Neumann:
Ant colony optimisation and the traveling salesperson problem: hardness, features and parameter settings. GECCO (Companion) 2013: 13-14
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 2024-10-07 22:19 CEST 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:
