Solving stochastic programming problems using modified differential evolution algorithms

Logic Journal of the IGPL 20 (4):732-746 (2012)
  Copy   BIBTEX

Abstract

Stochastic programming is an optimization technique in which the constraints and/or the objective function of an optimization problem contain random variables. The mathematical models of these problems may follow any particular probability distribution for model coefficients. The objective here is to determine the proper values for model parameters influenced by random events. In this study, two modified differential evolution algorithms namely, LDE1 and LDE2 are used for solving SP problems. Two models of SP problems are considered; Stochastic Fractional Programming Problems and Multiobjective Stochastic Linear Programming Problems. The numerical results obtained by the LDE algorithms are compared with the results of basic DE, basic particle swarm optimization and the available results from where it is observed that the LDE algorithms significantly improve the quality of solution of the considered problem in comparison with the quoted results in the literature

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,783

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Answer Sets and Qualitative Optimization.Gerhard Brewka - 2006 - Logic Journal of the IGPL 14 (3):413-433.
Selected papers on design of algorithms.Donald Ervin Knuth - 2010 - Stanford, Calif.: Center for the Study of Language and Information.

Analytics

Added to PP
2015-02-04

Downloads
5 (#1,537,892)

6 months
4 (#783,478)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references