This paper presents and experiments approaches to solve a new bi-objective routing problem called the ring star problem. It consists of locating a simple cycle through a subset of nodes of a graph while optimizing two kinds of cost. The first objective is the minimization of a ring cost that is related to the length of the cycle. The second one is the minimization of an assignment cost from non...

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 ...

the capacitated location-routing problem (clrp) is a new research area in logistics and distribution management. this problem combines two difficult problems: the facility location problem (flp) and vehicle routing problem (vrp). the goal of the clrp is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. the t...

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...