In this paper, the non preemptive multi-mode resourceconstrained project scheduling is considered. We use a biobjective approach to solve the mono-objective problem of makespan minimization. Our main focus is to propose a high-performance algorithm that solves the problem at hand. A new evolutionary algorithm is developed. The encoding procedure is based on feasible activity list and a mode ass...

This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation which can be considered an extension of usual dynamic programming models: path costs are recursively computed via functions which are assumed to be monotonic. A large part of the paper is devoted to analyze in detail th...

This paper deals with fair optimization problems where several agents are involved. In this setting, a solution is evaluated by a vector whose components are the utility of the agents for this solution, and one looks for solutions that fairly satisfy all the agents. Lorenz dominance has been proposed in economics to refine the Pareto dominance by taking into account satisfaction inequality amon...

In this paper, we study the fixed charge transportation problem with uncertain variables. The fixed charge transportation problem has two kinds of costs: direct cost and fixed charge. The direct cost is the cost associated with each source-destination pair, and the fixed charge occurs when the transportation activity takes place in the corresponding source-destination pair. The uncertain fixed ...

 In today’s highly competitive market, the pressure on organizations to find a better way to create and deliver value to customers is mounting. The decision involves many quantitative and qualitative factors that may be conflicting in nature. Here, we present a new model for transportation problem with consideration of quantitative and qualitative data. In the model, we quantify the qua...

In this paper, a step fixed charge transportation problem is developed where the products are sent from the sources to the destinations in existence of both unit and step fixed-charges. The proposed model determines the amount of products in the existing routes with the aim of minimizing the total cost (sum of unit and step fixed-charges) to satisfy the demand of each customer. As the problem i...

In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on backbone (i.e. network between hub nodes) and tributary networks (i.e. networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is c...

ABSTRACT. The so-called eigenvalues and eigenfunctions of the infinite Laplacian ∆∞ are defined through an asymptotic study of that of the usual p-Laplacian ∆p, this brings to a characterization via a non-linear eigenvalue problem for a PDE satisfied in the viscosity sense. In this paper, we obtain an other characterization of the first eigenvalue via a problem of optimal transportation, and re...

    Hub covering location problem, Network design,   Single machine scheduling, Genetic algorithm,   Shuffled frog leaping algorithm   Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....

The main aim of this paper is to find an optimal path to prolong the network lifetime and to find energy efficient routes for MANET. Routing involves path discovery based on Received Signal Strength (RSS) and residual energy and selection based on an optimized biobjective model. Biobjective here represents energy and hop. In path discovery process, initially, transmit power required is varied t...