Nondestructive testing (NDT) of historic structures can be used for architectural archaeology, structural stability analysis, or materials characterization. Four types of physical probes are available: sound, penetrating radiation, visible light, and electromagnetism. Each of these can be utilized in several ways. Additional options involve hybrid techniques that combine probe methods. Widespre...

The selection of appropriate beam irradiation directions in radiotherapy – beam angle optimization (BAO) problem – is very important for the quality of the treatment, both for improving tumor irradiation and for better organs sparing. However, the BAO problem is still not solved satisfactorily and, most of the time, beam directions continue to be manually selected in clinical practice which req...

Electromagnetism-like algorithm (EM) is a population-based metaheuristic which has been proposed to solve continuous problems effectively. In this paper, we present a new meta-heuristic that uses the EM methodology to solve the single machine scheduling problem. Single machine scheduling is a combinatorial optimization problem. Schedule representation for our problem is based on random keys. Be...

In the last few decades, several effective algorithms for solving the resource-constrained project scheduling problem have been proposed. However, the challenging nature of this problem, summarised in its strongly NP-hard status, restricts the effectiveness of exact optimisation to relatively small instances. In this paper, we present a new meta-heuristic for this problem, able to provide near-...

Due to random deployment of static sensor nodes and environmental factors existence of holes in wireless sensor networks is inevitable. This holes results in reducing the data transmission performance and in additional energy consumption. Consequently, the hole problem is an important factor for prolonging the network lifetime. The network lifetime can be improved by deploying additional mobile...

In this paper, we present on a periodic job shop scheduling problem (PJSSP) based on the periodic event scheduling problem (PESP), which is different from cyclic scheduling. The PESP schedules a number of recurring events, such that each pair of events fulfills certain constraints during a given time period. To solve such a hard PJSS problem, we propose a hybrid algorithm, namely EM–SA, which i...