A Hyper-Heuristic Using GRASP with Path-Relinking

2011 ◽  
Vol 4 (2) ◽  
pp. 31-42 ◽  
Author(s):  
He Jiang ◽  
Junying Qiu ◽  
Jifeng Xuan
Keyword(s):  
Simulated Annealing ◽  
Local Search ◽  
Iterative Procedure ◽  
Experimental Results ◽  
Path Relinking ◽  
Nurse Rostering ◽  
Primary Motivation ◽  
Running Time ◽  
Nurse Rostering Problem

The goal of hyper-heuristics is to design and choose heuristics to solve complex problems. The primary motivation behind the hyper-heuristics is to generalize the solving ability of the heuristics. In this paper, the authors propose a Hyper-heuristic using GRASP with Path-Relinking (HyGrasPr). HyGrasPr generates heuristic sequences to produce solutions within an iterative procedure. The procedure of HyGrasPr consists of three phases, namely the construction phase, the local search phase, and the path-relinking phase. To show the performance of the HyGrasPr, the authors use the nurse rostering problem as a case study. The authors use an existing simulated annealing based hyper-heuristic as a baseline. The experimental results indicate that HyGrasPr can achieve better solutions than SAHH within the same running time and the path-relinking phase is effective for the framework of HyGrasPr.

A Hyper-Heuristic Using GRASP with Path-Relinking

2013 ◽  
pp. 89-99 ◽  
Author(s):  
He Jiang ◽  
Junying Qiu ◽  
Jifeng Xuan
Keyword(s):  
Simulated Annealing ◽  
Local Search ◽  
Iterative Procedure ◽  
Experimental Results ◽  
Path Relinking ◽  
Nurse Rostering ◽  
Primary Motivation ◽  
Running Time ◽  
Nurse Rostering Problem

The goal of hyper-heuristics is to design and choose heuristics to solve complex problems. The primary motivation behind the hyper-heuristics is to generalize the solving ability of the heuristics. In this paper, the authors propose a Hyper-heuristic using GRASP with Path-Relinking (HyGrasPr). HyGrasPr generates heuristic sequences to produce solutions within an iterative procedure. The procedure of HyGrasPr consists of three phases, namely the construction phase, the local search phase, and the path-relinking phase. To show the performance of the HyGrasPr, the authors use the nurse rostering problem as a case study. The authors use an existing simulated annealing based hyper-heuristic as a baseline. The experimental results indicate that HyGrasPr can achieve better solutions than SAHH within the same running time and the path-relinking phase is effective for the framework of HyGrasPr.

Simulated annealing for a multi-level nurse rostering problem in hemodialysis service

2018 ◽  
Vol 64 ◽  
pp. 148-160 ◽  
Author(s):  
Zhenyuan Liu ◽  
Zaisheng Liu ◽  
Zhipeng Zhu ◽  
Yindong Shen ◽  
Junwu Dong
Keyword(s):  
Simulated Annealing ◽  
Nurse Rostering ◽  
Nurse Rostering Problem ◽  
Multi Level

scholarly journals A novel population-based local search for nurse rostering problem

2021 ◽  
Vol 11 (1) ◽  
pp. 471
Author(s):  
Anmar Abuhamdah ◽  
Wadii Boulila ◽  
Ghaith M. Jaradat ◽  
Anas M. Quteishat ◽  
Mutasem K. Alsmadi ◽  
...  
Keyword(s):  
Local Search ◽  
Optimization Problems ◽  
Hybrid Methods ◽  
Parameter Tuning ◽  
Search Space ◽  
Population Based ◽  
Nurse Rostering ◽  
Hybrid Approaches ◽  
University Course Timetabling ◽  
Nurse Rostering Problem

Population-based approaches regularly are better than single based (local search) approaches in exploring the search space. However, the drawback of population-based approaches is in exploiting the search space. Several hybrid approaches have proven their efficiency through different domains of optimization problems by incorporating and integrating the strength of population and local search approaches. Meanwhile, hybrid methods have a drawback of increasing the parameter tuning. Recently, population-based local search was proposed for a university course-timetabling problem with fewer parameters than existing approaches, the proposed approach proves its effectiveness. The proposed approach employs two operators to intensify and diversify the search space. The first operator is applied to a single solution, while the second is applied for all solutions. This paper aims to investigate the performance of population-based local search for the nurse rostering problem. The INRC2010 database with a dataset composed of 69 instances is used to test the performance of PB-LS. A comparison was made between the performance of PB-LS and other existing approaches in the literature. Results show good performances of proposed approach compared to other approaches, where population-based local search provided best results in 55 cases over 69 instances used in experiments.

Iterated local search in nurse rostering problem

2013 ◽  
Author(s):  
Sen Ngoc Vu ◽  
Minh H. Nhat Nguyen ◽  
Le Minh Duc ◽  
Chantal Baril ◽  
Viviane Gascon ◽  
...  
Keyword(s):  
Local Search ◽  
Iterated Local Search ◽  
Nurse Rostering ◽  
Nurse Rostering Problem

scholarly journals Analyzing free variation with harmony – A case study of verb-cluster serialization

2020 ◽  
Vol 39 (3) ◽  
pp. 407-437
Author(s):  
Markus Bader
Keyword(s):  
Native Speakers ◽  
Initial Position ◽  
Experimental Results ◽  
Modal Verbs ◽  
Weighted Constraints ◽  
Corpus Data ◽  
Frequency Relationship ◽  
Zero Frequency ◽  
Free Variation

Abstract In German, a verb selected by another verb normally precedes the selecting verb. Modal verbs in the perfect tense provide an exception to this generalization because they require the perfective auxiliary to occur in cluster-initial position according to prescriptive grammars. Bader and Schmid (2009b) have shown, however, that native speakers accept the auxiliary in all positions except the cluster-final one. Experimental results as well as corpus data indicate that verb cluster serialization is a case of free variation. I discuss how this variation can be accounted for, focusing on two mismatches between acceptability and frequency: First, slight acceptability advantages can turn into strong frequency advantages. Second, syntactic variants with basically zero frequency can still vary substantially in acceptability. These mismatches remain unaccounted for if acceptability is related to frequency on the level of whole sentence structures, as in Stochastic OT (Boersma and Hayes2001). However, when the acceptability-frequency relationship is modeled on the level of individual weighted constraints, using harmony as link (see Pater2009, for different harmony based frameworks), the two mismatches follow given appropriate linking assumptions.

scholarly journals Lightweight Blockchain Processing. Case Study: Scanned Document Tracking on Tezos Blockchain

2021 ◽  
Vol 11 (15) ◽  
pp. 7169
Author(s):  
Mohamed Allouche ◽  
Tarek Frikha ◽  
Mihai Mitrea ◽  
Gérard Memmi ◽  
Faten Chaabane
Keyword(s):  
Load Balancing ◽  
Relative Error ◽  
Execution Time ◽  
General Purpose ◽  
Experimental Results ◽  
Raspberry Pi ◽  
Embedded Platform ◽  
Memory Resources ◽  
Processing Solution

To bridge the current gap between the Blockchain expectancies and their intensive computation constraints, the present paper advances a lightweight processing solution, based on a load-balancing architecture, compatible with the lightweight/embedding processing paradigms. In this way, the execution of complex operations is securely delegated to an off-chain general-purpose computing machine while the intimate Blockchain operations are kept on-chain. The illustrations correspond to an on-chain Tezos configuration and to a multiprocessor ARM embedded platform (integrated into a Raspberry Pi). The performances are assessed in terms of security, execution time, and CPU consumption when achieving a visual document fingerprint task. It is thus demonstrated that the advanced solution makes it possible for a computing intensive application to be deployed under severely constrained computation and memory resources, as set by a Raspberry Pi 3. The experimental results show that up to nine Tezos nodes can be deployed on a single Raspberry Pi 3 and that the limitation is not derived from the memory but from the computation resources. The execution time with a limited number of fingerprints is 40% higher than using a classical PC solution (value computed with 95% relative error lower than 5%).

Sign in / Sign up

Export Citation Format

Share Document