Kansei engineering, humans and computers: efficient dynamic programming algorithms for combinatorial food packing problems

  • Authors:

  • Shinji Imahori;Yoshiyuki Karuno;Hiroshi Nagamochi;Xiaoming Wang

  • Affiliations:

  • Department of Computational Science and Engineering, Nagoya University, Furo-cho, Chikusa-ku, Nagoya-shi, Aichi 464-8603, Japan.;Department of Mechanical and System Engineering, Kyoto Institute of Technology, Matsugasaki, Sakyo-ku, Kyoto-shi, Kyoto 606-8585, Japan.;Department of Applied Mathematics and Physics, Kyoto University, Yoshida-honmachi, Sakyo-ku, Kyoto-shi, Kyoto 606-8501, Japan.;Department of Mechanical and System Engineering, Kyoto Institute of Technology, Matsugasaki, Sakyo-ku, Kyoto-shi, Kyoto 606-8585, Japan

  • Venue:
  • International Journal of Biometrics
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The packing system performs an operation of choosing a subset I′ from the set of I of the current n items to produce a package of foods. By repeating the packing operation, it produces a large number of packages one by one. The primary objective is to choose a subset I′ so that the total weight of chosen items is as close to a specified target weight T as possible. We additionally try to maximise the total priority of chosen items as the second objective so that items with longer durations in hoppers are preferably chosen. We show that the combinatorial food packing problem can be solved in O(nT) time if all input data are integral.