The traveling salesman problem with time windows (TSPTW) is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA) that uses a new constraint handling technique to minimize the travel cost in TSPTW problems. The EMA utilizes the attraction-repulsion mechanism between char...

We discuss an article by Le Bellac and Lévy-Leblond in which they have identified two Galilean limits of electromagnetism (1973 Nuovo Cimento B 14 217–33). We use their results to point out some confusion in the literature, and in the teaching of special relativity and electromagnetism. For instance, it is not widely recognized that there exist two well-defined non-relativistic limits, so that ...

The Standard Electromagnetism-like Mechanism (SEM) is one of the swarm-based optimization methods which is examined in this paper. The SEM works based on the charges in electrons and hence its operators have been especially designed for continuous space problems. Although the SEM was successfully applied to the standard optimization problems, it was not that notable when it came to tackling dis...

String theory compactifications may generate many light axion-like particles (ALPs) with weak couplings to electromagnetism. In general, a large number of ALPs exist, linear combination having potentially observable coupling The basis in which only one ALP couples electromagnetism is general misaligned the mass basis. This leads mixing between `electromagnetic' and `hidden' that do not interact...

A data-mining approach is applied to optimize the energy consumption of an air handling unit. A multiperceptron ensemble algorithm is used to model a chiller, a pump, and the supply and return fans. A non-linear model is developed to minimize the total energy consumption of the air-handling unit while maintaining the temperature of the supply air and the static pressure in a predetermined range...

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...