Kansei engineering, humans and computers: efficient dynamic programming algorithms for combinatorial food packing problems
by Shinji Imahori, Yoshiyuki Karuno, Hiroshi Nagamochi, Xiaoming Wang
International Journal of Biometrics (IJBM), Vol. 3, No. 3, 2011

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.

Online publication date: Sat, 24-Jan-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Biometrics (IJBM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com