This paper considers a biobjective transportation problem with various fuzzy objective functions coefficients. Fuzzy coefficients can be of different types such as triangular, trapezoidal, (semi) $L-R$, or flat (semi) $L-R$ fuzzy numbers. First, we convert the problem to a parametric interval biobjective transportation problem using $gamma$-cuts of fuzzy coefficients. Then, we consider a fix $g...

The multiobjective shortest path problem arises in many transportation and logistics applications, either as a stand-alone network routing problem or a subroutine of a more complex multiobjective network optimization problem. It has been addressed by different solution strategies, including labeling methods, ranking methods, constraint methods, and parametric methods. Increasing attention has b...

This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisited by Ehrgott and Gandibleux [9], as well as by Sourd and Spanjaard [17]. The idea behind it is very general, and can therefore be adapted to a wide range of biobjective combinatorial problem. We focus here on the bio...

Technology progress is a cause of industrial hazardous wastes increasing in the whole world . Management of hazardous waste is a significant issue due to the imposed risk on environment and human life. This risk can be a result of location of undesirable facilities and also routing hazardous waste. In this paper a biobjective mixed integer programing model for location-routing industrial hazard...

We study in this paper the generation of the Choquet optimal solutions of biobjective combinatorial optimization problems. Choquet optimal solutions are solutions that optimize a Choquet integral. The Choquet integral is used as an aggregation function, presenting di erent parameters, and allowing to take into account the interactions between the objectives. We develop a new property that chara...

In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...

A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version that pro...

Parallel Test Paper Generation (k-TPG) is a biobjective distributed resource allocation problem, which aims to generate multiple similarly optimal test papers automatically according to multiple userspecified criteria. Generating high-quality parallel test papers is challenging due to its NP-hardness in maximizing the collective objective functions. In this paper, we propose a Collective Biobje...

A parametric algorithm for identifying the Pareto set of a biobjective integer program is proposed. The algorithm is based on the weighted Chebyshev (Tchebycheff) scalarization, and its running time is asymptotically optimal. A number of extensions are described, including: a technique for handling weakly dominated outcomes, a Pareto set approximation scheme, and an interactive version that pro...

We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...