“…Gradients based methods showed less performance in history matching because of their tendency to get trapped in local minima. In stochastic methods, many authors have tried different algorithms like simulated annealing (SA) (Sultan et al, 1994), neighbourhood algorithm (NA) (Subbey et al, 2003), genetic algorithms (GA) (Castellini et al, 2005;Sangwai et al, 2007), scatter search (SS) (Sousa et al, 2006;Erbas and Christie, 2007), Markov chain Monte Carlo (McMC) (Maucec et al, 2007), particle swarm optimization (PSO) (Mohamed et al, 2009), ant colony optimization (Hajizadeh et al, 2011), differential evolution (DE) (Hajizadeh et al, 2010). It is observed that the differential evolution algorithm has shown good results for the history matching but the performance of the algorithm was very much sensitive to the value of control parameters such as crossover rate.…”