2011
DOI: 10.1016/j.omega.2010.09.002
|View full text |Cite
|
Sign up to set email alerts
|

Stochastic simulation based genetic algorithm for chance constrained data envelopment analysis problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
25
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 62 publications
(25 citation statements)
references
References 67 publications
0
25
0
Order By: Relevance
“…Some observations can be located on the efficient frontier in the deterministic DEA, while some stochastic inputs and outputs are by definition allowed to be around the efficient frontier can be allowed with the aim of conceptualizing the stochastic nature of the data into the model to adapt the measurement and specification errors. Stochastic input and output variations in DEA have been studied within various input-output DEA contexts by many scholars (see e.g., Olesen andPetersen, 2015, Olesen andPetersen, 1995;Huang and Li, 1996;Cooper et al, 1996Cooper et al, , 1998Cooper et al, , 2002Cooper et al, , 2004Land et al, 1993;Morita and Seiford, 1999;Sueyoshi, 2000;Talluri et al, 2006;Olesen, 2006;Bruni et al, 2009;Wu and Lee, 2010;Tsionas and Papadakis, 2010;Udhayakumar et al, 2011). Land et al (1993) were the first to extend the chance-constrained programming (CCP) DEA proposed by Charnes and Cooper (1959), in order to compute efficiency in the presence of uncertainty in which inputs are assumed to be deterministic and outputs are jointly normally distributed.…”
Section: Selective Literaturementioning
confidence: 99%
“…Some observations can be located on the efficient frontier in the deterministic DEA, while some stochastic inputs and outputs are by definition allowed to be around the efficient frontier can be allowed with the aim of conceptualizing the stochastic nature of the data into the model to adapt the measurement and specification errors. Stochastic input and output variations in DEA have been studied within various input-output DEA contexts by many scholars (see e.g., Olesen andPetersen, 2015, Olesen andPetersen, 1995;Huang and Li, 1996;Cooper et al, 1996Cooper et al, , 1998Cooper et al, , 2002Cooper et al, , 2004Land et al, 1993;Morita and Seiford, 1999;Sueyoshi, 2000;Talluri et al, 2006;Olesen, 2006;Bruni et al, 2009;Wu and Lee, 2010;Tsionas and Papadakis, 2010;Udhayakumar et al, 2011). Land et al (1993) were the first to extend the chance-constrained programming (CCP) DEA proposed by Charnes and Cooper (1959), in order to compute efficiency in the presence of uncertainty in which inputs are assumed to be deterministic and outputs are jointly normally distributed.…”
Section: Selective Literaturementioning
confidence: 99%
“…To name a few, Udhayakumar et al (2011) discussed the P-model of chance constrained data envelopment analysis, Poojari and Varghese (2008) used MC simulation technique for handling chance constraints in 'the news vendor problem' and Iwamura and Liu (1996) also used the same technique in their 'feed mixture problem'. But if the constraints fail to be regular or hard to be handled it is more convenient to deal with chance constraints by stochastic simulations.…”
Section: Stochastic Simulation For Chance Constraintsmentioning
confidence: 99%
“…Therefore, in this paper, chance constrained programming is applied to model the economy and safety operation of the distributed network. In previous literature, many optimization algorithms have been raised to solve chance constrained programming; for example, the genetic algorithm, the ant colony algorithm, and the particle swarm optimization [18][19][20]. Compared with other algorithms, the particle swarm optimization (PSO) algorithm has the obvious advantages of easy implementation, fewer parameters, and better optimization ability.…”
Section: Introductionmentioning
confidence: 99%