Plan Modification Method by Using Relaxation Search
-
- Ikkai Yoshitomo
- Osaka University
-
- Yamasaki Yasushi
- Osaka University
-
- Ohkawa Takenao
- Osaka University
-
- Komoda Norihisa
- Osaka University
Bibliographic Information
- Other Title
-
- 条件緩和探索による計画修正方式
- ジョウケン カンワ タンサク ニヨル ケイカク シュウセイ ホウシキ
Search this article
Abstract
After a plan has been formed, it is often required to change the restrictions that were considered when the plan was formed. It is desired that new plan is similar to the initial plan, because change of preparation for a plan normally costs money and labor.<br>This paper proposes a partial plan set relaxation search method (PSRS method) for plan modification. This method can create the plan in which the initial plan is utilized, and modification costs is minimized. It divides whole search space into several partial plan sets, and narrows search space by “bounding operation”. It starts searching partial plan sets near the partial plan set which includes the initial plan, and then searches partial plan sets far from it. In this way, it can searches efficiently and selectively the plans near the initial plan. Applying the PSRS method to plan modification of a simple job shop problem, it has been obvious that the proposed method achieves a proper modification influenced by the difference value and the violation value.
Journal
-
- IEEJ Transactions on Electronics, Information and Systems
-
IEEJ Transactions on Electronics, Information and Systems 118 (6), 927-932, 1998
The Institute of Electrical Engineers of Japan
- Tweet
Details 詳細情報について
-
- CRID
- 1390282679585042560
-
- NII Article ID
- 130006844086
- 10004438643
- 10002814238
-
- NII Book ID
- AN10065950
-
- ISSN
- 13488155
- 03854221
-
- NDL BIB ID
- 4492066
-
- Data Source
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- Abstract License Flag
- Disallowed