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.
In the order allocation to in-stock slabs problem, it is necessary to optimize both the selection thick and flat pieces of steel plate, that is called in-stock slabs, for each orders and the order arrangement in hot rolling plates. The optimum solution in this problem is to produce as many high priority orders as possible while using the slabs as efficiently as possible, i.e. reducing waste material as much as possible.We have approached this in-stock allocation problem as a combinatorial optimization problem and have successfully applied a combinatorial optimization method known as the genetic algorithms (GA) to achieve an optimal allocation and arrangement.We present the GA based system in this paper. As the in-stock allocation problem became more complicated (number of constraints included, number of orders, number of slabs, etc.) the calculation time began to exceed the allocated production planning time. In this system we divided the problem into sub problems while maintaining solution quality. By allocating the given calculation time among the small problems we were able to obtain a good solution in a feasible calculation time.In general, it is difficult to solve the problem which includes a vast of array of solution constraints and restrictions using GA. The order allocation problem has many these constraints such as order/slab material composition restriction, machine dictated order arrangement constraints and so on. In the proposed system, by introducing a new coding and decoding method which considers these constraints, it is possible to enable the application of GA.Furthermore, in this problem it is necessary to satisfy the two objectives of order priority and yield rate. By the construction of the evaluation function and the tuning of the weighting coefficients we were able to develop a system which satisfies two objectives.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.