The interface between combinatorial optimization and fuzzy sets-based methodologies is the subject of very active and increasing research. In this context we describe FANS, a fuzzy adaptive neighborhood search optimization heuristic that uses a fuzzy valuation to qualify solutions and adapts its behavior as a function of the search state. FANS may also be regarded as a local search framework. W...

The recognition heuristic is a noncompensatory strategy for inferring which of two alternatives, one recognized and the other not, scores higher on a criterion. According to it, such inferences are based solely on recognition. We generalize this heuristic to tasks with multiple alternatives, proposing a model of how people identify the consideration sets from which they make their final decisio...

HEURISTIC SEARCH UNDER A DEADLINE by Austin Dionne University of New Hampshire, May, 2011 In many heuristic search problems of practical interest, insufficient time is available to find a provably optimal solution. The currently accepted methods of finding a best possible sub-optimal solution within a time deadline are the anytime methods which do not directly consider the time remaining in the...

Answering “macro-process” research issues – which require understanding how development processes fit or do not fit in different organizational systems and environments – requires families of related studies. While there are many sources of variation between development contexts, it is not clear a priori what specific variables influence the effectiveness of a process in a given context. These ...

The studies described in this paper investigated the use of a decisional heuristic-anchoring-and-adjustment-in an information-rich, real world setting. In order to assess the generalizability of laboratory research on this decision heuristic, students and real estate agents toured and made pricing decisions about real estate properties. It was hypothesized that manipulated listing prices would ...

university course timetabling is a complex optimizationproblem. there are many components like departments, faculties, rooms,and students making the problem huge and difficult to solve. eachcomponent enforces a set of normally conflicting constraints on thesolution space. the problem will be solved if courses are scheduled indifferent rooms and within some specific time slots such that a set of...

The Heterogeneous Fleet Vehicle Routing Problem (HFVRP) is an important variant of the classical Capacitated (CVRP) that aims to find routes minimize total traveling cost a heterogeneous fleet vehicles. This problem great interest given its importance in many industrial and commercial applications. In this paper, we present Adaptive Iterated Local Search (AILS) heuristic for HFVRP. AILS local s...

Iterative projection methods may become trapped at non-solutions when the constraint sets are nonconvex. Two kinds of parameters available to help avoid this behavior and study gives examples both. The first kind parameter, called a hyperparameter, includes any parameter that appears in definition iteration rule itself. second comprises metric sets, feature arises problem be solved has two or m...