This paper has briefly presented HSF, a Java-based innovative framework, which proposes a new way... more This paper has briefly presented HSF, a Java-based innovative framework, which proposes a new way to design Heuristic Search algorithms by identifying foundamental concepts already defined in the literature. Those concepts implemented as basic components, are thereafter plugged together to obtain a Heuristic Search algorithm. This approach allows to easily implement a wide range of well-known algorithms in a short time and facilitate the integration of future algorithms by quickly and easily add required new components. Combined with PMF, HSF is even capable to automatically provide a broad range of default algorithms for COPs. By its flexibility, generalisation and e#ciency, HSF o#ers a complete solving system based on Heuristic Search algorithms
Applications and Innovations in Intelligent Systems X, 2003
Accurate resource planning is critical to a company’s performance and profitability. This paper d... more Accurate resource planning is critical to a company’s performance and profitability. This paper describes the motivation for and the realisation of an automated resource planning system (i.e. Dynamic Planner) within British Telecom. Dynamic Planner is a decision support tool to help resource managers decide how best to deploy their resources. It provides a feel for what resources are needed; how many are needed and how best they should be deployed. It also provides the framework to compare the impact of scenarios involving overtime, borrowed resources and skill move. Dynamic Planner is built atop iOpt, a Java-based optimisation toolkit for modelling and solving combinatorial problems using invariants (one-way constraints) and heuristic search methods respectively.
... G Owusu, C Voudouris, R Dorne, C Ladde, G Anim-Ansah, K Gasson and G Connolly ... Acknowledge... more ... G Owusu, C Voudouris, R Dorne, C Ladde, G Anim-Ansah, K Gasson and G Connolly ... Acknowledgements We thank the following people for their contributions to the ARMS project: Nader Azarmi, Martyn Gollop, Rob Short, Ali McCormick, Karen Sylvester, Simon Phillips, David ...
Abstract. This paper presents the mask method (MASK), a new population-based, evolutionary search... more Abstract. This paper presents the mask method (MASK), a new population-based, evolutionary search procedure for nding models for satis ability problems (SAT). In this method, a partial truth assignment for a given boolean expression containing N variables ...
This invention is concerned with apparatus and a method for resource management and is particular... more This invention is concerned with apparatus and a method for resource management and is particularly suited to resource management of real-time systems. In particular, the invention is concerned with memory management of applications running on low cost systems where the amount of main memory is limited. The invention provides a method of scheduling a plurality of tasks in a data processing system, each task having suspension data (303) specifying suspension of the task based on memory usage associated therewith, the method including: processing one of the plurality of tasks; monitoring for an input indicative of memory usage of the task matching the suspension data associated with the task; suspending processing of said task on the basis of said monitored input; and processing a different one of the plurality. Thus in the invention, tasks to be executed on such a system are preconfigured with suspension data, otherwise referred to as memory-based preemption points (303b), which specify the amounts of memory required at various points in a task's execution (i.e. at and between preemption points). The data processing system is equipped with corresponding processing means arranged to evaluate whether, on the basis of the task(s) to be processed and the available memory, scheduling of the tasks should be constrained. The invention thus provides a means of preempting task processing based on memory constraints, and as such provides both a new memory management method and a new preemptive criterion.
Pour satisfaire des requetes d’un chemin de connexion possedant une capacite specifiee entre deux... more Pour satisfaire des requetes d’un chemin de connexion possedant une capacite specifiee entre deux terminaisons specifiees (21, 29) d’un reseau de telecommunication, une pluralite de reseaux auxiliaires distincts (30, 31, 32, 33, 34, 35) est definie, chacun comprenant un sous-ensemble de nœuds constituant le reseau complet (20) et les connexions du sous-ensemble de nœuds. Un chemin de connexion est determine par des elements d’identification de chemin de connexion entre des nœuds d’interface (312, 324 ; 334, 345), etc., dans chaque reseau auxiliaire (31, 33, etc.), identifiant des connexions (302-312, 324-334, 345-355) entre les reseaux auxiliaires et selectionnant un chemin complet de connexion (21, 302, 312, 324, 334, 345, 355, 29) en combinant les elements de chemin de connexion ainsi identifies. En divisant de cette maniere le probleme a resoudre, le temps de traitement est diminue et tout changement d’une partie du systeme ne demande d’ajuster que cette partie.
La presente invention concerne la conception de reseau de communications, et en particulier l'... more La presente invention concerne la conception de reseau de communications, et en particulier l'utilisation de reseaux optiques passifs (PON) pour optimiser une infrastructure reseau existante de taille importante telle qu'un reseau d'amenee. La presente invention concerne un procede implemente sur un ordinateur de conception d'un reseau a base de PON, le procede comprenant les etapes suivantes : recevoir des donnees representant une pluralite de nœuds de reseau ayant des routes d'interconnexion de câbles; determiner une combinaison de nœuds centraux a partir des nœuds de reseau, les nœuds centraux etant selectionnes par l'allocation d'un cout combine a une serie de combinaisons de nœuds centraux et la selection de la combinaison de nœuds combines presentant le plus faible cout combine, le cout combine de chaque combinaison de nœuds centraux comprenant un cout alloue pour chacun d'un nombre de criteres de selection de nœuds centraux; allouer un nombre d...
For some years now, Meta-Heuristic methods have demonstrated their ability to tackle large-scale ... more For some years now, Meta-Heuristic methods have demonstrated their ability to tackle large-scale optimisation problems. Up to now, several frameworks have been implemented for this family of methods. Some of them are either dedicated to Local Search such as EasyLocal++[5], Localizer[8], LocalSearch framework[1], Templar[7], HotFrame[4] or to Evolutionary Computation such as EOS[2], EASEA[3]. These tend to provide templates with the user having to define, for each problem addressed, the move operators and/or evolutionary operators with the need to construct tedious and hard-code move evaluation mechanisms. Furthermore, because of their structure most of the frameworks are limited in the choice of techniques provided. Therefore, it appears difficult using such existing frameworks to model efficient Meta-Heuristic methods as Hybrid Methods, combining evolutionary algorithms with local search methods. Such methods require more generalisation and more flexibility.
In this paper, a generic tabu search is presented for three coloring problems: graph coloring, T-... more In this paper, a generic tabu search is presented for three coloring problems: graph coloring, T-colorings and set T-colorings. This algorithm inte- grates important features such as greedy initialization, solution re-generation, dynamic tabu tenure, incremental evaluation of solutions and constraint han- dling techniques. Empirical comparisons show that this algorithm approaches the best coloring algorithms and outperforms some hybrid algorithms on
Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence, 1994
... Jin-Kao Hao & Raphael Dorne ... 2 for an example). Note that although only one Hamiltonia... more ... Jin-Kao Hao & Raphael Dorne ... 2 for an example). Note that although only one Hamiltonian tour exists in such a graph, there is a large number of almost completetours (local optima) scattered throughout the search space. 45 1 Page 3. ...
The goal of this paper is twofold. First, we introduce a class of local search procedures for sol... more The goal of this paper is twofold. First, we introduce a class of local search procedures for solving optimization and constraint problems. These procedures are based on various heuristics for choosing variables and values in order to examine a general neighborhood. ...
This paper has briefly presented HSF, a Java-based innovative framework, which proposes a new way... more This paper has briefly presented HSF, a Java-based innovative framework, which proposes a new way to design Heuristic Search algorithms by identifying foundamental concepts already defined in the literature. Those concepts implemented as basic components, are thereafter plugged together to obtain a Heuristic Search algorithm. This approach allows to easily implement a wide range of well-known algorithms in a short time and facilitate the integration of future algorithms by quickly and easily add required new components. Combined with PMF, HSF is even capable to automatically provide a broad range of default algorithms for COPs. By its flexibility, generalisation and e#ciency, HSF o#ers a complete solving system based on Heuristic Search algorithms
Applications and Innovations in Intelligent Systems X, 2003
Accurate resource planning is critical to a company’s performance and profitability. This paper d... more Accurate resource planning is critical to a company’s performance and profitability. This paper describes the motivation for and the realisation of an automated resource planning system (i.e. Dynamic Planner) within British Telecom. Dynamic Planner is a decision support tool to help resource managers decide how best to deploy their resources. It provides a feel for what resources are needed; how many are needed and how best they should be deployed. It also provides the framework to compare the impact of scenarios involving overtime, borrowed resources and skill move. Dynamic Planner is built atop iOpt, a Java-based optimisation toolkit for modelling and solving combinatorial problems using invariants (one-way constraints) and heuristic search methods respectively.
... G Owusu, C Voudouris, R Dorne, C Ladde, G Anim-Ansah, K Gasson and G Connolly ... Acknowledge... more ... G Owusu, C Voudouris, R Dorne, C Ladde, G Anim-Ansah, K Gasson and G Connolly ... Acknowledgements We thank the following people for their contributions to the ARMS project: Nader Azarmi, Martyn Gollop, Rob Short, Ali McCormick, Karen Sylvester, Simon Phillips, David ...
Abstract. This paper presents the mask method (MASK), a new population-based, evolutionary search... more Abstract. This paper presents the mask method (MASK), a new population-based, evolutionary search procedure for nding models for satis ability problems (SAT). In this method, a partial truth assignment for a given boolean expression containing N variables ...
This invention is concerned with apparatus and a method for resource management and is particular... more This invention is concerned with apparatus and a method for resource management and is particularly suited to resource management of real-time systems. In particular, the invention is concerned with memory management of applications running on low cost systems where the amount of main memory is limited. The invention provides a method of scheduling a plurality of tasks in a data processing system, each task having suspension data (303) specifying suspension of the task based on memory usage associated therewith, the method including: processing one of the plurality of tasks; monitoring for an input indicative of memory usage of the task matching the suspension data associated with the task; suspending processing of said task on the basis of said monitored input; and processing a different one of the plurality. Thus in the invention, tasks to be executed on such a system are preconfigured with suspension data, otherwise referred to as memory-based preemption points (303b), which specify the amounts of memory required at various points in a task's execution (i.e. at and between preemption points). The data processing system is equipped with corresponding processing means arranged to evaluate whether, on the basis of the task(s) to be processed and the available memory, scheduling of the tasks should be constrained. The invention thus provides a means of preempting task processing based on memory constraints, and as such provides both a new memory management method and a new preemptive criterion.
Pour satisfaire des requetes d’un chemin de connexion possedant une capacite specifiee entre deux... more Pour satisfaire des requetes d’un chemin de connexion possedant une capacite specifiee entre deux terminaisons specifiees (21, 29) d’un reseau de telecommunication, une pluralite de reseaux auxiliaires distincts (30, 31, 32, 33, 34, 35) est definie, chacun comprenant un sous-ensemble de nœuds constituant le reseau complet (20) et les connexions du sous-ensemble de nœuds. Un chemin de connexion est determine par des elements d’identification de chemin de connexion entre des nœuds d’interface (312, 324 ; 334, 345), etc., dans chaque reseau auxiliaire (31, 33, etc.), identifiant des connexions (302-312, 324-334, 345-355) entre les reseaux auxiliaires et selectionnant un chemin complet de connexion (21, 302, 312, 324, 334, 345, 355, 29) en combinant les elements de chemin de connexion ainsi identifies. En divisant de cette maniere le probleme a resoudre, le temps de traitement est diminue et tout changement d’une partie du systeme ne demande d’ajuster que cette partie.
La presente invention concerne la conception de reseau de communications, et en particulier l'... more La presente invention concerne la conception de reseau de communications, et en particulier l'utilisation de reseaux optiques passifs (PON) pour optimiser une infrastructure reseau existante de taille importante telle qu'un reseau d'amenee. La presente invention concerne un procede implemente sur un ordinateur de conception d'un reseau a base de PON, le procede comprenant les etapes suivantes : recevoir des donnees representant une pluralite de nœuds de reseau ayant des routes d'interconnexion de câbles; determiner une combinaison de nœuds centraux a partir des nœuds de reseau, les nœuds centraux etant selectionnes par l'allocation d'un cout combine a une serie de combinaisons de nœuds centraux et la selection de la combinaison de nœuds combines presentant le plus faible cout combine, le cout combine de chaque combinaison de nœuds centraux comprenant un cout alloue pour chacun d'un nombre de criteres de selection de nœuds centraux; allouer un nombre d...
For some years now, Meta-Heuristic methods have demonstrated their ability to tackle large-scale ... more For some years now, Meta-Heuristic methods have demonstrated their ability to tackle large-scale optimisation problems. Up to now, several frameworks have been implemented for this family of methods. Some of them are either dedicated to Local Search such as EasyLocal++[5], Localizer[8], LocalSearch framework[1], Templar[7], HotFrame[4] or to Evolutionary Computation such as EOS[2], EASEA[3]. These tend to provide templates with the user having to define, for each problem addressed, the move operators and/or evolutionary operators with the need to construct tedious and hard-code move evaluation mechanisms. Furthermore, because of their structure most of the frameworks are limited in the choice of techniques provided. Therefore, it appears difficult using such existing frameworks to model efficient Meta-Heuristic methods as Hybrid Methods, combining evolutionary algorithms with local search methods. Such methods require more generalisation and more flexibility.
In this paper, a generic tabu search is presented for three coloring problems: graph coloring, T-... more In this paper, a generic tabu search is presented for three coloring problems: graph coloring, T-colorings and set T-colorings. This algorithm inte- grates important features such as greedy initialization, solution re-generation, dynamic tabu tenure, incremental evaluation of solutions and constraint han- dling techniques. Empirical comparisons show that this algorithm approaches the best coloring algorithms and outperforms some hybrid algorithms on
Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence, 1994
... Jin-Kao Hao & Raphael Dorne ... 2 for an example). Note that although only one Hamiltonia... more ... Jin-Kao Hao & Raphael Dorne ... 2 for an example). Note that although only one Hamiltonian tour exists in such a graph, there is a large number of almost completetours (local optima) scattered throughout the search space. 45 1 Page 3. ...
The goal of this paper is twofold. First, we introduce a class of local search procedures for sol... more The goal of this paper is twofold. First, we introduce a class of local search procedures for solving optimization and constraint problems. These procedures are based on various heuristics for choosing variables and values in order to examine a general neighborhood. ...
Uploads
Papers by Raphael Jean Dorne