Constraint handling strategies in Genetic Algorithms application to optimal batch plant design

Optimal batch plant design is a recurrent issue in Process Engineering, which can be formulated as a Mixed Integer Non-Linear Programming(MINLP) optimisation problem involving specific constraints, which can be, typically, the respect of a time horizon for the synthesis of various products. Genetic Algorithms constitute a common option for the solution of these problems, but their basic operating mode is not always wellsuited to any kind of constraint treatment: if those cannot be integrated in variable encoding or accounted for through adapted genetic operators, their handling turns to be a thorny issue. The point of this study is thus to test a few constraint handling techniques on a mid-size example in order to determine which one is the best fitted, in the framework of one particular problem formulation. The investigated methods are the elimination of infeasible individuals, the use of a penalty term added in the minimized criterion, the relaxation of the discrete variables upper bounds, dominancebased tournaments and, finally, a multiobjective strategy. The numerical computations, analysed in terms of result quality and of computational time, show the superiority of elimination technique for the former criterion only when the latter one does not become a bottleneck. Besides, when the problem complexity makes the random location of feasible space too difficult, a single tournament technique proves to be the most efficient one

Clustering problems in optimization models

We discuss a variety of clustering problems arising in combinatorial applications and in classifying objects into homogenous groups. For each problem we discuss solution strategies that work well in practice. We also discuss the importance of careful modelling in clustering problems.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/44350/1/10614_2004_Article_BF00121636.pd

Developing control and integration software for flexible manufacturing systems

The slow growth of computer-integrated manufacturing is attributed to the complexity of designing and implementing their control and integration software. This article expands on a methodology for designing and implementing this software that was introduced in [16]. The goal of this methodology is to build flexible and resuable control and integration software for computer-integrated manufacturing systems. It hinges upon the concepts of software/hardware components, their assemblages, a distributed common language environment, formal models, and generic controllers. Major sources of flexibility are obtained by decoupling process plan models from the model of the factory floor and by using a generic controller. Reusability is achieved by building selfcontained software/hardware components with general, possibly parametrized, interfaces. The interplay between simulated and actual hardware internals of software/hardware components is used as the basis of a testing strategy that performs off-line simulation followed by on-line testing.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/43095/1/10952_2005_Article_BF02265064.pd

PSPACE-completeness of Modular Supervisory Control Problems*

In this paper we investigate computational issues associated with the supervision of concurrent processes modeled as modular discrete-event systems. Here, modular discrete-event systems are sets of deterministic finite-state automata whose interaction is modeled by the parallel composition operation. Even with such a simple model process model, we show that in general many problems related to the supervision of these systems are PSPACE-complete. This shows that although there may be space-efficient methods for avoiding the state-explosion problem inherent to concurrent processes, there are most likely no time-efficient solutions that would aid in the study of such “large-scale” systems. We show our results using a reduction from a special class of automata intersection problem introduced here where behavior is assumed to be prefix-closed. We find that deciding if there exists a supervisor for a modular system to achieve a global specification is PSPACE-complete. We also show many verification problems for system supervision are PSPACE-complete, even for prefix-closed cases. Supervisor admissibility and online supervision operations are also discussed.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/45090/1/10626_2004_Article_6210.pd