In classical transport models, it is always assumed that parameters such as the distance from each supply node to each demand node or the cost of transferring goods from one node to another, as well as quantities such as supply and demand are definite and definite amounts. But in real matters, considering these assumptions is not logical. On the other hand, there may be a real problem in mathem...

In this paper, we formulate the problem of trusted routing as a transaction of services over a complex networked environment. We present definitions from service-oriented environments which unambiguously capture the difference between trust and reputation relations. We show that the trustworthiness measures associated with these relations have a linear order embedded in them. Identifying this o...

In this paper we propose a new method to solve biobjective combinatorial optimization problems of the max-ordering type. The method is based on the two-phases method and ranking algorithms to eÆciently construct K best solutions for the underlying (single objective) combinatorial problem. We show that the method overcomes some of the diÆculties of procedures proposed earlier. We illustrate this...

Genetic algorithm for biobjective urban transit routing problem. The Nottingham ePrints service makes this work by researchers of the University of Nottingham available open access under the following conditions. · To the extent reasonable and practicable the material made available in Nottingham ePrints has been checked for eligibility before being made available. · Copies of full items can be...

In this paper, we present a study on the sensitivity of aggregation methods with respect to the weights associated with objective functions of a multiobjective optimization problem. To do this study, we have developped some measurements such as the speed metric or the distribution metric. We have performed this study on a set of biobjective optimization test problems: a convex, a non-convex, a ...

In this paper, we develop the fuzzy fixed charge transportation problem when the costs are the fuzzy numbers. The first step it transform into the classical fuzzy transportation problem. The next, we obtain the best approximation fuzzy on the optimal value of the fuzzy fixed-charge transportation problem. This method obtains a lower and upper bounds both on the fuzzy optimal value of the fuzzy ...

In this work, a two-echelon location-routing problem with time windows and transportation resource sharing (2E-LRPTWTRS) is solved by selecting facility locations optimizing vehicle routes. The optimal solutions improve the efficiency of logistics network based on geographical distribution service facilities customers. Furthermore, utilization maximized enabling strategies within among differen...