Elsevier

Expert Systems with Applications

Volume 38, Issue 9, September 2011, Pages 11527-11533
Expert Systems with Applications

Chance-constrained programming on sugeno measure space

https://doi.org/10.1016/j.eswa.2011.03.029Get rights and content

Abstract

Uncertain programming is a theoretical tool to handle optimization problems under uncertain environment, it is mainly established in probability, possibility, or credibility measure spaces. Sugeno measure space is an interesting and important extension of probability measure space. This motivates us to discuss the uncertain programming based on Sugeno measure space. We have constructed the first type of uncertain programming on Sugeno measure space, i.e. the expected value models of uncertain programming on Sugeno measure space. In this paper, the second type of uncertain programming on Sugeno measure space, i.e. chance-constrained programming on Sugeno measure space, is investigated. Firstly, the definition and the characteristic of α-optimistic value and α-pessimistic value as a ranking measure are provided. Secondly, Sugeno chance-constrained programming (SCCP) is introduced. Lastly, in order to construct an approximate solution to the complex SCCP, the ideas of a Sugeno random number generation and a Sugeno simulation are presented along with a hybrid approach.

Highlights

► Chance-constrained programming on Sugeno measure space (SCCP) is shown. ► We give the definitions of α-pessimistic and α-optimistic values. ► The definitions and properties of SCCP models are provided. ► We give algorithmic components such as the Sugeno random number generation and Sugeno simulation. ► A numeric example illustrated that the proposed hybrid approach to solve the SCCP by Sugeno simulation is feasible.

Introduction

Uncertainty permeates many branches of decision sciences, engineering, information sciences, system sciences, just to name a few representative disciplines. Because of the factor of uncertainty that is omnipresent in various decision-making systems, we are faced with a genuine challenge when it comes to optimization issues. This has triggered an emergence of different types of methods stemming from uncertain programming. Some of the earliest developments along this line came under the banner of stochastic programming (Charnes and Cooper, 1959, Liu, 1997, Liu, 1999, Liu et al., 2003). In 1970’s, Zadeh (1978) introduced the concept of possibility measure which was further advanced by Dubois and Prade, 1988a, Dubois and Prade, 1998b. Based on probability and possibility measures, Liu (2003) introduced an axiomatic system to study the fuzziness along with a new concept of credibility measure. Fuzzy programming (Liu, 1998, Liu, 1999, Liu and Iwamura, 1998a, Liu and Iwamura, 1998b, Liu and Liu, 2002), random fuzzy programming (Liu, 2002a, Liu, 2002b, Liu and Liu, 2003a), fuzzy random programming (Liu, 2001a, Liu, 2001b, Liu and Liu, 2003b), and rough programming (Liu et al., 2003) are examples of uncertain programming addressing a diversity of existing facets of uncertainty. Gao and Liu, 2005, Liu, 1998, Liu, 1999, Liu, 2001a, Liu, 2001b, Liu, 2002a, Liu, 2002b, Liu, 2003, Liu and Iwamura, 1998a, Liu and Iwamura, 1998b, Liu and Liu, 2002, Liu and Liu, 2003a, Liu and Liu, 2003b, Liu and Liu, 2005, Zheng and Liu, 2006 aimed at the unification of the methods of uncertain programming providing a systematic development framework. Uncertain programming is a theoretical tool to handle optimization under uncertain environment. It has already been applied to system reliability design, project scheduling, vehicle routing, facility location, machine scheduling, inventory problems, and others (Liu, 1999). In spite of the progress being made, some limitations exist. For instance, when dealing with stochastic programming, it is established in the probability space in which we require a satisfaction of the additivity property. In reality, however, this requirement of stochastic programming cannot be easily satisfied or might not be satisfied at all (Ha et al., 2006, Pap, 2002).

When looking at some possible extensions and generalizations of conceptual appeal and practical relevance, Sugeno measure (Sugeno, 1974), which is an important generalization of probability measures (Wang & Klir, 1992) in terms of their non-additive behavior, arises as an interesting alternative. Sugeno measure is a sound representative of non-additive measures which offer an ability to deal with subjective judgment, fuzzy fusion, decision making and non-repeated experimentation, cf. (Basile, 1987, Leszczynski et al., 1985, Melin et al., 2008, Mesiar and Ouyang, 2009, Nather, 1991, Soria-Frisch et al., 2007, Sridhar et al., 2008, Wierzchon, 1983). As an illustration, let us consider an example of choosing a TV set. For convenience, let the universe of discourse consists of two properties characterizing the TV set such as image quality (a) and sound quality (b), say X = {a, b}. Let P(X) denote the power set of X while μ describes an importance degree of various elements of P(X)(which are also referred to as a purchasing possibility). Evidently a TV set with no image and voice will not be purchased. In other words, the purchasing possibility in this case is equal to 0. On the other hand, if we encounter a TV set with excellent quality of image and voice will be purchased hence in this case the purchasing possibility is equal to 1. Usually, the quality of image is more important than the quality of voice, so this might result in purchasing possibilities of 0.4 and 0.2, respectively. In this problem, we could easily encounter more criteria including price, reliability, and others. Considering the subjectivity permeating this problem, one may express it in terms of the following measureμ(E)=0E=ϕ,0.4E={a},0.2E={b},1E=X.Evidently, the above measure μ is non-additive as (μ(X)  μ({a}) + μ({b})), that is, μ is not a probability measure. Simultaneously, it is easy to see that μ is neither a possibility measure (Zadeh, 1978), nor a credibility measure (Liu, 2003). We can show that this is a Sugeno measure, with λ = 5 (Ha, Zhang, Pedrycz, & Xing, 2009) (For the sake of readability and ductibility of this paper, we revisit the above statements of Ha et al. (2009)).

We have studied the first type of uncertain programming on Sugeno measure space, i.e. the expected value models of uncertain programming on Sugeno measure space (Ha et al., 2009). The chance-constrained programming is an important part of uncertain programming. This study focuses on the development of models of chance-constrained programming defined in Sugeno measure spaces, which is the second type of uncertain programming on Sugeno measure space.

Section snippets

Preliminaries

For the sake of convenience and completeness of our investigations, we offer some basic definitions and properties:

Definition 1

Sugeno, 1974, Wang and Klir, 1992

Let X be a nonempty set, ζ be a nonempty class of subsets of X, and μ be a nonnegative real valued set function on ζ. We say that μ satisfies the λ-rule (on ζ) iff there exists λ-1supμ,{0}, where supμ = supEζμ (E), such thatμ(EF)=μ(E)+μ(F)+λ·μ(E)·μ(F),wheneverEζ,Fζ,EFζ,andEF=ϕ,μsatisfies the finite λ-rule (on ζ) iff there exists λ, such thatμi=1nEi=1λi=1n[1+λ·μ(Ei)]-1,λ0,

Uncertain programming on Sugeno measure space

To motivate our considerations, let us start with a simple example. In a factory, the unit price of commodity i is given as xi (i = 1, 2,  , p). We have found through market analysis that the corresponding selling ability ξi (i = 1, 2,  , p) are gλ random variables. We would like to come up with the unit price vector x = (x1, x2,  , xp), so that the resulting profit i=1pxiξi becomes maximized.

If we express the problem in the form of some uncertain programming on the Sugeno measure space, the resulting model

Conclusions

In this study, we firstly discussed the gλ random variable and its distribution function on Sugeno measure space, analyzed its numerical character, and proved some important theorems. We showed how to extend the uncertain programming to Sugeno measure space. After the α-pessimistic and α-optimistic values had been given, chance-constrained programming on Sugeno measure space was also shown. The definitions and properties of these models were provided along with algorithmic components such as

Acknowledgements

This work is supported by the National Natural Science Foundation of China (No. 60773062; 60903089), the Natural Science Foundation of Hebei Province (No. 2008000633; F2009000231), the Key Scientific Research Project of Hebei Education Department (No. 2005001D), and the Scientific Research Project of Department of Education of Hebei Province (No. 2008306).

References (35)

  • R. Mesiar et al.

    General Chebyshev type inequalities for Sugeno integrals

    Fuzzy Sets and Systems

    (2009)
  • W. Nather

    Sugeno’s λ-fuzzy measures as hit-or-miss probabilities of Poisson point processes

    Fuzzy Sets and Systems

    (1991)
  • A. Soria-Frisch et al.

    Fuzzy fusion for skin detection

    Fuzzy Sets and Systems

    (2007)
  • S.T. Wierzchon

    An algorithm for identification of fuzzy measure

    Fuzzy Sets and Systems

    (1983)
  • L.A. Zadeh

    Fuzzy sets as a basis for a theory of possibility

    Fuzzy Sets and Systems

    (1978)
  • Y. Zheng et al.

    Fuzzy vehicle routing model with credibility measure and its hybrid intelligent algorithm

    Applied Mathematics and Computation

    (2006)
  • A. Charnes et al.

    Chance-constrained programming

    Management Science

    (1959)
  • Cited by (5)

    • Security-based multi-objective congestion management for emission reduction in power system

      2015, International Journal of Electrical Power and Energy Systems
      Citation Excerpt :

      The relevant uncertainty should be handled in the proposed multi-objective optimisation approach. For this purpose, a combination of augmented ε-constraint [20,10] and chance-constraint [30,27] is proposed in the a priori stage. For the a postriori stage, two strategies are proposed: In the first strategy, based on a proposed managerial vision, a combination of CCR-DEA [6,31], cross-efficiency [28] and robustness analysis is utilised to ease decision making procedure by overcoming the problem of assigning weights to the objective functions and/or provision of higher-level information.

    • Micro-immune optimization algorithm for solving probabilistic optimization problems

      2016, Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics
    View full text