This paper presents an extension of an evolutionary approach to classical plan optimisation to metric plan optimisation. With the advent of the third International Planning Competition (IPC), optimisation for fully automated planners is no longer solely an issue of optimising over the number of actions in a plan. The problem is more complicated and interesting as optimisation can be done in rel...

This paper introduces logspace optimisation problems as analogues of the well-studied polynomial-time optimisation problems. Similarly to them, logspace optimisation problems can have vastly different approximation properties, even though the underlying existence and budget problems have the same computational complexity. Numerous natural problems are presented that exhibit such a varying compl...

This paper focuses on the combined maintenance and routing optimisation problem in a multi-period environment that consists of scheduling operations for set geographically distributed machines, subject to non-deterministic failures with technicians perform preventive corrective operations. study uses two-step approach based column generation. The first step model determines optimal time until n...

Efficient optimisation algorithms have become important tools for finding high-quality solutions to hard, real-world problems such as production scheduling, timetabling, or vehicle routing. These are typically “black boxes” that work on mathematical models of the problem solve. However, many difficult fully specify, and require a “human in loop” who collaborates with algorithm by refining model...

Link adaptation techniques aim to maximise the quality of service and resource utilisation in wireless networks. However, fairness must be taken into consideration, particularly, in low-mobility environments where the channel dynamic variation is small. The authors propose and analyse three link adaptation techniques [using joint power control (PC) and adaptive coding and modulation (ACM)] for ...

In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...

This paper addresses production systems optimisation in uncertain context. A standard framework for solving such type of problem is depicted in a 3-step approach. The two first steps consist of off-line characterisation of the problem and calculation of solutions with some desired performance. A generic approach to implement these off-line steps is introduced in this paper. This approach relies...

For hybrid wavelet – large margin classifiers, adapting the wavelet may significantly improve the classification performance. We propose to select the wavelet with respect to a large margin classifier and data to improve class separability and minimise the generalisation error. In this paper, we show that this wavelet adaptation problem can be formulated as an optimisation problem with polynomi...

In this paper we present a promising technique that enhances the efficiency of GAs, when they are applied to constrained optimisation problems. According to this technique, the problem constraints are included in the fitness function as penalty terms, that vary during the GA evolution, facilitating thus the location of the global optimum and the avoidance of local optima. Moreover we proceed to...