{"created":"2023-07-25T09:58:37.364703+00:00","id":1749,"links":{},"metadata":{"_buckets":{"deposit":"08594b27-fb76-4359-83c9-06ce21e7b3d0"},"_deposit":{"created_by":16,"id":"1749","owners":[16],"pid":{"revision_id":0,"type":"depid","value":"1749"},"status":"published"},"_oai":{"id":"oai:oacis.repo.nii.ac.jp:00001749","sets":["187:189:372","41:373","70:371"]},"author_link":["2892","2890","2895","2891","2894","2893"],"item_3_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2016","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"3","bibliographicPageStart":"JAMDSM0040","bibliographicVolumeNumber":"10","bibliographic_titles":[{"bibliographic_title":"Journal of Advanced Mechanical Design, Systems, and Manufacturing"}]}]},"item_3_description_4":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"In this paper, we consider the crew pairing problem in airline scheduling that calls for assigning crew members in order to cover all flights with the minimum total person-days under the constraints that the schedule of each crew member does not violate given constraints on the total working time, flying time, and the number of landings. In practical applications, it is difficult to create an efficient schedule satisfying all the constraints. We formulate the problem as a set covering problem and apply an LP-based column generation approach to generate a candidate set of schedules. We propose a branch-and-bound method based upon a resource constrained dynamic programming for the column generation procedure. Computational results are given for a number of large-scale instances with up to 10,000 flights. "}]},"item_3_description_63":{"attribute_name":"研究課題番号","attribute_value_mlt":[{"subitem_description":"15K16293"}]},"item_3_publisher_32":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"日本機械学会"}]},"item_3_relation_11":{"attribute_name":"DOI","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://doi.org/10.1299/jamdsm.2016jamdsm0040","subitem_relation_type_select":"DOI"}}]},"item_3_relation_13":{"attribute_name":"情報源","attribute_value_mlt":[{"subitem_relation_name":[{"subitem_relation_name_text":"Publisher's Version/PDF (OpenAccess)"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://doi.org/10.1299/jamdsm.2016jamdsm0040","subitem_relation_type_select":"DOI"}},{"subitem_relation_name":[{"subitem_relation_name_text":"日本機械学会"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://www.jsme.or.jp/","subitem_relation_type_select":"URI"}},{"subitem_relation_name":[{"subitem_relation_name_text":"KAKEN研究課題: 組合せ最適化問題に対する多点探索型メタ戦略の開発"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-15K16293/","subitem_relation_type_select":"URI"}},{"subitem_relation_name":[{"subitem_relation_name_text":"研究代表者: 橋本 英樹 (東京海洋大学)"}],"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://nrid.nii.ac.jp/ja/nrid/1000070548114/","subitem_relation_type_select":"URI"}}]},"item_3_relation_28":{"attribute_name":"論文ID（NAID）","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"130005161643","subitem_relation_type_select":"NAID"}}]},"item_3_source_id_7":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1881-3054","subitem_source_identifier_type":"ISSN"}]},"item_3_subject_62":{"attribute_name":"件名","attribute_value_mlt":[{"subitem_subject":"科学研究費研究成果"}]},"item_3_subject_64":{"attribute_name":"科学研究費研究課題","attribute_value_mlt":[{"subitem_subject":"組合せ最適化問題に対する多点探索型メタ戦略の開発"}]},"item_access_right":{"attribute_name":"アクセス権","attribute_value_mlt":[{"subitem_access_right":"metadata only access"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Wu, Wei"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hu, Yannan"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Hashimoto, Hideki"}],"nameIdentifiers":[{},{}]},{"creatorNames":[{"creatorName":"Ando, Tomohito"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Shiraki, Takashi"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yagiura, Mutsunori"}],"nameIdentifiers":[{}]}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"Crew scheduling problem","subitem_subject_scheme":"Other"},{"subitem_subject":"Column generation","subitem_subject_scheme":"Other"},{"subitem_subject":"Set covering problem","subitem_subject_scheme":"Other"},{"subitem_subject":"Dynamic programming","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article"}]},"item_title":"A column generation approach to the airline crew pairing problem to minimize the total person-days","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A column generation approach to the airline crew pairing problem to minimize the total person-days"}]},"item_type_id":"3","owner":"16","path":["371","372","373"],"pubdate":{"attribute_name":"公開日","attribute_value":"2019-06-03"},"publish_date":"2019-06-03","publish_status":"0","recid":"1749","relation_version_is_last":true,"title":["A column generation approach to the airline crew pairing problem to minimize the total person-days"],"weko_creator_id":"16","weko_shared_id":-1},"updated":"2023-07-25T10:44:09.779377+00:00"}