REDUCING THE NUMBER OF LONG-TERM ITEMS : OPTIMAL STRATEGY FOR A BAG-PACKING PROBLEM
スポンサーリンク
概要
- 論文の詳細を見る
When several items having different weights are packed into a bag, the sum weight of each packed bag needs to be constant. The problem at packing is how to determine the items to be included in a bag so that the sum weight should be closest to the desired weight. In this paper, the following two algorithms are shown; one is to solve as an optimization problem and the other is to solve as a constraint satisfaction problem. Comparing the two algorithms, their functional rolls are made clear. In order to reduce the number of items remaining in scale hoppers for a long time, a method is proposed in which each of the two algorithms can be turned over one after another. Simulation results seem to prove that the proposed method is preferable.
- 関西大学の論文
- 2005-03-21
著者
-
Uchiyama Hironobu
Department Of Mechanical Systems Engineering
-
Murakami Yoshihiro
Department Of Mechanical Systems Engineering
-
Marquardt Wolfgang
Departmet Of Mechanical Engineerin Rwth Aachen.
-
KURATA Junichi
Department of Mechanical Systems Engineering
-
Uchiyama Hironobu
Department Of Applied Chemistry And Chemical Engineering Yamaguchi University
関連論文
- SA-Based Scheduling Algorithm for Increasing Probability of Selecting Promising Schedules
- A FLEXIBLE SIMULATION SYSTEM FOR SCHEDULING WITH VARIOUS CONSTRAINTS
- Synthesis and Properties of Poly(methacrylate) Bearing a Phosphorylcholine Analogous Group
- REDUCING THE NUMBER OF LONG-TERM ITEMS : OPTIMAL STRATEGY FOR A BAG-PACKING PROBLEM
- Considerations in the Design and Improvement of a Fiber Optic Ammonia Sensor