Altering the viewing parameters of a 3D object results in computer graphics images of varying quality. One aspect of image quality is the composition of the image. While the esthetic properties of an image are subjective, some heuristics used by artists to create images can be approximated quantitatively. We present an algorithm based on heuristic compositional rules for finding the format, vie...

We present a new algorithm called A*+BFHS for solving problems with unit-cost operators where A* and IDA* fail due to memory limitations and/or the existence of many distinct paths between same pair nodes. is based on breadth-first heuristic search (BFHS). combines advantages from both algorithms, namely A*'s node ordering, BFHS's savings, algorithms' duplicate detection. On easy problems, beha...

in this paper, the scheduling problem with nonresumable jobs and maintenance process is considered in order to minimize the makespan under two alternative strategies. the first strategy is to implement the maintenance process on the machine after a predetermined time period and the second one is to consider the maximum number of jobs that can be done with a special tool. we have proposed a new ...

this paper addresses the problem of minimizing the sum of maximum earliness and tardiness on identical parallel machines scheduling problem. each job has a processing time and a due date. since this problem is trying to minimize and diminish the values of earliness and tardiness, the results can be useful for just–in-time production systems. it is shown that the problem is np-hard. using effici...

abstract— in this paper we have tried to develop an altered version of the artificial bee colony algorithm which is inspired from and combined with the meta-heuristic algorithm of firefly. in this method, we have tried to change the main equation of searching within the original abc algorithm. on this basis, a new combined equation was used for steps of employed bees and onlooker bees. for this...

We present new performance results for the FFDH-3D and the COMB-3D heuristic for the three-dimensional strip packing problem (3dSPP) which were proposed in a preceding paper. There was shown that the absolute worst-case performance ratio of the COMB-3D heuristic is at most 5. In this paper, we prove that this bound is best possible. For the z-oriented 3dSPP we propose an adapted version of the ...

in this paper, a higher order continuum model is presented based on the cosserat continuum theory in 3d numerical simulation of shear band localization. as the classical continuum models suffer from the pathological mesh-dependence in strain softening models, the governing equations are regularized by adding the rotational degrees-of-freedom to conventional degrees-of-freedom. the fundamental r...

the multiple traveling salesman problem (mtsp) is a generalization of the famous traveling salesman problem (tsp), where more than one salesman is used in the solution. although the mtsp is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. this paper presents an efficient and evolutionary optimization algorith...