Shahriar Asta
YOU?
Author Swipe
View article: Constructing selection hyper-heuristics for open vehicle routing with time delay neural networks using multiple experts
Constructing selection hyper-heuristics for open vehicle routing with time delay neural networks using multiple experts Open
Hyper-heuristics are general purpose search methods for solving computationally difficult problems. A selection hyper-heuristic is composed of two key components: a heuristic selection method and move acceptance criterion. Under an iterati…
View article: Empirical Comparison of Heuristic Optimisation Methods for Automated Car Setup
Empirical Comparison of Heuristic Optimisation Methods for Automated Car Setup Open
View article: Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem
Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem Open
View article: A self-adaptive Multimeme Memetic Algorithm co-evolving utility scores to control genetic operators and their parameter settings
A self-adaptive Multimeme Memetic Algorithm co-evolving utility scores to control genetic operators and their parameter settings Open
View article: CHAMP: Creating heuristics via many parameters for online bin packing
CHAMP: Creating heuristics via many parameters for online bin packing Open
View article: A tensor based hyper-heuristic for nurse rostering
A tensor based hyper-heuristic for nurse rostering Open
View article: Machine learning for improving heuristic optimisation
Machine learning for improving heuristic optimisation Open
Heuristics, metaheuristics and hyper-heuristics are search methodologies which have been preferred by many researchers and practitioners for solving computationally hard combinatorial optimisation problems, whenever the exact methods fail …
View article: Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode\n Resource-constrained Multi-project Scheduling Problem
Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode\n Resource-constrained Multi-project Scheduling Problem Open
Multi-mode resource and precedence-constrained project scheduling is a\nwell-known challenging real-world optimisation problem. An important variant of\nthe problem requires scheduling of activities for multiple projects considering\navail…
View article: Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem
Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem Open
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 availabi…
View article: Improving performance of a hyper-heuristic using a multilayer perceptron for vehicle routing
Improving performance of a hyper-heuristic using a multilayer perceptron for vehicle routing Open
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 …
View article: A Tensor Analysis Improved Genetic Algorithm for Online Bin Packing
A Tensor Analysis Improved Genetic Algorithm for Online Bin Packing Open
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, w…