scholarly journals ACO with Intuitionistic Fuzzy Pheromone Updating Applied on Multiple-Constraint Knapsack Problem

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1456
Author(s):  
Stefka Fidanova ◽  
Krassimir Todorov Atanassov

Some of industrial and real life problems are difficult to be solved by traditional methods, because they need exponential number of calculations. As an example, we can mention decision-making problems. They can be defined as optimization problems. Ant Colony Optimization (ACO) is between the best methods, that solves combinatorial optimization problems. The method mimics behavior of the ants in the nature, when they look for a food. One of the algorithm parameters is called pheromone, and it is updated every iteration according quality of the achieved solutions. The intuitionistic fuzzy (propositional) logic was introduced as an extension of Zadeh’s fuzzy logic. In it, each proposition is estimated by two values: degree of validity and degree of non-validity. In this paper, we propose two variants of intuitionistic fuzzy pheromone updating. We apply our ideas on Multiple-Constraint Knapsack Problem (MKP) and compare achieved results with traditional ACO.

Filomat ◽  
2017 ◽  
Vol 31 (2) ◽  
pp. 513-522 ◽  
Author(s):  
Darko Drakulic ◽  
Aleksandar Takaci ◽  
Miroslav Maric

Covering location problems is well-known and very important class of combinatorial optimization problems. Standard models for covering location problems cannot encompass real-life problems, because real-life problems contain some degree of uncertainty. The use of fuzzy sets in modeling covering location problems allows the implementation of these conditions. Depending on the type of problems, it is necessary to use different aggregation operators in calculating solution?s quality. The aim of this study is introducing of fuzzy sets with different corresponding conorms in modeling most known types of covering location problems.


2021 ◽  
Vol 21 (1) ◽  
pp. 3-18
Author(s):  
Melda Kokoç ◽  
Süleyman Ersöz

Abstract Many authors agree that the Interval-Valued Intuitionistic Fuzzy Set (IVIFS) theory generates as realistic as possible evaluation of real-life problems. One of the real-life problems where IVIFSs are often preferred is the Multi-Criteria Decision-Making (MCDM) problem. For this problem, the ranking of values obtained by fuzzing the opinions corresponding to alternatives is an important step, as a failure in ranking may lead to the selection of the wrong alternative. Therefore, the method used for ranking must have high performance. In this article, a new score function SKE and a new accuracy function HKE are developed to overcome the disadvantages of existing ranking functions for IVIFSs. Then, two illustrative examples of MCDM problems are presented to show the application of the proposed functions and to evaluate their effectiveness. Results show that the functions proposed have high performance and they are the eligibility for the MCDM problem.


Author(s):  
Elyn L. Solano-Charris ◽  
Libardo S. Gómez-Vizcaíno ◽  
Jairo R. Montoya-Torres ◽  
Carlos D. Paternina-Arboleda

A large number of real-life optimization problems in economics and business are complex and difficult to solve. Hence, using approximate algorithms is a very good alternative to solve this class of problems. Meta-heuristics solution procedures represent general approximate algorithms applicable to a large variety of optimization problems. Most of the meta-heuristics mimic natural metaphors to solve complex optimization problems. This chapter presents a novel procedure based on Bacterial Phototaxis, called Global Bacteria Optimization (GBO) algorithm, to solve combinatorial optimization problems. The algorithm emulates the movement of an organism in response to stimulus from light. The effectiveness of the proposed meta-heuristic algorithm is first compared with the well-known meta-heuristic MOEA (Multi-Objective Evolutionary Algorithm) using mathematical functions. The performance of GBO is also analyzed by solving some single- and multi-objective classical jobshop scheduling problems against state-of-the-art algorithms. Experimental results on well-known instances show that GBO algorithm performs very well and even outperforms existing meta-heuristics in terms of computational time and quality of solution.


2019 ◽  
Vol 4 (2019) ◽  
pp. 3-12
Author(s):  
Fatma Mbarek ◽  
Volodymyr Mosorov

Combinatorial optimization challenges are rooted in real-life problems, continuous optimization problems, discrete optimization problems and other significant problems in telecommunications which include, for example, routing, design of communication networks and load balancing. Load balancing applies to distributed systems and is used for managing web clusters. It allows to forward the load between web servers, using several scheduling algorithms. The main motivation for the study is the fact that combinatorial optimization problems can be solved by applying optimization algorithms. These algorithms include ant colony optimization (ACO), honey bee (HB) and multi-objective optimization (MOO). ACO and HB algorithms are inspired by the foraging behavior of ants and bees which use the process to locate and gather food. However, these two algorithms have been suggested to handle optimization problems with a single-objective. In this context, ACO and HB have to be adjusted to multiobjective optimization problems. This paper provides a summary of the surveyed optimization algorithms and discusses the adaptations of these three algorithms. This is pursued by a detailed analysis and a comparison of three major scheduling techniques mentioned above, as well as three other, new algorithms (resulting from the combination of the aforementioned techniques) used to efficiently handle load balancing issues.


2016 ◽  
Vol 5 (4) ◽  
pp. 192-210 ◽  
Author(s):  
Bhagawati Prasad Joshi

Due to the huge applications of fuzzy set theory, many generalizations were available in literature. Atanassov (1983) and Atanassov and Gargov (1989) introduced the notions of intuitionistic fuzzy sets (IFSs) and interval-valued intuitionistic fuzzy sets (IVIFSs) respectively. It is observed that IFSs and IVIFSs are more suitable tools for dealing with imprecise information and very powerful in modeling real life problems. However, many researchers made efforts to rank IVIFSs due to its importance in fusion of information. In this paper, a new ranking method is introduced and studied for IVIFSs. The proposed method is compared and illustrated with other existing methods by numerical examples. Then, it is utilized to identify the best alternative in multiple criteria decision-making problems in which criterion values for alternatives are IVIFSs. On the basis of the developed approach, it would provide a powerful way to the decision-makers to make his or her decision under IVIFSs. The validity and applicability of the proposed method are illustrated with practical examples.


Author(s):  
Bhagawati Prasad Joshi ◽  
Akhilesh Singh

It has been seen in literature that the notion of intuitionistic fuzzy sets (IFSs) is very powerful tool to deal with real life problems under the environment of uncertainty. This notion of IFSs favours the intermingling of the uncertainty index in membership functions. The uncertainty index is basically generated from a lot of parameters such as lack of awareness, historical information, situation, short of standard terminologies, etc. Hence, the uncertainty index appended finding the membership grade under IFSs needs additional enhancement. Then, the concept of a moderator intuitionistic fuzzy set (MIFS) is defined by adding a parameter in the IFSs environment to make the uncertain behaviour more accurate. In this chapter, some new moderator intuitionistic fuzzy hybrid aggregation operators are presented on the basis of averaging and geometric point of views to aggregate moderator intuitionistic fuzzy information. Then, a multi-criteria decision-making (MCDM) approach is provided and successfully implemented to real-life problems of candidate selection.


2020 ◽  
Vol 39 (3) ◽  
pp. 4723-4730 ◽  
Author(s):  
A. A. Azzam ◽  
Ahmed Mostafa Khalil ◽  
Sheng-Gang Li

It is known that mathematical statics, mathematical modeling, and differential equations are used to give an in-depth understanding of many medical problems. On the edge of the information revolution, minimal structures show some qualitative properties issues that are difficult to deal with it, such as quality of education, nutrition, etc. The aim of this paper is to discuss two medical applications and show that a minimal structure space is suitable for analyzing several real-life problems. Then, the accuracy of the decision-making and attributes reduction of the medical information system are explained and obtained. Furthermore, we introduce a comparison between our approach and Pawlak’s approach to find accuracy for decision-making. Finally, the accuracy of decision-making via a variable precision model is improved.


2019 ◽  
Vol 8 (2) ◽  
pp. 110-125 ◽  
Author(s):  
Pranjal Talukdar ◽  
Palash Dutta

Ranking of interval valued intuitionistic fuzzy sets (IVIFSs) plays an important role because of its attraction and applicability to model uncertainty in real life problems. In this article, an attempt has been made to devise a new method for ranking of IVIFSs based on exponential function. The significance of the method is illustrated with the help of some numerical examples and the results are compared with other existing methods. Furthermore, a multi criteria decision making method is presented here to evaluate the final ranking of the alternatives using the proposed ranking method and discussed the consistency of so obtained results.


2016 ◽  
Vol 25 (01) ◽  
pp. 1660005
Author(s):  
Laura Climent ◽  
Richard J. Wallace ◽  
Barry O'Sullivan ◽  
Eugene C. Freuder

Data uncertainty in real-life problems is a current challenge in many areas, including Operations Research (OR) and Constraint Programming (CP). This is especially true given the continual and accelerating increase in the amount of data associated with real-life problems, to which Large Scale Combinatorial Optimization (LSCO) techniques may be applied. Although data uncertainty has been studied extensively in the literature, many approaches do not take into account the partial or complete lack of information about uncertainty in real-life settings. To meet this challenge, in this paper we present a strategy for extrapolating data from limited uncertain information to ensure a certain level of robustness in the solutions obtained. Our approach is motivated and evaluated with real-world applications of harvesting and supplying timber from forests to mills and the well known knapsack problem with uncertainty.


Author(s):  
Firoz Ahmad

AbstractThis study presents the modeling of the multiobjective optimization problem in an intuitionistic fuzzy environment. The uncertain parameters are depicted as intuitionistic fuzzy numbers, and the crisp version is obtained using the ranking function method. Also, we have developed a novel interactive neutrosophic programming approach to solve multiobjective optimization problems. The proposed method involves neutral thoughts while making decisions. Furthermore, various sorts of membership functions are also depicted for the marginal evaluation of each objective simultaneously. The different numerical examples are presented to show the performances of the proposed solution approach. A case study of the cloud computing pricing problem is also addressed to reveal the real-life applications. The practical implication of the current study is also discussed efficiently. Finally, conclusions and future research scope are suggested based on the proposed work.


Sign in / Sign up

Export Citation Format

Share Document