![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Mazhar Ansari Ardeh
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j3]Mazhar Ansari Ardeh
, Yi Mei
, Mengjie Zhang
, Xin Yao
:
Knowledge Transfer Genetic Programming With Auxiliary Population for Solving Uncertain Capacitated Arc Routing Problem. IEEE Trans. Evol. Comput. 27(2): 311-325 (2023) - 2022
- [j2]Mazhar Ansari Ardeh
, Yi Mei
, Mengjie Zhang
:
Genetic Programming With Knowledge Transfer and Guided Search for Uncertain Capacitated Arc Routing Problem. IEEE Trans. Evol. Comput. 26(4): 765-779 (2022) - 2021
- [c9]Mazhar Ansari Ardeh, Yi Mei
, Mengjie Zhang:
Surrogate-Assisted Genetic Programming with Diverse Transfer for the Uncertain Capacitated Arc Routing Problem. CEC 2021: 628-635 - [c8]Mazhar Ansari Ardeh
, Yi Mei
, Mengjie Zhang:
A novel multi-task genetic programming approach to uncertain capacitated Arc routing problem. GECCO 2021: 759-767 - [p1]Yi Mei
, Mazhar Ansari Ardeh, Mengjie Zhang:
Knowledge Transfer in Genetic Programming Hyper-heuristics. Automated Design of Machine Learning and Search Algorithms 2021: 149-169 - 2020
- [c7]Mazhar Ansari Ardeh
, Yi Mei
, Mengjie Zhang:
A Parametric Framework for Genetic Programming with Transfer Learning for Uncertain Capacitated Arc Routing Problem. Australasian Conference on Artificial Intelligence 2020: 150-162 - [c6]Mazhar Ansari Ardeh, Yi Mei
, Mengjie Zhang:
Genetic Programming Hyper-Heuristics with Probabilistic Prototype Tree Knowledge Transfer for Uncertain Capacitated Arc Routing Problems. CEC 2020: 1-8 - [c5]Mazhar Ansari Ardeh, Yi Mei
, Mengjie Zhang:
Diversity-driven Knowledge Transfer for GPHH to Solve Uncertain Capacitated Arc Routing Problem. SSCI 2020: 2407-2414 - [c4]Mazhar Ansari Ardeh, Yi Mei
, Mengjie Zhang:
A GPHH with Surrogate-assisted Knowledge Transfer for Uncertain Capacitated Arc Routing Problem. SSCI 2020: 2786-2793
2010 – 2019
- 2019
- [c3]Mazhar Ansari Ardeh, Yi Mei
, Mengjie Zhang:
Transfer Learning in Genetic Programming Hyper-heuristic for Solving Uncertain Capacitated Arc Routing Problem. CEC 2019: 49-56 - [c2]Mazhar Ansari Ardeh
, Yi Mei
, Mengjie Zhang:
Genetic programming hyper-heuristic with knowledge transfer for uncertain capacitated arc routing problem. GECCO (Companion) 2019: 334-335 - [c1]Mazhar Ansari Ardeh, Yi Mei
, Mengjie Zhang:
A Novel Genetic Programming Algorithm with Knowledge Transfer for Uncertain Capacitated Arc Routing Problem. PRICAI (1) 2019: 196-200 - 2017
- [j1]Mazhar Ansari Ardeh
, Mohammad Bagher Menhaj
, Ehsan Esmailian, Hessam Zandhessami:
EXPLICA: An Explorative Imperialist Competitive Algorithm based on the notion of Explorers with an expansive retention policy. Appl. Soft Comput. 54: 74-92 (2017)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-05 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint