default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBelaïd Ahiod
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j11]Marcella S. R. Martins, Mohamed El Yafrani
, Myriam Regattieri Delgado, Ricardo Lüders, Roberto Santana, Hugo Valadares Siqueira, Huseyin Gokhan Akcay, Belaïd Ahiod:
Analysis of Bayesian Network Learning Techniques for a Hybrid Multi-objective Bayesian Estimation of Distribution Algorithm: a case study on MNK Landscape. J. Heuristics 27(4): 549-573 (2021)- [j10]Mehdi El Krari, Belaïd Ahiod, Bouazza El Benani:
A pre-processing reduction method for the generalized travelling salesman problem. Oper. Res. 21(4): 2543-2591 (2021) - 2020
- [j9]Mehdi El Krari, Belaïd Ahiod, Bouazza El Benani:
A Memetic Algorithm Based on Breakout Local Search for the Generalized Traveling Salesman Problem. Appl. Artif. Intell. 34(7): 537-549 (2020) - 2018
- [j8]Asmae El Ghazi, Belaïd Ahiod:
Energy efficient teaching-learning-based optimization for the discrete routing problem in wireless sensor networks. Appl. Intell. 48(9): 2755-2769 (2018) - [j7]Mehdi El Krari, Belaïd Ahiod, Bouazza El Benani:
Breakout Local Search for the Travelling Salesman Problem. Comput. Informatics 37(3): 656-672 (2018) - [j6]Mohcin Allaoui, Belaïd Ahiod, Mohamed El Yafrani:
A hybrid crow search algorithm for solving the DNA fragment assembly problem. Expert Syst. Appl. 102: 44-56 (2018) - [j5]Mohamed El Yafrani, Marcella S. R. Martins, Markus Wagner, Belaïd Ahiod, Myriam Regattieri Delgado, Ricardo Lüders:
A hyperheuristic approach based on low-level heuristics for the travelling thief problem. Genet. Program. Evolvable Mach. 19(1-2): 121-150 (2018) - [j4]Mohamed El Yafrani, Belaïd Ahiod:
Efficiently solving the Traveling Thief Problem using hill climbing and simulated annealing. Inf. Sci. 432: 231-244 (2018) - 2017
- [j3]Mohamed El Yafrani, Belaïd Ahiod:
A local search based approach for solving the Travelling Thief Problem: The pros and cons. Appl. Soft Comput. 52: 795-804 (2017) - 2015
- [j2]Aziz Ouaarab, Belaïd Ahiod, Xin-She Yang:
Random-key cuckoo search for the travelling salesman problem. Soft Comput. 19(4): 1099-1106 (2015) - 2014
- [j1]Aziz Ouaarab, Belaïd Ahiod, Xin-She Yang:
Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput. Appl. 24(7-8): 1659-1669 (2014)
Conference and Workshop Papers
- 2020
- [c13]Lina Leghrari, Noussaima El Khattabi, Belaïd Ahiod, Youssef Elbenani:
Mining Tourism as An Orienteering Problem: A Real-World Data Case. GOL 2020: 1-5 - [c12]Brahim Aboutaib, Sébastien Vérel, Cyril Fonlupt, Bilel Derbel, Arnaud Liefooghe, Belaïd Ahiod:
On Stochastic Fitness Landscapes: Local Optimality and Fitness Landscape Analysis for Stochastic Search Operators. PPSN (2) 2020: 97-110 - 2018
- [c11]Marcella S. R. Martins, Mohamed El Yafrani, Roberto Santana, Myriam Regattieri Delgado, Ricardo Lüders, Belaïd Ahiod:
On the Performance of Multi-Objective Estimation of Distribution Algorithms for Combinatorial Problems. CEC 2018: 1-8 - [c10]Mohamed El Yafrani, Marcella S. R. Martins, Mehdi El Krari, Markus Wagner, Myriam Regattieri de Biase da Silva Delgado, Belaïd Ahiod, Ricardo Lüders:
A fitness landscape analysis of the travelling thief problem. GECCO 2018: 277-284 - 2017
- [c9]Mehdi El Krari, Belaïd Ahiod, Bouazza El Benani:
A novel reduction algorithm for the generalized traveling salesman problem. GECCO (Companion) 2017: 105-106 - [c8]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
- [c7]Asmae El Ghazi, Belaïd Ahiod:
Impact of Random Waypoint Mobility Model on Ant-based Routing Protocol for Wireless Sensor Networks. BDAW 2016: 61:1-61:4 - [c6]Mohamed El Yafrani, Belaïd Ahiod:
Population-based vs. Single-solution Heuristics for the Travelling Thief Problem. GECCO 2016: 317-324 - [c5]Mehdi El Krari, Belaïd Ahiod, Bouazza El Benani:
An Empirical Study of the Multi-fragment Tour Construction Algorithm for the Travelling Salesman Problem. HIS 2016: 278-287 - [c4]Mehdi El Krari, Belaïd Ahiod, Bouazza El Benani:
Using Cluster Barycenters for the Generalized Traveling Salesman Problem. ISDA 2016: 135-143 - 2015
- [c3]Mohamed El Yafrani, Belaïd Ahiod:
Cosolver2B: An efficient local search heuristic for the Travelling Thief Problem. AICCSA 2015: 1-5 - 2014
- [c2]Aziz Ouaarab, Belaïd Ahiod, Xin-She Yang, Mohammed Abbad:
Discrete Cuckoo Search algorithm for job shop scheduling problem. ISIC 2014: 1872-1876 - [c1]Asmae El Ghazi, Belaïd Ahiod, Aziz Ouaarab:
Improved Ant Colony Optimization Routing Protocol for Wireless Sensor Networks. NETYS 2014: 246-256
Parts in Books or Collections
- 2015
- [p1]Aziz Ouaarab, Belaïd Ahiod, Xin-She Yang:
Discrete Cuckoo Search Applied to Job Shop Scheduling Problem. Recent Advances in Swarm Intelligence and Evolutionary Computation 2015: 121-137
Informal and Other Publications
- 2019
- [i5]Mehdi El Krari, Belaïd Ahiod:
A Memetic Algorithm Based on Breakout Local Search for the Generalized Travelling Salesman Problem. CoRR abs/1911.01966 (2019) - 2018
- [i4]Marcella S. R. Martins, Mohamed El Yafrani, Roberto Santana, Myriam Regattieri Delgado, Ricardo Lüders, Belaïd Ahiod:
On the performance of multi-objective estimation of distribution algorithms for combinatorial problems. CoRR abs/1806.09935 (2018) - 2016
- [i3]Mohamed El Yafrani, Belaïd Ahiod:
Cosolver2B: An Efficient Local Search Heuristic for the Travelling Thief Problem. CoRR abs/1603.07051 (2016) - [i2]Mohamed El Yafrani, Belaïd Ahiod:
Étude de Problèmes d'Optimisation Combinatoire à Multiples Composantes Interdépendantes. CoRR abs/1606.06797 (2016) - [i1]Aziz Ouaarab, Belaïd Ahiod, Xin-She Yang:
Random-Key Cuckoo Search for the Travelling Salesman Problem. CoRR abs/1607.04324 (2016)
Coauthor Index
aka: Myriam Regattieri de Biase da Silva Delgado
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 23: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:
