Entity

Time filter

Source Type

Toulouse, France

Guillaume R.,University Of Toulouse Irit | Kobylanski P.,Wroclaw University of Technology | Zielinski P.,Wroclaw University of Technology
Fuzzy Sets and Systems | Year: 2012

The paper deals with a lot sizing problem with ill-known demands modeled by fuzzy intervals whose membership functions are possibility distributions for the values of the uncertain demands. Optimization criteria, in the setting of possibility theory, that lead to choose robust production plans under fuzzy demands are given. Some algorithms for determining optimal robust production plans with respect to the proposed criteria, and for evaluating production plans are provided. Some computational experiments are presented. © 2012 Elsevier B.V.


Guillaume R.,University Of Toulouse Irit | Zielinski P.,Wroclaw University of Technology
Communications in Computer and Information Science | Year: 2012

The paper deals with a collaborative supply chain, where actors use Material Requirement Planning (MRP) with uncertain demands. The demand uncertainty is modeled by a scenario set containing all possible demand realizations. Three scenario based uncertainty representations are examined. The min-max and the Hurwicz criterion and the ordered weighted averaging aggregation(OWA) are adopted to choose a best production or procurement plan under the assumed uncertainty models. Efficient solution methods for finding optimal plans with respect to each optimization criterion are provided. © 2012 Springer-Verlag.


Faure L.,Ecole Nationale Superieure des Mines de Saint - Etienne CMP | Battaia G.,Ecole Nationale Superieure des Mines de Saint - Etienne CMP | Marques G.,Ecole Nationale Superieure des Mines de Saint - Etienne CMP | Guillaume R.,University Of Toulouse Irit | And 5 more authors.
IEEE International Conference on Digital Ecosystems and Technologies | Year: 2013

In this paper, we elaborate a methodology to study a particular case of collaborative network: city logistics. We identify that many solutions for urban logistics are, most of time, badly evaluated. Indeed, the theory often predicts a positive effect but the reality is most of time counterbalanced. We tried to fill this gap by making use of innovative methods. To do so, we mobilize several domains of knowledge: operational research, game theory and transportation studies on real cases. We suggest a solution to anticipate the level of activity of an Urban Consolidation Center and determine the condition under which it generates benefit for a carrier using or not, the collaborative network. We present the result obtained by application of our method on the real case of the city of Saint-Etienne. © 2013 IEEE.


Chaabani M.,University of Boumerdes | Echahed R.,Laboratoire Dinformatique Of Grenoble | Strecker M.,University Of Toulouse Irit
CEUR Workshop Proceedings | Year: 2013

This paper is about transformations of knowledge bases with the aid of an imperative programming language which is non-standard in the sense that it features conditions (in loops and selection statements) that are description logic (DL) formulas, and a non-deterministic assignment statement (a choice operator given by a DL formula). We sketch an operational semantics of the proposed programming language and then develop a matching Hoare calculus whose pre- and post-conditions are again DL formulas. A major diffculty resides in showing that the formulas generated when calculating weakest preconditions remain within the chosen DL fragment. In particular, this concerns substitutions whose result is not directly representable. We therefore explicitly add substitution as a constructor of the logic and show how it can be eliminated by an interleaving with the rules of a traditional tableau calculus.


Ober I.,University Of Toulouse Irit | Dragomir I.,University Of Toulouse Irit
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2011

Starting from version 2.0, UML introduced hierarchical composite structures, which are a very expressive way of defining complex software architectures, but which have a very loosely defined semantics in the standard. In this paper we propose a set of consistency rules that ensure UML composite structures are unambiguous and can be given a precise semantics. Our primary application of the static consistency rules defined in this paper is within the OMEGA UML profile [6], but these rules are general and applicable to other hierarchical component models based on the same concepts, such as MARTE GCM or SysML. The rule set has been formalized in OCL and is currently used in the OMEGA UML compiler. © 2011 Springer-Verlag Berlin Heidelberg.

Discover hidden collaborations