Nous proposons ici un modèle de Tarification basé sur une extension du formalisme des Jeux Coopératifs et qui prend en compte la notion d’Élasticité de la Demande. Nous présentons pour ce modèle un résultat d’existence ainsi qu’un algorithme de calcul associé. Nous interprétons enfin ce nouveau concept dans le cas d’un problème de production et nous le prolongeons au cas d’un problème de transport.
We propose here a pricing Model which is an extension of the Cooperative Game concept and which includes a notion of Elastic Demand. We present some existence results as well as some algorithms. We conclude by discussing this model in the context of some Production and Transportation problems.
The problem was motivated by Borůvka’s definitions of the carrier and the associated carrier. The inverse carrier problem is precisely defined and partially solved. Examples are given.
The logistics problems in business environments deal with assignation from a number of sources to a number of destinations. Each source offers amounts of goods, while each destination demands quantities of these goods. The object is to find the cheapest transporting schedule that satisfies the demand without violating supply restraints. In this paper we propose to use Fuzzy Sets to represent the previsional information related to costs, demands and other variables. Moreover, we suggest including...
In this paper, we propose an industrial symbiosis network equilibrium model by using nonlinear complementarity theory. The industrial symbiosis network consists of industrial producers, industrial consumers, industrial decomposers and demand markets, which imitates natural ecosystem by means of exchanging by-products and recycling useful materials exacted from wastes. The industrial producers and industrial consumers are assumed to be concerned with maximization of economic profits as well as minimization...
Periodic Vehicle Routing Problem: classification and heuristic for tactical planning. The Periodic Vehicle Routing Problem (PVRP) consists in assigning customer visits to vehicle routes in some periods of a time horizon so as to satisfy some service level requirements that can take the form of frequency of visit, constraint on time lag between visits, or pre-defined visit patterns. We present different variants of this problem and propose a classification. Then, we consider a model for tactical...
This paper proposes a specialized LP-algorithm for a sub problem arising in simple Profit maximising Lot-sizing. The setting involves a single (and multi) item production system with negligible set-up costs/times and limited production capacity. The producer faces a monopolistic market with given time-varying linear demand curves.
In recent research in the optimization of transportation networks, the problem was formalized as finding the optimal paths to transport a measure y+ onto a measure y- with the same mass. This approach is realistic for simple good distribution networks (water, electric power,. ..) but it is no more realistic when we want to specify who goes where, like in the mailing problem or the optimal urban traffic network problem. In this paper, we present a new framework generalizing the former approathes...
For a multidimensional control problem involving controls , we construct a dual problem in which the variables ν to be paired with u are taken from the measure space rca (Ω,) instead of . For this purpose, we add to a Baire class restriction for the representatives of the controls u. As main results, we prove a strong duality theorem and saddle-point conditions.
In this paper we deal with the preemptive asymmetric stacker crane problem in a heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation an integer linear programming model together with simple and efficient greedy and local search heuristics. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and evaluating the impact of the...
In this paper we deal with the preemptive asymmetric stacker crane problem in a heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation an integer linear programming model together with simple and efficient greedy and local search heuristics. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and evaluating the impact of the...