The p-median problem is one of the discrete optimization problem in location theory which aims to satisfy total demand with minimum cost. A high-level algorithmic approach can be specialized to solve optimization problem. In recent years, meta-heuristic methods have been applied to support the solution of Combinatorial Optimization Problems (COP). Collision Bodies Optimization algorithm (CBO) a...

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...

We establish a relationship between general constrained pseudoconvex optimization problems and globally projected dynamical systems. A corresponding novel neural network model, which is globally convergent and stable in the sense of Lyapunov, is proposed. Both theoretical and numerical approaches are considered. Numerical simulations for three constrained nonlinear optimization problems a...

The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the Disc Covering Problem on a Line. The cost of each sensor includes a fixed component f , and a variable component b that is proportional to the field-of-view area. When only one type of sensor or, in general, one type of disc, is availa...

The Leech lattice is the exceptional lattice in dimension 24. Soon after its discovery by Leech [9], it was conjectured that it is extremal for several geometric problems in R: the kissing number problem, the sphere packing problem, and the sphere covering problem. In 1979, Odlyzko and Sloane and independently Levenshtein solved the kissing number problem in dimension 24 by showing that the Lee...

in this article, multiple-product pvrp with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. a mathematical formulation was provided for this problem. each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. to solve the problem, two meta-heuristic methods...

When designing a product that needs to fit the human shape, designers often use a small set of 3D models, called design models, either in physical or digital form, as representative shapes to cover the shape variabilities of the population for which the products are designed. Until recently, the process of creating these models has been an art involving manual interaction and empirical guesswor...

We study in this paper a cutting-covering problem, defined by us in [2] and [3], the problem of covering a rectangular support with rectangular pieces cut from a roll. We first prove that the algorithm used in [2] and [3] for the rectangular cutting-covering problem without losses is not optimal. Starting from a decomposition of a natural number in sums of naturals we develop an algorithm for a...

Engineering optimization needs easy-to-use and efficient optimization tools that can be employed for practical purposes. In this context, stochastic search techniques have good reputation and wide acceptability as being powerful tools for solving complex engineering optimization problems. However, increased complexity of some metaheuristic algorithms sometimes makes it difficult for engineers t...

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i List of publications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iii Acknowledgement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vi