ログイン
言語:

WEKO3

  • トップ
  • コミュニティ
  • ランキング
AND
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "0747fb9f-c0ff-4426-8714-099cc24f74e4"}, "_deposit": {"id": "6497", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "6497"}, "status": "published"}, "_oai": {"id": "oai:kitami-it.repo.nii.ac.jp:00006497"}, "item_2_alternative_title_18": {"attribute_name": "\u305d\u306e\u4ed6\u306e\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_alternative_title": "Determination of the Load Restoration Sequence Taking into Consideration of the Cost of Power Interruptions ?An investigation of Computing Time of Branch and Bound Method\u2019s Solution -"}]}, "item_2_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "1981-01", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "1", "bibliographicPageEnd": "48", "bibliographicPageStart": "35", "bibliographicVolumeNumber": "12", "bibliographic_titles": [{"bibliographic_title": "\u5317\u898b\u5de5\u696d\u5927\u5b66\u7814\u7a76\u5831\u544a"}]}]}, "item_2_description_14": {"attribute_name": "\u30d5\u30a9\u30fc\u30de\u30c3\u30c8", "attribute_value_mlt": [{"subitem_description": "application/pdf", "subitem_description_type": "Other"}]}, "item_2_description_4": {"attribute_name": "\u6284\u9332", "attribute_value_mlt": [{"subitem_description": "When power interruptions happen through fault in a power system, the load should be restored by a sequence which minimizes the cost of power interruptions. Although this problem can be formulated as a linear programing problem based on certain assumptions, it must be formulated as a nonlinear programing problem, if some of these assumptions cannot be held. In latter case, the problem can be effectively solved by the branch and hound method, but, generally, the computing time exceeds the range of practical use. This is a result of the large number of variables. In this problem, it is discovered that the computing time is more than 10 minutes using HITAC/M-180, as the number of variables increases to more than 400. This difficulty can be overcome by introducing a new concept : block priority. Block priority maintains the priority order of one load and the others, as well as minimizing the cost of power interruptions. It allocates simultaneously, the variables of the problem to different levels of priority, giving less than 400 variables to any one priority level, this can reduce the computing time significantly. Nevertheless, it is considered that more work is necessary to develop different effective methods which can further decrease the computing time.", "subitem_description_type": "Abstract"}]}, "item_2_full_name_3": {"attribute_name": "\u8457\u8005\u5225\u540d", "attribute_value_mlt": [{"nameIdentifiers": [{"nameIdentifier": "32831", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "Koichi, NARA"}]}, {"nameIdentifiers": [{"nameIdentifier": "32832", "nameIdentifierScheme": "WEKO"}], "names": [{"name": "Susumu, YAMASHIRO"}]}]}, "item_2_publisher_32": {"attribute_name": "\u51fa\u7248\u8005", "attribute_value_mlt": [{"subitem_publisher": "\u5317\u898b\u5de5\u696d\u5927\u5b66"}]}, "item_2_select_15": {"attribute_name": "\u8457\u8005\u7248\u30d5\u30e9\u30b0", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "\u5948\u826f, \u5b8f\u4e00"}], "nameIdentifiers": [{"nameIdentifier": "32829", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "\u5c71\u57ce, \u8fea"}], "nameIdentifiers": [{"nameIdentifier": "32830", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "\u30d5\u30a1\u30a4\u30eb\u60c5\u5831", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2016-11-22"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "12-1-4.pdf", "filesize": [{"value": "5.6 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 5600000.0, "url": {"label": "12-1-4.pdf", "url": "https://kitami-it.repo.nii.ac.jp/record/6497/files/12-1-4.pdf"}, "version_id": "96f2c06d-a139-4f48-ac17-9292e35f23ec"}]}, "item_language": {"attribute_name": "\u8a00\u8a9e", "attribute_value_mlt": [{"subitem_language": "jpn"}]}, "item_resource_type": {"attribute_name": "\u8cc7\u6e90\u30bf\u30a4\u30d7", "attribute_value_mlt": [{"resourcetype": "departmental bulletin paper", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "\u505c\u96fb\u640d\u5931\u3092\u8003\u616e\u3057\u305f\u4e8b\u6545\u6642\u8ca0\u8377\u5fa9\u65e7\u9806\u5e8f\u306e\u6c7a\u5b9a\u624b\u6cd5* -\u5206\u679d\u9650\u5b9a\u89e3\u6cd5\u306e\u6f14\u7b97\u6642\u9593\u306e\u691c\u8a0e-", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "\u505c\u96fb\u640d\u5931\u3092\u8003\u616e\u3057\u305f\u4e8b\u6545\u6642\u8ca0\u8377\u5fa9\u65e7\u9806\u5e8f\u306e\u6c7a\u5b9a\u624b\u6cd5* -\u5206\u679d\u9650\u5b9a\u89e3\u6cd5\u306e\u6f14\u7b97\u6642\u9593\u306e\u691c\u8a0e-"}]}, "item_type_id": "2", "owner": "1", "path": ["7/15/33"], "permalink_uri": "https://kitami-it.repo.nii.ac.jp/records/6497", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "attribute_value": "2007-04-09"}, "publish_date": "2007-04-09", "publish_status": "0", "recid": "6497", "relation": {}, "relation_version_is_last": true, "title": ["\u505c\u96fb\u640d\u5931\u3092\u8003\u616e\u3057\u305f\u4e8b\u6545\u6642\u8ca0\u8377\u5fa9\u65e7\u9806\u5e8f\u306e\u6c7a\u5b9a\u624b\u6cd5* -\u5206\u679d\u9650\u5b9a\u89e3\u6cd5\u306e\u6f14\u7b97\u6642\u9593\u306e\u691c\u8a0e-"], "weko_shared_id": 3}
  1. 紀要掲載論文
  2. 北見工業大学研究報告
  3. Vol.12

停電損失を考慮した事故時負荷復旧順序の決定手法* -分枝限定解法の演算時間の検討-

https://kitami-it.repo.nii.ac.jp/records/6497
4e5d2d9f-9e0c-4f02-96dd-0fc4a82917a4
名前 / ファイル ライセンス アクション
12-1-4.pdf 12-1-4.pdf (5.6 MB)
Item type 紀要論文 / Departmental Bulletin Paper(1)
公開日 2007-04-09
タイトル
タイトル 停電損失を考慮した事故時負荷復旧順序の決定手法* -分枝限定解法の演算時間の検討-
言語
言語 jpn
資源タイプ
資源 http://purl.org/coar/resource_type/c_6501
タイプ departmental bulletin paper
その他のタイトル
その他のタイトル Determination of the Load Restoration Sequence Taking into Consideration of the Cost of Power Interruptions ?An investigation of Computing Time of Branch and Bound Method’s Solution -
著者 奈良, 宏一

× 奈良, 宏一

WEKO 32829

奈良, 宏一

Search repository
山城, 迪

× 山城, 迪

WEKO 32830

山城, 迪

Search repository
著者別名
識別子
識別子 32831
識別子Scheme WEKO
姓名
姓名 Koichi, NARA
著者別名
識別子
識別子 32832
識別子Scheme WEKO
姓名
姓名 Susumu, YAMASHIRO
抄録
内容記述タイプ Abstract
内容記述 When power interruptions happen through fault in a power system, the load should be restored by a sequence which minimizes the cost of power interruptions. Although this problem can be formulated as a linear programing problem based on certain assumptions, it must be formulated as a nonlinear programing problem, if some of these assumptions cannot be held. In latter case, the problem can be effectively solved by the branch and hound method, but, generally, the computing time exceeds the range of practical use. This is a result of the large number of variables. In this problem, it is discovered that the computing time is more than 10 minutes using HITAC/M-180, as the number of variables increases to more than 400. This difficulty can be overcome by introducing a new concept : block priority. Block priority maintains the priority order of one load and the others, as well as minimizing the cost of power interruptions. It allocates simultaneously, the variables of the problem to different levels of priority, giving less than 400 variables to any one priority level, this can reduce the computing time significantly. Nevertheless, it is considered that more work is necessary to develop different effective methods which can further decrease the computing time.
書誌情報 北見工業大学研究報告

巻 12, 号 1, p. 35-48, 発行日 1981-01
フォーマット
内容記述タイプ Other
内容記述 application/pdf
著者版フラグ
値 publisher
出版者
出版者 北見工業大学
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 06:51:02.751230
Show All versions

Share

Mendeley CiteULike Twitter Facebook Print Addthis

Cite as

Export

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by CERN Data Centre & Invenio


Powered by CERN Data Centre & Invenio