Heuristic algorithms with rounded weights for a combinatorial food packing problem
In this paper, a lexicographic bi-criteria food packing problem arising in actual packaging equipments is considered. Given a set I = {i | i = 1,2,...,n} of current n items (for example, n green peppers) with their weights wi and priorities pi, the problem asks to find a subset I′ (⊆ I) so that the...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The Japan Society of Mechanical Engineers
2017-01-01
|
| Series: | Journal of Advanced Mechanical Design, Systems, and Manufacturing |
| Subjects: | |
| Online Access: | https://www.jstage.jst.go.jp/article/jamdsm/11/1/11_2017jamdsm0003/_pdf/-char/en |