The linear ordering problem with clusters: a new partial ranking
نویسندگان
چکیده
منابع مشابه
A new attitude coupled with the basic thinking to ordering for ranking fuzzy numbers
Ranking fuzzy numbers is generalization of the concepts of order, and class, and so have fundamental applications. Moreover, deriving the final efficiency and powerful ranking are helpful to decision makers when solving fuzzy problems. Selecting a good ranking method can apply to choosing a desired criterion in a fuzzy environment. There are numerous methods proposed for the ranking of fuzzy n...
متن کاملA new heuristic algorithm solving the linear ordering problem
The linear ordering problem is an NP-hard combinatorial problem with a large number of applications. Contrary to another very popular problem from the same category, the traveling salesman problem, relatively little space in the literature has been devoted to the linear ordering problem so far. This is particularly true for the question of developing good heuristic algorithms solving this probl...
متن کاملThe Linear Ordering Problem with cumulative costs
Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory terms by introducing a complete digraph G = (V, A) whose vertices v ∈ V := {1, · · · , n} correspond to the n items to be sorted. Depending on the cost function to be be used, different optimization problems can be defi...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولNew results of ant algorithms for the Linear Ordering Problem
Ant-based algorithms are successful tools for solving complex problems. One of these problems is the Linear Ordering Problem (LOP). The paper shows new results on some LOP instances, using Ant Colony System (ACS) and the StepBack Sensitive Ant Model (SB-SAM).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TOP
سال: 2020
ISSN: 1134-5764,1863-8279
DOI: 10.1007/s11750-020-00552-3