Research Articles

Permanent URI for this collectionhttps://scholar.mzumbe.ac.tz/handle/123456789/364

Browse

Filters

2021 - 20233

Settings

Author: search.filters.author.Mushi, Allen R.Start date: 2020

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    A new method for intuitionistic fuzzy multi-objective linear fractional optimization problem and its application in agricultural land allocation problem
    (Elsevier, 2023) Moges, Demmelash Mollalign; Mushi, Allen R.; Wordofa, Berhanu Guta
    This paper presents a new method for solving an intuitionistic fuzzy multi-objective linear fractional optimization (IFMOLFO) problem with crisp and intuitionistic fuzzy constraints. Here, all uncertain parameters are represented as triangular intuitionistic fuzzy numbers. We used an accuracy ranking function and variable transformation in the proposed method to convert an IFMOLFO problem into a crisp multi-objective linear optimization problem. Then, we formulated the first phase of the weighted intuitionistic fuzzy goal programming (WIFGP) model to obtain an intuitionistic fuzzy non-dominant (IFND) solution for the IFMOLFO problem. Several strategies for obtaining an IFND solution to the IFMOLFO problem have been proposed in the literature. However, in addition to constructing the phase-I WIFGP model, this study shows that the IFND solution may not be Pareto-optimal when some of the under-deviation variables are zero. As a result, the second phase of the WIFGP model is applied to address this issue. The benefits of both models are merged to provide a novel method, unlike any other method in the literature, for producing optimal solutions that satisfy both IFND and Pareto-optimal requirements. The suggested algorithm’s efficiency and reliability are demonstrated by addressing a real-life case study of an agricultural production planning problem and followed by solving a numerical example from literature.
  • Thumbnail Image
    Item
    Solving multi-objective multilevel programming problems using two-phase intuitionistic fuzzy goal programming method
    (Elsevier, 2022) Mollalign, Demmelash; Mushi, Allen R.; Guta, Berhanu
    This paper presents a two-phase intuitionistic fuzzy goal programming (two-phase IFGP) algorithm to solve Multi-Objective Multilevel Programming (MO-MLP) problems. The coefficient of each objective and constraint function is assumed to be triangular intuitionistic fuzzy parameters and the crisp MO-MLP problems are obtained using the accuracy function method. To avoid decision lock, the top levels set tolerance limits for decision variables to control the lower levels. The problem is modeled in the intuitionistic fuzzy environment using membership and non-membership functions for each objective function at all levels and decision variables controlled by the top levels. Then, we proposed an IFGP algorithm to achieve the highest degree of each membership and non-membership goal by minimizing unwanted deviational variables and generating compensatory solutions for all decision-makers at all levels. Moreover, in the proposed approach, two-phase IFGP is modeled to yield a compromise solution that satisfies both the MN-Pareto optimal solution and the Pareto optimal solution at each level. Also, verification of the proposed method is discussed with numerical examples.
  • Thumbnail Image
    Item
    Solving the University course timetabling problem using bat inspired algorithm
    (Tanzania Journal of Science, 2021) Limota, Ushindi; Mujuni, Egbert; Mushi, Allen R.
    Many mathematical optimization problems from real-life applications are NP-hard, and hence no algorithm that solves them to optimality within a reasonable time is known. For this reason, metaheuristic methods are mostly preferred when their size is big. Many meta-heuristic methods have been proposed to solve various combinatorial optimization problems. One of the newly introduced metaheuristic methods is a bat-inspired algorithm, which is based on the echolocation behaviour of microbats. Bat algorithm (BA) and its variants have been used successfully to solve several optimization problems. However, from the No-free Lunch Theorem, it is known that there is no universal metaheuristic method that can solve efficiently all optimization problems. Thus, this study work focused on investigating the usefulness of BA in solving an optimization problem called Course Teaching Problem (CTP). Since BA was originally designed to solve continuous problems, and CTP is a combinatorial optimization problem, a discrete version of BA for CPT has been proposed and tested using real-life data from the Dar es Salaam University College of Education (DUCE). The algorithm has produced promising results, as in each execution test, it generated a timetable in which all hard constraints were met and soft constraints were significantly satisfied within a few iterations.