We describe CIPF 2.0, a propositional constructive learner which is able to cope with both noise and representation mismatch in training examples simultaneously. CIPF 2.0’s abilities stem from coupling the robust selective learner C4.5 (and its production rule generator) with a sophisticated constructive induction component. An important new general constructive operator incorporated into CIPF ...

We describe how CiPF 2.0, a propositional constructive learner, can cope with both noise and representation mismatch in training examples simultaneously. CiPF 2.0 abilities stem from coupling the robust selective learner C4.5 (and its production rule generator) with a sophisticated constructive induction component. An important new general constructive operator incorporated into CiPF 2.0 is the...

This paper proposes two variants of heuristic algorithms to solve the classic permutation flowshop scheduling problem. Both algorithms are simple and very efficient. The first algorithm is a constructive heuristic which builds the optimal schedule of jobs on the basis of a selective-greedy process. To escape the trap of local optimum points, for the second heuristic algorithm a stochastic featu...

We describe the learning system CiPF, which tightly couples a simple concept learner with a sophisticated constructive induction component. It is described in terms of a generic architecture for constructive induction. We focus on the problem of controlling the abundance of opportunities for constructively adding new attributes. In CiPF the so-called Minimum Description Length (MDL) principle a...

In this paper, we present a variable block insertion heuristic (VBIH) algorithm to solve the blocking flowshop scheduling problem with the total flowtime criterion. In the VBIH algorithm, we define a minimum and a maximum block size. After constructing the initial sequence, the VBIH algorithm starts with a minimum block size being equal to one. It removes the block from the current sequence and...

This work analyses the application of heuristic algorithms in the transmission network expansion planning problem using the Hybrid Linear Model (HLM). The HLM is a relaxed model which still has not been fully explored. The work presents a detailed study of a constructive heuristic algorithm for the HLM and proposes an extension of the model and a solution technique for multi-stage planning. Qua...

In this paper, we present a constructive heuristic algorithm for the 2connected m-dominating set problem. It is based on a greedy heuristic in which a 2-connected subgraph is iteratively extended with suitable open ears. The growth procedure is an adaptation of the breadth-first-search which efficiently manages to find open ears. Further, a heuristic function is defined for selecting the best e...