GRASP with path-relinking is a hybrid metaheuristic, or stochastic local search (Monte Carlo) method, for combinatorial optimization. A restart strategy in GRASP with path-relinking heuristics is a set of iterations {i1, i2, . . .} on which the heuristic is restarted from scratch using a new seed for the random number generator. Restart strategies have been shown to speed up stochastic local se...

This study extends the hybrid version of baseline New-Keynesian model with heterogeneous agents who may adopt various forecast heuristics. With a focus on consumer expectations, we identify most appropriate pairs heuristics that can lead to an equivalent fit data compared specification under rational expectations. The competing specifications are estimated using simulated method moments. Our em...

We describe a new hyper-heuristic method NELLI-GP for solving job-shop scheduling problems (JSSP) that evolves an ensemble of heuristics. The ensemble adopts a divide-and-conquer approach in which each heuristic solves a unique subset of the instance set considered. NELLI-GP extends an existing ensemble method called NELLI by introducing a novel heuristic generator that evolves heuristics compo...

We propose simple heuristics for the assembly line worker assignment and balancing problem. This problem typically occurs in assembly lines in sheltered work centers for the disabled. Different from the classical simple assembly line balancing problem, the task execution times vary according to the assigned worker. We develop a constructive heuristic framework based on task and worker priority ...

Assumptions of the concept sustainable development should include actions towards modern, well-managed enterprises. However, making decisions in this area is difficult as it often results from subjective assessments environmental problems. Hence, there a motivation to develop method analysing search for solutions problems that supports improving quality products or processes while considering t...

Entity linking refers to the task of mapping name strings in a text to their corresponding entities in a given knowledge base. It is an essential component in natural language understanding applications, but a challenging task. This paper proposes a method that combines heuristics and learning for entity linking by (i) learning coherence among co-occurrence entities within the text based on Wik...

Passive systems are preferred tools for seismic control of buildings challenged by probabilistic nature of the input excitation. However, other types of uncertainty still exist in parameters of the control device even when optimally tuned. The present work concerns optimal design of multiple-tuned-mass-damper embedded on a shear building by a number of meta-heuristics. They include well-known g...

We explore a method for computing admissible heuristic evaluation functions for search problems. It utilizes pattern databases (Culberson & Schaeffer, 1998), which are precomputed tables of the exact cost of solving various subproblems of an existing problem. Unlike standard pattern database heuristics, however, we partition our problems into disjoint subproblems, so that the costs of solving t...

We study the problem of building effective heuristics for achieving conjunctive goals from heuristics for individual goals. We consider a straightforward method for building conjunctive heuristics that smoothly trades off between previous common methods. In addition to first explicitly formulating the problem of designing conjunctive heuristics, our major contribution is the discovery that this...