Heuristic functions play a crucial rule in optimal planning, and the theoretical limitations of algorithms using such functions are therefore of interest. Much work has focused on finding bounds on the behavior of heuristic search algorithms, using heuristics with specific attributes. Recently, it has been shown that in domains that contain transpositions, even heuristics that are intuitively c...

We investigate manipulation of the Borda voting rule, as well as two elimination style voting rules, Nanson’s and Baldwin’s voting rules, which are based on Borda voting. We argue that these rules have a number of desirable computational properties. For unweighted Borda voting, we prove that it is NP-hard for a coalition of two manipulators to compute a manipulation. This resolves a long-standi...

This paper presents an algorithm based on multi-objective approach for network reconfiguration. Multiple objectives are considered for reduction in the system power loss, deviations of the nodes voltage and transformers loading imbalance, while subject to a radial network structure in which all the loads must be energized and no branch current constraint is violated. These three objectives are ...

This article presents a preference accumulation model that can be used to implement a number of different multi-attribute heuristic choice rules, including the lexicographic rule, the majority of confirming dimensions (tallying) rule and the equal weights rule. The proposed model differs from existing accumulators in terms of attribute representation: Leakage and competition, typically applied ...

A stability design offuzzy logic controllers (FLCs) for non-linear systems is proposed in this paper. In heuristic design of FLCs, we often have a lot of rules. Although each rule governing the control of the plant refers to a stable closed-loop sub-system, the overall system stability cannot be guaranteed when all of these rules are put together into a rule base for the FLC. This limitation is...

The vehicle routing problem (VRP) is an important problem in the field of logistics management. As an NP-hard problem, the VRP real world sized instances cannot be solved to optimality within reasonable times. This research aims to develop a two-stage ant colony optimization (TACO) algorithm, which possesses a two-stage solution construction rule, to solve the large scale vehicle routing proble...

In this note we present three efficient variations of the occurrence heuristic, adopted by many exact string matching algorithms and firstly introduced in the wellknown Boyer-Moore algorithm. Our first heuristic, called improved-occurrence heuristic, is a simple improvement of the rule introduced by Sunday in his Quick-Search algorithm. Our second heuristic, called worst-occurrence heuristic, a...

We propose a new rule-based pre-ordering method for Japanese-to-English statistical machine translation that employs heuristic rules in two-stages. This two-stage framework contributes to experimental results that our method outperforms conventional rule-based methods in BLEU and RIBES.