Fuzzy rule based termination criteria are introduced in two conventional and exact algorithms solving Knapsack Problems. As a consequence two new solution algorithms are obtained. These algorithms are heuristic ones with a high performance. The efficiency of the algorithms obtained is illustrated by solving some numerical examples.

This paper presents alternative methods for producing fuzzy models for the fuzzy multiple heuristic ordering technique that we previously introduced for the construction of examination timetables. The effects of altering the rules within the fuzzy inference system were investigated. Four alternative rule 'tuning' approaches are described in detail and their results are presented and compared.

This paper presents a new best-fit heuristic for the two-dimensional rectangular stock-cutting problem and demonstrates its effectiveness by comparing it against other published approaches. A placement algorithm usually takes a list of shapes, sorted by some property such as increasing height or decreasing area, and then applies a placement rule to each of these shapes in turn. The proposed met...

We propose a constructive heuristic approach for the solution of the permutation flow-shop problem. The objective function of all algorithms is the minimization of the makespan. Our approach employs Johnson’s rule to give a good initial solution for the improvement heuristic, also known as metaheuristics. The proposed heuristic algorithm, named MOD, is tested against four other heuristics that ...

A Flexible Manufacturing System (FMS) is designed to produce a variety of products, utilizing a set of resources like work stations, robots etc., interlinked by certain means of transport. The prime characteristic of an FMS is that the overall system is under the computer control to realize these essential improvements in a firm; it imposes many challenging problems for planning, scheduling, mo...

Simple heuristics of the type introduced by Gigerenzer, Todd, and The ABC Research Group (1999) embody principles for information search, stop and decision making. These heuristics suggest that such processes are simple. In an analysis of general practitioners’ (GPs) information search and decision-making behaviour when prescribing a lipid lowering drug, we examined whether information search w...

We present an efficient variation of the good-suffix heuristic, firstly introduced in the well-known Boyer-Moore algorithm for the exact string matching problem. Our proposed variant uses only constant space, retaining much the same time efficiency of the original rule, as shown by extensive experimentation.

Packet classification is used to determine the behavior of incoming packets in network devices according defined rules. As it achieved using a linear search on rule list, large number rules will lead longer communication latency. To solve this, problem finding order minimizing latency has been studied. Misherghi et al. and Harada have proposed that relaxes policy-based constraints. In this pape...

learn stable states by introducing discretization into the network and using a pseudogradient learning rule to perform training. The essense of the learning rule is that in doing gradient decent, it makes use of the gradient of a sigmoid function as a heuristic hint in place of that of the hard-limiting function, while still using the discretized value in the feedback update path. The new struc...