New Approach Combining Branch and Price with Metaheuristics to Solve Nurse Scheduling Problem

• Inafune Junya

  Muroran Institute of Technology

• Watanabe Shinya

  Muroran Institute of Technology

• Okudera Masayoshi

  Muroran Institute of Technology

抄録

This paper presents a new approach combining Branch and Price (B&P) with metaheuristics to derive various high-quality schedules as solutions to a nurse scheduling problem (nurse rostering problem). There are two main features of our approach. The first is the combination of B&P and metaheuristics, and the second is the implementation of an efficient B&P algorithm. Through applying our approach to widely used benchmark instances, the effectiveness of our approach is determined.

収録刊行物

• Journal of Advanced Computational Intelligence and Intelligent Informatics

  Journal of Advanced Computational Intelligence and Intelligent Informatics 21 (7), 1251-1261, 2017-11-20

  富士技術出版株式会社

キーワード

• nurse scheduling problem
• branch-and-price
• metaheuristics
• evolutionary multi-objective optimization

詳細情報

• CRID: 1390564238047794816
• NII論文ID: 130007520170
• NII書誌ID: AA12042502
• DOI: 10.20965/jaciii.2017.p1251
• ISSN: 18838014
• ISSN: 13430130
• HANDLE: 10258/00009662
• NDL書誌ID: 028645693
• Web Site: https://muroran-it.repo.nii.ac.jp/records/9710
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I028645693
• Web Site: https://www.fujipress.jp/main/wp-content/themes/Fujipress/phyosetsu.php?ppno=JACII002100070014
• 本文言語コード: en
• データソース種別:
  • JaLC
  • IRDB
  • NDL
  • Crossref
  • CiNii Articles
  • KAKEN
• 抄録ライセンスフラグ: 使用不可