default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAhmed Kheiri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Istenç Tarhan
, Konstantinos G. Zografos, Juliana Sutanto, Ahmed Kheiri:
A quadrant shrinking heuristic for solving the dynamic multi-objective disaster response personnel routing and scheduling problem. Eur. J. Oper. Res. 314(2): 776-791 (2024)- [j16]Yaroslav Pylyavskyy, Peter Jacko, Ahmed Kheiri:
A generic approach to conference scheduling with integer programming. Eur. J. Oper. Res. 317(2): 487-499 (2024) - [c16]Ahmed Kheiri, Yaroslav Pylyavskyy, Peter Jacko:
Efficient Scheduling of GECCO Conferences using Hyper-heuristic Algorithms. GECCO Companion 2024: 1732-1737 - 2023
- [c15]Danielle Notice, Ahmed Kheiri, Nicos G. Pavlidis:
The Algorithm Selection Problem for Solving Sudoku with Metaheuristics. CEC 2023: 1-8 - 2022
- [j15]Jerry Swan, Steven Adriænsen, Alexander E. I. Brownlee, Kevin Hammond, Colin G. Johnson, Ahmed Kheiri, Faustyna Krawiec, Juan Julián Merelo, Leandro L. Minku, Ender Özcan, Gisele L. Pappa, Pablo García-Sánchez, Kenneth Sörensen, Stefan Voß, Markus Wagner, David R. White:
Metaheuristics "In the Large". Eur. J. Oper. Res. 297(2): 393-406 (2022) - [c14]Ahmed Kheiri, Edward C. Keedwell:
Selection hyper-heuristics. GECCO Companion 2022: 983-996 - 2021
- [j14]Ahmed Kheiri, Angeliki Gretsista, Ed Keedwell, Guglielmo Lulli, Michael G. Epitropakis, Edmund K. Burke:
A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem. Comput. Oper. Res. 130: 105221 (2021) - [c13]Burak Boyaci, Muhammad Ali Nayeem, Ahmed Kheiri:
A matheuristic approach for finding effective base locations and team configurations for north west air ambulance. GECCO Companion 2021: 1817-1824 - 2020
- [j13]John H. Drake, Ahmed Kheiri, Ender Özcan, Edmund K. Burke:
Recent advances in selection hyper-heuristics. Eur. J. Oper. Res. 285(2): 405-428 (2020) - [j12]Ahmed Kheiri, Leena N. Ahmed, Burak Boyaci, Joaquim A. S. Gromicho, Christine L. Mumford, Ender Özcan, Ali Selim Dirikoç:
Exact and hyper-heuristic solutions for the distribution-installation problem from the VeRoLog 2019 challenge. Networks 76(2): 294-319 (2020) - [j11]Ahmed Kheiri:
Heuristic Sequence Selection for Inventory Routing Problem. Transp. Sci. 54(2): 302-312 (2020) - [c12]Yaroslav Pylyavskyy, Ahmed Kheiri, Leena N. Ahmed:
A Reinforcement Learning Hyper-heuristic for the optimisation of Flight Connections. CEC 2020: 1-8 - [i2]Jerry Swan, Steven Adriænsen, Alexander E. I. Brownlee, Colin G. Johnson, Ahmed Kheiri, Faustyna Krawiec, Juan Julián Merelo Guervós, Leandro L. Minku, Ender Özcan, Gisele L. Pappa, Pablo García-Sánchez, Kenneth Sörensen, Stefan Voß, Markus Wagner, David Robert White:
Towards Metaheuristics "In the Large". CoRR abs/2011.09821 (2020)
2010 – 2019
- 2019
- [j10]Ahmed Kheiri, Alina G. Dragomir, David Mueller, Joaquim A. S. Gromicho, Caroline J. Jagtenberg, Jelke J. van Hoorn:
Tackling a VRP challenge to redistribute scarce equipment within time windows using metaheuristic algorithms. EURO J. Transp. Logist. 8(5): 561-595 (2019) - [j9]Leena N. Ahmed, Christine L. Mumford, Ahmed Kheiri:
Solving urban transit route design problem using selection hyper-heuristics. Eur. J. Oper. Res. 274(2): 545-559 (2019) - [c11]Ahmed Kheiri, Konstantinos G. Zografos:
Modelling and solving the combined inventory routing problem with risk consideration. GECCO (Companion) 2019: 57-58 - 2018
- [c10]Dennis G. Wilson, Silvio Rodrigues, Carlos Segura, Ilya Loshchilov, Frank Hutter, Guillermo López Buenfil, Ahmed Kheiri, Ed Keedwell, Mario Ocampo-Pineda, Ender Özcan, Sergio Iwan Valdez Pea, Brian Goldman, Salvador Botello Rionda, Arturo Hernández Aguirre, Kalyan Veeramachaneni, Sylvain Cussat-Blanc:
Summary of evolutionary computation for wind farm layout optimization. GECCO (Companion) 2018: 31-32 - 2017
- [j8]Ahmed Kheiri, Ed Keedwell:
A Hidden Markov Model Approach to the Problem of Heuristic Selection in Hyper-Heuristics with a Case Study in High School Timetabling Problems. Evol. Comput. 25(3): 473-501 (2017) - 2016
- [j7]Ahmed Kheiri, Ender Özcan, Andrew J. Parkes:
A stochastic local search algorithm with adaptive acceptance for high-school timetabling. Ann. Oper. Res. 239(1): 135-151 (2016) - [j6]Ahmed Kheiri, Ender Özcan:
An iterated multi-stage selection hyper-heuristic. Eur. J. Oper. Res. 250(1): 77-90 (2016) - [j5]Shahriar Asta, Daniel Karapetyan, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes:
Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem. Inf. Sci. 373: 476-498 (2016) - [c9]Ahmed Kheiri, Mustafa Misir, Ender Özcan:
Ensemble Move Acceptance in Selection Hyper-heuristics. ISCIS 2016: 21-29 - [c8]Alhanof Almutairi, Ender Özcan, Ahmed Kheiri, Warren G. Jackson:
Performance of Selection Hyper-heuristics on the Extended HyFlex Domains. ISCIS 2016: 154-162 - 2015
- [j4]Ahmed Kheiri, Ender Özcan:
Corrigendum: Constructing Constrained-Version of Magic Squares Using Selection Hyper-heuristics. Comput. J. 58(8): 1857 (2015) - [j3]Leena N. Ahmed, Ender Özcan, Ahmed Kheiri:
Solving high school timetabling problems worldwide using selection hyper-heuristics. Expert Syst. Appl. 42(13): 5463-5471 (2015) - [c7]Ahmed Kheiri, Ed Keedwell:
A Sequence-based Selection Hyper-heuristic Utilising a Hidden Markov Model. GECCO 2015: 417-424 - [i1]Shahriar Asta, Daniel Karapetyan, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes:
Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem. CoRR abs/1511.04387 (2015) - 2014
- [b1]Ahmed Kheiri:
Multi-stage hyper-heuristics for optimisation problems. University of Nottingham, UK, 2014 - [j2]Ahmed Kheiri, Ender Özcan:
Constructing Constrained-Version of Magic Squares Using Selection Hyper-heuristics. Comput. J. 57(3): 469-479 (2014) - 2013
- [j1]Murat Kalender, Ahmed Kheiri, Ender Özcan, Edmund K. Burke:
A greedy gradient-simulated annealing selection hyper-heuristic. Soft Comput. 17(12): 2279-2292 (2013) - [c6]Ahmed Kheiri, Ender Özcan:
A Hyper-heuristic with a Round Robin Neighbourhood Selection. EvoCOP 2013: 1-12 - [c5]Moh'd Khaled Yousef Shambour, Ahamad Tajudin Khader, Ahmed Kheiri, Ender Özcan:
A Two Stage Approach for High School Timetabling. ICONIP (1) 2013: 66-73 - [c4]Ender Ozcan, Mustafa Misir, Ahmed Kheiri:
Group decision making hyper-heuristics for function optimisation. UKCI 2013: 327-333 - 2012
- [c3]Murat Kalender, Ahmed Kheiri, Ender Ozcan, Edmund K. Burke:
A greedy gradient-simulated annealing hyper-heuristic for a curriculum-based course timetabling problem. UKCI 2012: 1-8 - 2011
- [c2]Guoping Qiu, Ahmed Kheiri:
Social image quality. IQSP 2011: 78670S - [c1]Ender Özcan, Ahmed Kheiri:
A Hyper-Heuristic Based on Random Gradient, Greedy and Dominance. ISCIS 2011: 557-563
Coauthor Index
aka: Ender Ozcan
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-23 19:27 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:
