We introduce a new bin packing problem, termed the circle problem with circular items (CBPP-CI). The involves all into multiple identical bins as compact possible objective of minimizing number used bins. first define tangent occupying action (TOA) and propose constructive greedy algorithm that sequentially packs places to packed or boundaries. Moreover, avoid falling local minimum trap efficie...

Two well known stochastic optimization algorithms, simulated annealing and genetic algorithm are compared when using a sample to minimize an objective function which is the expectation of a random variable. Since they lead to minimum depending on the sample, a weighted version of simulated annealing is proposed in order to reduce this kind of overt bias. The algorithms are implemented on an opt...

This paper presents a novel approach to the recovery of generic solid parts of objects from real 2D images. The part vocabulary chosen is the one of geons, which are qualitative volumetric part primitives that are deened by simple but perceptually relevant properties which are viewpoint quasi-invariant. Most previous works on detection and recognition of geons from 2D images relied on quasi-per...

This paper presents a novel approach to the recovery of generic solid parts of objects from real 2D images. The part vocabulary chosen is the one of geons, which are qualitative volumetric part primitives that are deened by simple but perceptually relevant properties which are viewpoint quasi-invariant. Most previous works on detection and recognition of geons from 2D images relied on quasi-per...

Adaptive infinite-impulse-response (IIR) filtering provides a powerful approach for solving a variety of practical problems. Because the error surface of IIR filters is generally multi-modal, global optimisation techniques are required in order to avoid local minima. We apply a global optimisation method, called the adaptive simulated annealing (ASA), to digital IIR filter design. An important ...

In this paper we describe a number of global optimisation problems connected to spacecraft trajectory design. Each problem is coded in the form of a blackbox objective function accepting, as inputs, the decision vector and returning the objective function and the constraint evaluation. The code is made available on line as a challenge to the community to develop performing algorithms able to so...

In this study, a temperature parallel simulated annealing with adaptive neighborhood (TPSA/AN) for continuous optimization problems is introduced. TPSA/AN is based on the temperature parallel simulated annealing (TPSA), which is suitable for parallel processing, and the SA that Corana developed for continuous optimization problems. The moves in TPSA/AN are adjusted to have equal acceptance rate...

The theory of optimal control is applied to obtain minimum-time trajectories for solar sail spacecraft for interplanetary missions. We consider the gravitational and solar radiation forces due to the Sun. The spacecraft is modelled as a flat sail of mass m and surface area A and is treated dynamically as a point mass. Coplanar circular orbits are assumed for the planets. We obtain optimal traje...