This paper presents a new two-phase algorithm for the bi-objective minimum spanning tree (BMST) problem. In first phase, it computes extreme supported efficient solutions resorting to both mathematical programming and algorithmic approaches, while second phase is devoted obtaining remaining (non-extreme non-supported). latter based on recursive procedure capable of generating all trees connecte...

In this paper, we study the bi-objective prize-collecting Steiner tree problem, whose goal is to find a subtree that minimizes the edge costs for building that tree, and, at the same time, to maximize the collected node revenues. We propose to solve the problem using an ǫ-constraint algorithm. This is an iterative mixed-integerprogramming framework that identifies one solution for every point o...

In order to solve the two-sided matching problem based on uncertain score information, a new method is presented. Firstly, the description of the two-sided matching problem with uncertain scores is given. Secondly, the satisfaction degrees of each agent towards the agents on the other side are calculated. A multi-objective optimization model to maximize the satisfaction degrees of agents is set...

A new formulation of bi-objective optimization for the general capacitor placement and sizing problem is presented. The objectives include energy loss reduction, investment cost minimization, and maximum voltage deviation improvement. The operating and expansion constraints of the system are considered for practical needed. Also, both fixed and switched types of capacitors are included. A parti...

In this paper, we propose an extension of the classical location area planning (LAP) problem in the wireless telephony system including additional objectives and constraints. The bi-objective location area planning (BOLAP) problem considers the minimisation of both distance costs between base A bi-objective location area planning for wireless phone network 343 transceiver stations and the base ...

Recently, fuzzy linear programming problems have been considered by many. In the literature of fuzzy linear programming several models are offered and therefore some various methods have been suggested to solve these problems. One of the most important of these problems that recently has been considered; are Fully Fuzzy Linear Programming (FFLP), which all coefficients and variables of the prob...

In this paper the real-world occurrence of the multiple-product multiple-constraint single period newsboy problem with two objectives, in which there is incremental discounts on the purchasing prices, is investigated. The constraints are the warehouse capacity and the batch forms of the order placements. The first objective of this problem is to find the order quantities such that the expected ...