We use conjunctions and fuzzy implications to define fuzzy dilations and fuzzy erosions in fuzzy morphology according to Nachtegael el al. 2003.(1) Further we observe that these fuzzy dilations and fuzzy erosions cons...
详细信息
ISBN:
(纸本)9789812799463
We use conjunctions and fuzzy implications to define fuzzy dilations and fuzzy erosions in fuzzy morphology according to Nachtegael el al. 2003.(1) Further we observe that these fuzzy dilations and fuzzy erosions constitute fuzzy adjunctions that are also defined by a fuzzy implication. Adjointness between a conjunction and a fuzzy implication is analyzed. We show a conjunction that is adjoint to a fuzzy implication can be not only generated by an R-implication, but also by other fuzzy implications.
A decision making technique is described for the selection among it alternatives based on the evaluation of n (distinct) group of persons according to the same in criteria. The evaluation of each person for each crite...
详细信息
ISBN:
(纸本)9789812799463
A decision making technique is described for the selection among it alternatives based on the evaluation of n (distinct) group of persons according to the same in criteria. The evaluation of each person for each criterion is represented by a proportional ordinal 2-tuple and the overall opinion is aggregated by a pair of quantifier-guided OWA and P-OWA operators which can be accomplished alternatively by a Choquet integral of Fubini type.
The Double Traveling Salesman Problem with Multiple Stacks (DTSPMS) consists on finding the minimum total length tours in two separated networks, one for pickups and one for deliveries. One item is required to be sent...
详细信息
ISBN:
(纸本)9789812799463
The Double Traveling Salesman Problem with Multiple Stacks (DTSPMS) consists on finding the minimum total length tours in two separated networks, one for pickups and one for deliveries. One item is required to be sent from each location in the first network to a location in the second network. Collected items can be stored in several LIFO stacks, but repacking is not allowed. In this paper we present four new neighborhood structures for the DTSPMS, and they are embedded, together with other two existing ones, into a Variable Neighborhood Search heuristic that is used to solve the problem.
暂无评论