optimization of reservoir parameters is an important issue in petroleum exploration and production. the ant colony optimization(aco) is a recent approach to solve discrete and continuous optimization problems. in this paper, the ant colony optimization is usedas an intelligent tool to estimate reservoir rock properties. the methodology is illustrated by using a case study on shear wave velocity...

Recently, many meta-heuristic algorithms are proposed for optimization of various problems. Some of them originally are presented for continuous optimization problems and some others are just applicable for discrete ones. In the literature, sizing optimization of truss structures is one of the discrete optimization problems which is solved by many meta-heuristic algorithms. In this paper, in or...

Planning for supply water demands (drinkable and irrigation water demands) is a necessary problem. For this purpose, three subjects must be considered (optimization of water supply systems such as volume of reservoir dams, optimization of released water from reservoir and prediction of next droughts). For optimization of volume of reservoir dams, yield model is applied. Reliability of yield mod...

nonlinear knapsack problems (nkp) are the alternative formulation for the multiple-choice knapsack problems. a powerful approach for solving nkp is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

Graph coloring problem (GCP) is one of the most studied combinatorial optimization problems. It is important in theory and practice. There have been many algorithms for graph coloring problem, including exact algorithms and (meta-)heuristic algorithms. In this paper, we attempt another meta-heuristic method⎯particle swarm optimization to graph coloring problem. Particle swarm optimization (PSO)...

in this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. first we introduce a parametric equivalent of the problem. then a bisection and a generalized newton-based method algorithms are presented to solve it. in order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...

This paper addresses a gait generation problem for the compass-type biped robot on periodically unlevel grounds. We first derive the continuous/discrete compass-type biped robots (CCBR/DCBR) via continuous/discrete mechanics, respectively. Next, we formulate a optimal gait generation problem on periodically unlevel grounds for the DCBR as a finite dimensional nonlinear optimization problem, and...

Dense image matching is a fundamental lowlevel problem in Computer Vision, which has received tremendous attention from both discrete and continuous optimization communities. The goal of this paper is to combine the advantages of discrete and continuous optimization in a coherent framework. We devise a model based on energy minimization, to be optimized by both discrete and continuous algorithm...

The paper is devoted to discrete optimization of the viscous heatconducting fluid flows. In the problem under consideration we want to create a flow with desired properties using optimal heating or cooling on some boundary sections. Optimal control approach reduces this problem to the constrained minimization. In this case the cost functional describes the objectives, mathematical model is the ...