多重集合の反復順列問題 -時系列献立計画問題- に対する探索の停滞からの脱出を考慮したGAの提案

カテゴリ: 論文誌(論文単位)

グループ名: 【C】電子・情報・システム部門

発行日: 2021/10/01

タイトル(英語): GAs with Escape from Stagnation of Search for Multiset Iteration Permutations Problem ― Consecutive Meals Planning ―

著者名: 加島　智子（近畿大学工学部），折登　由希子（広島大学大学院人間社会科学研究科/経済学部），染谷　博司（東海大学情報理工学部）

著者名(英語): Tomoko Kashima (Faculty of Engineering, Kindai University), Yukiko Orito (Department of Economics, Hiroshima University), Hiroshi Someya (School of Information Science and Technology, Tokai University)

キーワード: 時系列献立計画問題，多重集合，反復順列問題，順列表現型GA，探索の停滞からの脱出 consecutive meals planning，multiset，iteration permutation problem，permutation GA，escape from stagnation of search

要約(英語): In this paper, consecutive meals planning is formulated as a multiset iteration permutation problem that determines the optimal meals plan on a period consisting of consecutive days. In this problem, a meal is characterized by some characteristics such as food style, ingredient, cooking method, and so on. The evaluation function is defined by use of information entropy for measuring the appearance order of meal's characteristics on the meals plan. For optimizing this problem, Genetic Algorithms (GAs) with escape from stagnation of search are proposed. It is empirically shown that the proposed GAs with escape operation work better than the conventional permutation GA without escape operation for small and large size optimization problems.

本誌: 電気学会論文誌C（電子・情報・システム部門誌） Vol.141 No.10 （2021）

本誌掲載ページ: 1087-1100 p

原稿種別: 論文／日本語

電子版へのリンク: https://www.jstage.jst.go.jp/article/ieejeiss/141/10/141_1087/_article/-char/ja/