Skip to main content

Research Repository

Advanced Search

All Outputs (97)

An analysis of the Taguchi method for tuning a memetic algorithm with reduced computational time budget (2016)
Conference Proceeding
Gümüş, D. B., Özcan, E., & Atkin, J. (2016). An analysis of the Taguchi method for tuning a memetic algorithm with reduced computational time budget. In Computer and information sciences: 31st International Symposium, ISCIS 2016, Kraków, Poland, October 27–28, 2016, proceedings (12–20). https://doi.org/10.1007/978-3-319-47217-1_2

Determining the best initial parameter values for an algorithm, called parameter tuning, is crucial to obtaining better algorithm performance; however, it is often a time-consuming task and needs to be performed under a restricted computational budge... Read More about An analysis of the Taguchi method for tuning a memetic algorithm with reduced computational time budget.

Ensemble move acceptance in selection hyper-heuristics (2016)
Conference Proceeding
Kheiri, A., Mısır, M., & Özcan, E. (2016). Ensemble move acceptance in selection hyper-heuristics. In Computer and information sciences: 31st International Symposium, ISCIS 2016, Kraków, Poland, October 27–28, 2016, proceedings (21–29). https://doi.org/10.1007/978-3-319-47217-1_3

Selection hyper-heuristics are high level search methodologies which control a set of low level heuristics while solving a given problem. Move acceptance is a crucial component of selection hyper-heuristics, deciding whether to accept or reject a new... Read More about Ensemble move acceptance in selection hyper-heuristics.

Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem (2016)
Journal Article
Asta, S., Karapetyan, D., Kheiri, A., Özcan, E., & Parkes, A. J. (2016). Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem. Information Sciences, 373, 476-498. https://doi.org/10.1016/j.ins.2016.09.010

Multi-mode resource and precedence-constrained project scheduling is a well-known challenging real-world optimisation problem. An important variant of the problem requires scheduling of activities for multiple projects considering availability of loc... Read More about Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem.

A self-adaptive multimeme memetic algorithm co-evolving utility scores to control genetic operators and their parameter settings (2016)
Journal Article
Özcan, E., Drake, J. H., Altıntaş, C., & Asta, S. (2016). A self-adaptive multimeme memetic algorithm co-evolving utility scores to control genetic operators and their parameter settings. Applied Soft Computing, 49, https://doi.org/10.1016/j.asoc.2016.07.032

Memetic algorithms are a class of well-studied metaheuristics which combine evolutionary algorithms and local search techniques. A meme represents contagious piece of information in an adaptive information sharing system. The canonical memetic algori... Read More about A self-adaptive multimeme memetic algorithm co-evolving utility scores to control genetic operators and their parameter settings.

A comparative study of fuzzy parameter control in a general purpose local search metaheuristic (2016)
Conference Proceeding
Jackson, W. G., Özcan, E., & John, R. I. (2016). A comparative study of fuzzy parameter control in a general purpose local search metaheuristic. . https://doi.org/10.1109/CEC.2016.7743787

There is a growing number of studies on general purpose metaheuristics that are directly applicable to multiple domains. Parameter setting is a particular issue considering that many of such search methods come with a set of... Read More about A comparative study of fuzzy parameter control in a general purpose local search metaheuristic.

Automatically designing more general mutation operators of Evolutionary Programming for groups of function classes using a hyper-heuristic (2016)
Conference Proceeding
Hong, L., Drake, J. H., Woodward, J. R., & Özcan, E. (2016). Automatically designing more general mutation operators of Evolutionary Programming for groups of function classes using a hyper-heuristic. In Proceedings of the 2016 on Genetic and Evolutionary Computation Conference - GECCO '16 (725-732). https://doi.org/10.1145/2908812.2908958

In this study we use Genetic Programming (GP) as an offline hyper-heuristic to evolve a mutation operator for Evolutionary Programming. This is done using the Gaussian and uniform distributions as the terminal set, and arithmetic operators as the fun... Read More about Automatically designing more general mutation operators of Evolutionary Programming for groups of function classes using a hyper-heuristic.

CHAMP: Creating Heuristics via Many Parameters for online bin packing (2016)
Journal Article
Asta, S., Özcan, E., & Parkes, A. J. (2016). CHAMP: Creating Heuristics via Many Parameters for online bin packing. Expert Systems with Applications, 63, 208-221. https://doi.org/10.1016/j.eswa.2016.07.005

The online bin packing problem is a well-known bin packing variant which requires immediate decisions to be made for the placement of a lengthy sequence of arriving items of various sizes one at a time into fixed capacity bins without any overflow. T... Read More about CHAMP: Creating Heuristics via Many Parameters for online bin packing.

A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem (2016)
Journal Article
Drake, J. H., Özcan, E., & Burke, E. (2016). A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem. Evolutionary Computation, 24(1), 113-141. https://doi.org/10.1162/EVCO_a_00145

© 2016 by the Massachusetts Institute of Technology. Hyper-heuristics are high-level methodologies for solving complex problems that operate on a search space of heuristics. In a selection hyper-heuristic framework, a heuristic is chosen from an exis... Read More about A Case Study of Controlling Crossover in a Selection Hyper-heuristic Framework Using the Multidimensional Knapsack Problem.

A multi-agent based cooperative approach to scheduling and routing (2016)
Journal Article
Martin, S., Ouelhadj, D., Beullens, P., Ozcan, E., Juan, A. A., & Burke, E. (2016). A multi-agent based cooperative approach to scheduling and routing. European Journal of Operational Research, 254(1), 169-178. https://doi.org/10.1016/j.ejor.2016.02.045

In this study, we propose a general agent-based distributed framework where each agent is implementing a different metaheuristic/local search combination. Moreover, an agent continuously adapts itself during the search process using a direct cooperat... Read More about A multi-agent based cooperative approach to scheduling and routing.

Iterated local search using an add and delete hyper- heuristic for university course timetabling (2016)
Journal Article
Soria-Alcaraz, J. A., Özcan, E., Swan, J., Kendall, G., & Carpio, M. (2016). Iterated local search using an add and delete hyper- heuristic for university course timetabling. Applied Soft Computing, 40, https://doi.org/10.1016/j.asoc.2015.11.043

Hyper-heuristics are (meta-)heuristics that operate at a higher level to choose or generate a set of low-level (meta-)heuristics in an attempt of solve difficult optimization problems. Iterated local search (ILS) is a well-known approach for discrete... Read More about Iterated local search using an add and delete hyper- heuristic for university course timetabling.

A tensor based hyper-heuristic for nurse rostering (2016)
Journal Article
Asta, S., Özcan, E., & Curtois, T. (2016). A tensor based hyper-heuristic for nurse rostering. Knowledge-Based Systems, 98, https://doi.org/10.1016/j.knosys.2016.01.031

Nurse rostering is a well-known highly constrained scheduling problem requiring assignment of shifts to nurses satisfying a variety of constraints. Exact algorithms may fail to produce high quality solutions, hence (meta)heuristics are commonly prefe... Read More about A tensor based hyper-heuristic for nurse rostering.

An iterated multi-stage selection hyper-heuristic (2015)
Journal Article
Kheiri, A., & Özcan, E. (2016). An iterated multi-stage selection hyper-heuristic. European Journal of Operational Research, 250(1), https://doi.org/10.1016/j.ejor.2015.09.003

There is a growing interest towards the design of reusable general purpose search methods that are applicable to di?erent problems instead of tailored solutions to a single particular problem. Hyper-heuristics have emerged as such high level methods... Read More about An iterated multi-stage selection hyper-heuristic.

Fuzzy multi-criteria decision making for carbon dioxide geological storage in Turkey (2015)
Journal Article
Deveci, M., Çetin Demirel, N., John, R., & Özcan, E. (in press). Fuzzy multi-criteria decision making for carbon dioxide geological storage in Turkey. Journal of Natural Gas Science and Engineering, 27(2), https://doi.org/10.1016/j.jngse.2015.09.004

The problem of choosing the best location for CO2 storage is a crucial and challenging multi-criteria decision problem for some companies. This study compares the performance of three fuzzy-based multi-criteria decision making (MCDM) methods, includi... Read More about Fuzzy multi-criteria decision making for carbon dioxide geological storage in Turkey.

Improving performance of a hyper-heuristic using a multilayer perceptron for vehicle routing (2015)
Conference Proceeding
Tyasnurita, R., Özcan, E., Shahriar, A., & John, R. (2015). Improving performance of a hyper-heuristic using a multilayer perceptron for vehicle routing.

A hyper-heuristic is a heuristic optimisation method which generates or selects heuristics (move operators) based on a set of components while solving a computationally difficult problem. Apprenticeship learning arises while observing the behavior of... Read More about Improving performance of a hyper-heuristic using a multilayer perceptron for vehicle routing.

Toward better build volume packing in additive manufacturing: classification of existing problems and benchmarks (2015)
Conference Proceeding
Araujo, L., Özcan, E., Atkin, J., Baumers, M., Tuck, C., & Hague, R. J. (2015). Toward better build volume packing in additive manufacturing: classification of existing problems and benchmarks.

In many cases, the efficient operation of Additive Manufacturing (AM) technology relies on build volumes being packed effectively. Packing algorithms have been developed in response to this requirement. The configuration of AM build volumes is partic... Read More about Toward better build volume packing in additive manufacturing: classification of existing problems and benchmarks.

Solving high school timetabling problems worldwide using selection hyper-heuristics (2015)
Journal Article
Ahmed, L. N., Özcan, E., & Kheiri, A. (2015). Solving high school timetabling problems worldwide using selection hyper-heuristics. Expert Systems with Applications, 42(13), https://doi.org/10.1016/j.eswa.2015.02.059

High school timetabling is one of those recurring NP-hard real-world combinatorial optimisation problems that has to be dealt with by many educational institutions periodically, and so has been of interest to practitioners and researchers. Solving a... Read More about Solving high school timetabling problems worldwide using selection hyper-heuristics.

A grouping hyper-heuristic framework: application on graph colouring (2015)
Journal Article
Elhag, A., & Özcan, E. (2015). A grouping hyper-heuristic framework: application on graph colouring. Expert Systems with Applications, 42(13), https://doi.org/10.1016/j.eswa.2015.01.038

Grouping problems are hard to solve combinatorial optimisation problems which require partitioning of objects into a minimum number of subsets while a given objective is simultaneously optimised. Selection hyper-heuristics are high level general purp... Read More about A grouping hyper-heuristic framework: application on graph colouring.

A tensor analysis improved genetic algorithm for online bin packing (2015)
Conference Proceeding
Asta, S., & Özcan, E. (2015). A tensor analysis improved genetic algorithm for online bin packing. In Proceedings of the 2015 on Genetic and Evolutionary Computation Conference - GECCO '15. https://doi.org/10.1145/2739480.2754787

Mutation in a Genetic Algorithm is the key variation operator adjusting the genetic diversity in a population throughout the evolutionary process. Often, a fixed mutation probability is used to perturb the value of a gene. In this study, we describe... Read More about A tensor analysis improved genetic algorithm for online bin packing.

A software interface for supporting the application of data science to optimisation (2015)
Journal Article
Parkes, A. J., Özcan, E., & Karapetyan, D. (2015). A software interface for supporting the application of data science to optimisation. Lecture Notes in Artificial Intelligence, 8994, 306-311. https://doi.org/10.1007/978-3-319-19084-6_31

Many real world problems can be solved effectively by metaheuristics in combination with neighbourhood search. However, implementing neighbourhood search for a particular problem domain can be time consuming and so it is important to get the most val... Read More about A software interface for supporting the application of data science to optimisation.