Optimization of Cutting Stock Schedule by Simulated Annealing Method

Abstract

This paper describes about cutting stock scheduling system using simulated annealing method. The cutting stock problem is that of combinatorial optimization. The following functions are needed for the cutting stock scheduling system. 1) Balance adjusting function for productivity, yield rate and delivery time. 2) The results of scheduling have to satisfy constraint condition of coil cutting machine. 3) There is time limitation for making cutting stock schedule. To overcome these problem, we realize new cutting stock scheduling system through following methods. 1) Weights for each evaluated item are introduced and sum of these items are minimized by simulated annealing. 2) The new neighborhood structure is developed for this problem which can satisfy constraint condition of coil cutting machine. 3) The adjusting parameter for calculation time is newly introduced for Huang's annealing schedule, so that we can select best solution under the limit of calculation time. This cutting stock scheduling system is applied to plate plant and used as one of production planning system.

An Overview of Three-Dimensional Videos: 3D Content Creation, 3D Representation and Visualization

“…The main goal is the reconstruction and rendering of human bodys from any viewpoint and estimate its motion parameters. Another curved setting can be found in [40] where 12 cameras where placed at the ceiling, around the scene.…”

“…[42] In the context of 3DV and FVV silhouettes approaches have been widely used to recover the 3D object surface. The systems in [39,40,45,67] employ the same volumetric strategy: the visual hull volume is computed, then it is divided in voxels. For each frame and viewing position all voxels are marked as occupied (object portion) or empty (background portion).…”

“…Many developed 3DV and FVV systems are based on polygonal mesh representation [6,37,71]. In [39][40][41]45, 67] a triangular mesh is obtained from a voxel representation via marching cubes algorithm, after silhouette-based reconstruction. In reference [37] instead of marching cubes algorithm the authors perform multi-level partition of unity implicits (MPLU) [49].…”