In this paper, bi-level linear programming problem with multiple objectives at each level in intuitionistic fuzzy environment is studied and solved. In this problem, technological coefficients and resources are characterized by intuitionistic fuzzy numbers having linear membership and non-membership function. Intuitionistic fuzzy efficient solution is computed for the upper level by the propose...

A lot of research effort has been put into community detection from all corners of academic interest such as physics, mathematics and computer science. In this paper I have proposed a Bi-Objective Genetic Algorithm for community detection which maximizes modularity and community score. Then the results obtained for both benchmark and real life data sets are compared with other algorithms using ...

We tackle the problem of finding a team of experts from a social network to complete a project that requires a set of skills. The social network is modeled as a graph. A node in the graph represents an expert and has a weight representing the monetary cost for using the expert service. Two nodes in the graph can be connected and the weight on the edge represents the communication cost between t...

In this paper, a real maintenance workforce-constrained scheduling problem is formulated as a bi-objective mixed-integer programming model with the aim of simultaneously minimizing the workforce requirements and maximizing the equipment availability. The skilled workforce is provided by internal and external resources using regular time, overtime and contracting. The equipment availability is m...

This paper deals with fuzzy goal programming approach to bilevel multi-objective programming problem with fuzzy parameters. In the proposed approach, the tolerance membership functions for the fuzzily described objective functions are defined by determining individual optimal solution of the objective functions of each of the decision makers. Since the objectives are potentially conflicting in ...

This paper presents an approach to solve the problem of scheduling printed circuit board assemblies on single production line to minimize total weighted tardiness and total feeder setups, which are sequence dependent. Preemptive integer goal programming model is constructed to represent the bi-objective problem. Although an optimal branch-and-bound method is available, its computational require...

Single objective evolutionary constrained optimization has been widely searched and researched by plethora of researchers in last two decades. On the other hand, multi-objective constraint handling using evolutionary algorithms has not been actively proposed. However, real-world multi-objective optimization problems consist of one or many non-linear and non-convex constraints. In the present wo...

The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, related to the length of the cycle, whereas the second one is to minimize an assignment cost, from non-visited nodes to visited ones. In spite of its natural multi-objective formulation, this problem has never been inv...

We present a new exact approach for solving bi-objective integer linear programs. The new approach efficiently employs two of the existing exact algorithms in the literature, including the balanced box and the -constraint methods, in two stages. A computationally study shows that (1) the new approach solves less single-objective integer linear programs in comparison to the balanced box method, ...

We study an online problem that occurs when the capacities of machines are heterogeneous and all jobs are identical. Each job is associated with a subset, called feasible set, of the machines that can be used to process it. The problem involves assigning each job to a single machine in its feasible set, i.e., to find a feasible assignment. The objective is to maximize the throughput, which is t...