The location problem of interconnected facilities on the line with forbidden gaps is considered. The located facilities are connected among themselves and with gaps. Location in forbidden gaps is not allowed. It is need to minimize the total cost of connections between facilities and between facilities and gaps. It is known that the initial continuous problem is reduced to series discrete subpr...

One of the problems in applying Genetic Algorithm is that there is some situation where the evolutionary process converges too fast to a solution which causes it to be trapped in local optima. To overcome this problem, a proper diversity in the candidate solutions must be determined. Most existing diversitymaintenance mechanisms require a problem specific knowledge to setup parameters properly....

Continuous state DEC-MDPs are critical for agent teams in domains involving resources such as time, but scaling them up is a significant challenge. To meet this challenge, we first introduce a novel continuous-time DEC-MDP model that exploits transition independence in domains with temporal constraints. More importantly, we present a new locally optimal algorithm called SPAC. Compared to the be...

This paper proposes a method to improve genetic programming with multiple trees (GPCN). An individual in GPCN comprises multiple trees, and each tree has a number P that indicates the number of repetitive actions based on the tree. In previous work, a method for updating the number P has been proposed to obtain P suitable to the tree in evolution. However, in the method efficiency becomes worse...

In this paper, we present experimental results supporting early work on the Seeding Genetic Algorithm. We evaluate the algorithm’s performance with various parameterisations, making comparisons to the Canonical Genetic Algorithm, and use these as guidelines as we establish reasonable parameters for the seeding algorithm. We discuss how experimental results complement and confirm aspects of the ...

This paper introduces a new technique for proving the local optimality of packing configurations of Euclidean space. Applying this technique to a general convex polygon, we prove that under mild assumptions satisfied generically, the construction of the optimal double lattice packing by Kuperberg and Kuperberg is also locally optimal in the full space of packings.

We present a multi-agent approach to constraint satisfaction where feedback and reinforcement are used in order to avoid local optima and, consequently, to improve the overall solution. Our approach, FeReRA, is based on the fact that an agent’s local best performance does not necessarily contribute to the system’s best performance. Thus, agents may be rewarded for improving the system’s perform...

In this paper, we address the fundamental question concerning the limits on the network lifetime in sensor networks when multiple base stations (BSs) are deployed as data sinks. Specifically, we derive upper bounds on the network lifetime when multiple BSs are employed, and obtain optimum locations of the base stations that maximise these lifetime bounds. For the case of two BSs, we jointly opt...

We extend the approach in Yang (2010) for identifying locally optimal designs for nonlinear models. Conceptually the extension is relatively simple, but the consequences in terms of applications are profound. As we will demonstrate, we can now study locally optimal designs for a much larger class of models than hitherto.

There are many linear rank tests for the two-sample dispersion problem presented in literature. However just a few of them, the simplest ones, are commonly used. These common tests are not efficient for many practical distributions and thus other simple tests need to be developed to serve a wider range of distributions. The generalized secant hyperbolic distribution, proposed by Vaughan in [9],...