Zhu, Lin. Ph.D., Purdue University, December, 2005. Planning Heuristics for Conjunctive and Disjunctive Goals. Major Professor: Robert L. Givan. Automated planning is an area of Artificial Intelligence (AI) that studies the reasoning process of anticipating the expected outcomes of action sequences and deliberately organizing them to achieve specified goals. Heuristic search based planners have...

This paper presents a constraint satisfaction adaptive neural network, together with several heuristics, to solve the generalized job-shop scheduling problem, one of NP-complete constraint satisfaction problems. The proposed neural network can be easily constructed and can adaptively adjust its weights of connections and biases of units based on the sequence and resource constraints of the job-...

The vehicle routing problem (VRP) is a family of problems whereby a fleet of vehicles must service the commodity demands of a set of geographically scattered customers from one or more depots, subject to a number of constraints. Early hyper-heuristic research focussed on selecting and applying a low-level heuristic at a given stage of an optimisation process. Recent trends have led to a number ...

Some recent trends in manufacturing in particular and business in general, lead to new approaches regarding the organisation and software architecture, mainly adopting distributed solutions. Such organisations imply organisational and technological evolution through agility, distribution, decentralisation, reactivity and flexibility. New organisational and technological paradigms are needed in ...

Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for producing phylogenetic trees produce good solutions within reasonable time on small datasets (up to a few thousand sequences), while ML heuristics are limited to smaller datasets (up to a few hundred sequences). However, sin...

Distributed interactive applications tend to have stringent latency requirements and some may have high bandwidth demands. Many of them have also very dynamic user groups for which all-to-all communication is needed. In online multiplayer games, for example, such groups are determined through region-of-interest management in the application. We have investigated a variety of group management ap...

Multi-period single-item lot sizing problem under stochastic environment has been tackled by few researchers and remains in need of further studies. It is mathematically intractable due to its complex structure. In this paper, an optimum lot-sizing policy based on minimum total relevant cost under price and demand uncertainties was studied by using various artificial neural networks trained wit...

Phrase-based systems deeply depend on the quality of their phrase tables and therefore, the process of phrase extraction is always a fundamental step. In this paper we present a general and extensible phrase extraction algorithm, where we have highlighted several control points. The instantiation of these control points allows the simulation of previous approaches, as in each one of these point...

The impressive market spread of IEEE 802.11 based Wireless Local Area Networks (WLANs) is calling for quantitative approaches in the network planning procedure. It is common belief that such networks have the potentials to replace traditional indoor wired local networks and allow flexible access outdoor, eventually competing with classical cellular systems (GSM , GPRS, UMTS, etc.). The appropri...

We study the Minimum Labelling Spanning Tree Problem : Given a graph G with a color (label) assigned to each edge (not necessarily properly) we look for a spanning tree of G with the minimum number of different colors. The problem has several applications in telecommunication networks, electric networks, multimodal transportation networks, among others, where one aims to ensure connectivity by ...