default search action
Hirad Assimi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c6]Hirad Assimi
, Frank Neumann
Novelty-Driven Binary Particle Swarm Optimisation for Truss Optimisation Problems. EvoCOP 2022: 111-126 - [c5]Hirad Assimi
Run-of-mine stockyard recovery scheduling and optimisation for multiple reclaimers. SAC 2022: 1074-1083 - 2021
- [j5]Rammohan Mallipeddi, Iman Gholaminezhad, Mohammad S. Saeedi, Hirad Assimi
Robust controller design for systems with probabilistic uncertain parameters using multi-objective genetic programming. Soft Comput. 25(1): 233-249 (2021) - [c4]Hirad Assimi
Novelty particle swarm optimisation for truss optimisation problems. GECCO Companion 2021: 67-68 - [c3]Hirad Assimi
Modelling and optimization of run-of-mine stockpile recovery. SAC 2021: 450-458 - [i4]Hirad Assimi, Frank Neumann, Markus Wagner, Xiaodong Li:
Novelty-Driven Binary Particle Swarm Optimisation for Truss Optimisation Problems. CoRR abs/2112.07875 (2021) - [i3]Hirad Assimi, Ben Koch, Chris Garcia, Markus Wagner, Frank Neumann:
Run-of-Mine Stockyard Recovery Scheduling and Optimisation for Multiple Reclaimers. CoRR abs/2112.12294 (2021) - 2020
- [c2]Hirad Assimi
Evolutionary Bi-Objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives. ECAI 2020: 307-314 - [i2]Hirad Assimi, Oscar Harper, Yue Xie, Aneta Neumann, Frank Neumann:
Evolutionary Bi-objective Optimization for the Dynamic Chance-Constrained Knapsack Problem Based on Tail Bound Objectives. CoRR abs/2002.06766 (2020)
2010 – 2019
- 2019
- [j4]Hirad Assimi
Multi-objective sizing and topology optimization of truss structures using genetic programming based on a new adaptive mutant operator. Neural Comput. Appl. 31(10): 5729-5749 (2019) - [c1]Yue Xie, Oscar Harper, Hirad Assimi
Evolutionary algorithms for the chance-constrained knapsack problem. GECCO 2019: 338-346 - [i1]Yue Xie, Oscar Harper, Hirad Assimi, Aneta Neumann, Frank Neumann:
Evolutionary Algorithms for the Chance-Constrained Knapsack Problem. CoRR abs/1902.04767 (2019) - 2018
- [j3]Hirad Assimi
A hybrid algorithm coupling genetic programming and Nelder-Mead for topology and size optimization of trusses with static and dynamic constraints. Expert Syst. Appl. 95: 127-141 (2018) - 2017
- [j2]Iman Gholaminezhad, Ali Jamali, Hirad Assimi
Multi-objective reliability-based robust design optimization of robot gripper mechanism with probabilistically uncertain parameters. Neural Comput. Appl. 28(S-1): 659-670 (2017) - [j1]Hirad Assimi
Sizing and topology optimization of truss structures using genetic programming. Swarm Evol. Comput. 37: 90-103 (2017)
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-04-24 22:52 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: