Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29286

Select areas to restrict search in scientific publication database:
Automation of Packing Cell in Fresh Fish Facilities
The problem discussed in this paper involves packing fresh fish fileet of the northern Cod into a standard square container. The fish is first cleaned and split and then collected on a belt ready to be stacked in a container. The aim of our work is to pack the fish into the container with constraints on the amount of overlap allowed for the fileets. The current focus is to design a packing cell that can be real-time and of practical use, while finding the optimal solution to the degree of overlap and minimise the unused space of the container.
Digital Object Identifier (DOI):


[1] T. J. Hodgson, "A combined approach to the pallet loading problem", IIE Transactions, vol. 14, no. 3, 1982, pp. 175-182.
[2] E. E. Bishoff and M. S. W. Ratcliff, Issues in the development of approaches to container loading, Omega, vol. 23, no. 4, 1995, pp. 377-390.
[3] J. L. Silva de Castro, N. Y. Soma and N. Maculan, A greedy search for the three-dimensional bin packing problem: the packing static stability case, International Transactions in Operations Research, vol. 10, no. 2, 2003, pp. 141-153.
[4] A. Lodi, S. Martello and D. Vigo, Heuristic algorithm for the three-dimensional bin packing problem, European Journal of Operational Research, vol. 141, no. 2, 2002, pp. 410-420.
[5] S. Martello, D. Pisinger and D. Vigo, The three-dimensional bin packing problem, Operations Research, vol. 48, no. 2, 2000, pp. 256-257.
[6] S. Szykman and J. Cagan, Constrained three-dimensional component layout using simulated annealing, ASME Journal of Mechanical Design, vol. 119, no. 3, 1997, pp. 22-25.
[7] C. R. Reeves, Modern Heuristic Techniques for Combinatorial Problems, McGraw-Hill Book Company, 1995, London.
[8] J. A. George and D. F. Robinson, A heuristic for packing boces into a container, Computers and Operations Research, vol. 7, no. 1, 1980, pp. 147-156.
[9] N. C. Liu and L. C. Chen, A new algorithm for container loading, Compsac 81 - 5th International Computer Software and Applications Conference Papers, IEEE, 1981, pp. 292-299.
[10] H. Gehring, K. Menschner and M. Meyer, A Computer-based heuristic for packing pooled shipment containers, European Journal of Operational Research, vol. 44, No. 2, 1990, pp. 277-289.
[11] E. E. Bishoff and W. B. Dowsland, An application of the micro to product design and distribution, Journal of the operational research society, Vol. 33, No. 3, 1982, pp. 271-281.
[12] E. E. Bishoff and M. D. Marriott, A comparative evaluation of heuristics for container loading, European Journal of Operational Research, vol. 44, No. 2, 1990, pp. 267-276.
[13] A. Lim, B. Rogrigues and Y. Wang, A multi-faced buildup algorithm for three-dimensional packing problems, OMEGA, vol. 31, No. 6, 2003, pp. 471-4.
Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007