Automatic velocity picking by simulated annealing

Pareto optimal front

Automatic velocity picking is a multiobjective optimization problem. In this paper, we use a composite-objective function to find the optimal result. In fact, for multiobjective optimization, there exists a set of solutions known as Pareto optimal: no other solutions are feasible, which would decrease some objective without causing a simultaneous increase in at least one other objective. Several attempts (Nam and Park, 1999; Pereyra, 2009) have been made to explore the Pareto Front of multiobjective optimization. The next step of our project is to progress rapidly to the Pareto-optimal front, and then to finalize the result along the front in accordance with some constraints.