{"links":{},"id":184761,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00184761","sets":["1164:2735:9079:9313"]},"path":["9313"],"owner":"11","recid":"184761","title":["初期集団の改良によりパレートフロントへの収束性を高めた多目的遺伝的アルゴリズムによるITプロジェクトスケジューリング"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-12-04"},"_buckets":{"deposit":"61fd904c-e315-47e6-9dbb-9609f7552b90"},"_deposit":{"id":"184761","pid":{"type":"depid","value":"184761","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"初期集団の改良によりパレートフロントへの収束性を高めた多目的遺伝的アルゴリズムによるITプロジェクトスケジューリング","author_link":["409019","409020","409017","409018"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"初期集団の改良によりパレートフロントへの収束性を高めた多目的遺伝的アルゴリズムによるITプロジェクトスケジューリング"},{"subitem_title":"IT project scheduling based on a multi-objective genetic algorithm with fast convergence to Pareto front by an improved initial population strategy","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2017-12-04","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"首都大学東京大学院社会科学研究科経営学専攻／株式会社TransRecog"},{"subitem_text_value":"首都大学東京大学院社会科学研究科経営学専攻"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Business Administration, Graduate School of Social Sciences, Tokyo Metropolitan University / TransRecog CO., LTD.","subitem_text_language":"en"},{"subitem_text_value":"Department of Business Administration, Graduate School of Social Sciences, Tokyo Metropolitan University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/184761/files/IPSJ-MPS17116005.pdf","label":"IPSJ-MPS17116005.pdf"},"date":[{"dateType":"Available","dateValue":"2019-12-04"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-MPS17116005.pdf","filesize":[{"value":"788.2 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"17"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"3610f70a-598c-4c61-b90c-bf81c36d8943","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2017 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"小林, 敬明"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"森口, 聡子"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Takaaki, Kobayashi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Satoko, Moriguchi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10505667","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8833","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"本研究の目的は，IT プロジェクトにおいてプロジェクトの再計画が発生した場合，計算機でプロジェクトのスケジュールを自動的に生成することにより，スケジュールの最適化，再作成工数の削減，再作成の迅速化を実現することである．一般的にプロジェクトの納期と予算はトレードオフの関係にあり，優先度はプロジェクトがおかれた環境や状況次第で変化する．そこで本研究では，(1) 納期，(2) 要員の重複タスク日数，(3) 要員数の 3 式の目的関数を最小化するための多目的遺伝的アルゴリズムを用いたスケジュール生成ソフトウェアを提案する．このソフトウェアは，遺伝的アルゴリズムで使用する初期集団にパレートフロントの端に位置する複数のパレート最適解を予め含めることにより，パレートフロントへの収束性を高めている．ユーザは，このソフトウェアで生成された複数の準最適解の中から，プロジェクトの状況にあったスケジュールを選択することができる．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The purpose of this research is to realize an automatic generation of a project schedule which optimizes the schedule, reduces the number of rebuild man-hours and speeds up the re-creation when the project re-planning occurs in the IT project. In general, the project due date and the price have a trade-off relationship, and the priority varies depending on the environment and situation of the project. Therefore, in this research, we propose schedule generating software using a multi-objective genetic algorithm to minimize objective functions of (1) the due date, (2) the number of days in duplicate task for a member, and (3) the number of members. This software enhances the convergence speed to the Pareto front by a strategy in which an initial population of genetic algorithm includes beforehand some Pareto optimal solutions located at the edge of the Pareto front. The user can select a schedule suitable for the situation of the project from some semi-optimal solutions generated by this software.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告数理モデル化と問題解決（MPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2017-12-04","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"5","bibliographicVolumeNumber":"2017-MPS-116"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-19T00:52:04.607427+00:00","updated":"2025-01-20T03:11:06.191480+00:00"}