Bounded Rational Online Bin Packing Solution Using Garbage Can Model
スポンサーリンク
概要
- 論文の詳細を見る
Bin Packing (BP) problem is one kind of typical combinatorial optimization problems concerned about packing a certain amount of different items into the minimal number of bins under specific constraints. In this paper, an organizational model called Garbage Can Model (GCM) is adopted to deal with a relaxed online BP problems. In GCM, the organizational structure and fluidities of problems and resources provide many optimization and re-combination opportunities for arriving items in stream. Different from traditional online BP algorithms, which usually result in a less-optimal solution in pursuing an extremely online executing speed, GCM-based algorithm achieves finding a bounded optimal solution for a relaxed online BP in a reactive fashion through seeking for a solution as optimal as possible as far as the time is allowed.
- 公益社団法人 計測自動制御学会の論文
公益社団法人 計測自動制御学会 | 論文
- Self-Excited Oscillation of Relay-Type Sampled-Data Feedback Control System
- タイトル無し
- Mold Level Control for a Continuous Casting Machine Using an Electrode-Type Mold-Level Detector
- Assessment and Control of Noise:Pollution by Noise from General Sources
- Information network system and home automation.