{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T17:56:18Z","timestamp":1754157378131,"version":"3.41.2"},"reference-count":20,"publisher":"Emerald","issue":"6","license":[{"start":{"date-parts":[[2010,10,19]],"date-time":"2010-10-19T00:00:00Z","timestamp":1287446400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,10,19]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>This paper aims to represent a novel framework for optimization of robotic handling from disarray to structure where the products are randomly distributed on a surface, the initial location of the products are known (with the aid of image processing, laser position sensors, etc.) and there is a set of final positions for the products.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>Pick\u2010and\u2010place is one of the main solutions especially for the food products where the products are prone to damage, have adhesive surfaces and the grippers can be complicated. The aim of this paper is to maximize the utilization of the pick\u2010and\u2010place robotic system. In order to do so the handling process is modelled mathematically and the pick\u2010and\u2010place problem is formulated based on assignment problem where Hungarian algorithm is utilized to minimize the total distance travelled by the robot. Furthermore, a simulation program is developed to demonstrate the possible improvements of the algorithm in comparison with the existing algorithms.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>Utilizing the proposed algorithm can significantly increase the utilization of robots in the pick\u2010and\u2010place operation.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>The new optimization algorithm can be applied to any industry with pick\u2010and\u2010place where time efficiency and maximum utilization matters.<\/jats:p><\/jats:sec>","DOI":"10.1108\/01439911011081678","type":"journal-article","created":{"date-parts":[[2010,10,30]],"date-time":"2010-10-30T07:07:54Z","timestamp":1288422474000},"page":"527-531","source":"Crossref","is-referenced-by-count":6,"title":["A new algorithm for pick\u2010and\u2010place operation"],"prefix":"10.1108","volume":"37","author":[{"given":"Vahid","family":"Aminzadeh","sequence":"first","affiliation":[]},{"given":"Helge","family":"Wurdemann","sequence":"additional","affiliation":[]},{"given":"Jian S.","family":"Dai","sequence":"additional","affiliation":[]},{"given":"John","family":"Reed","sequence":"additional","affiliation":[]},{"given":"Graham","family":"Purnell","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"key":"key2022012320070034700_b1","doi-asserted-by":"crossref","unstructured":"Ahmadi, J., Grotzinger, S. and Johnson, D. (1998), \u201cComponent allocation and partitioning for a dual delivery placement machine\u201d, Oper. Res., Vol. 36 No. 2, pp. 176\u201091.","DOI":"10.1287\/opre.36.2.176"},{"key":"key2022012320070034700_b2","doi-asserted-by":"crossref","unstructured":"Carmon, T.F., Maimon, O.Z. and Dar\u2010el, E.M. (1989), \u201cGroup setup for printed circuit board assembly\u201d, Int. J. Prod. Res., Vol. 77 No. 10, pp. 1795\u2010810.","DOI":"10.1080\/00207548908942655"},{"key":"key2022012320070034700_b3","unstructured":"Egerv\u00e1ry, J. (1955), \u201cMatrixok kombinatorius tulajdons\u00e1gair\u00f3l (English translation by H.W. Kuhn): on combinatorial properties of matrices\u201d, Logistics Papers, George Washington University, No.1, pp. 1\u201011, paper 4."},{"key":"key2022012320070034700_b4","doi-asserted-by":"crossref","unstructured":"Foulds, L.R. and Hamacher, H.W. (1993), \u201cOptimal bin location and sequencing in printed circuit board assembly\u201d, Eur. J. Oper. Res., Vol. 66, pp. 279\u201090.","DOI":"10.1016\/0377-2217(93)90217-B"},{"key":"key2022012320070034700_b5","doi-asserted-by":"crossref","unstructured":"Grotzinger, S. (1992), \u201cFeeder assignment models for concurrent placement machines\u201d, IIE Trans., Vol. 24 No. 4, pp. 31\u201044.","DOI":"10.1080\/07408179208964232"},{"key":"key2022012320070034700_b6","unstructured":"Kleinberg, J. and Tardos, E. (2006), Algorithm Design, Pearson\/Addison\u2010Wesley, Boston, MA."},{"key":"key2022012320070034700_b7","unstructured":"K\u0151nig, D. (1915), \u201cVonalrendszerek \u00e9s determin\u00e1nsok (Hungarian; Line systems and determinants)\u201d, Mathematikai \u00e9s Term\u00e9szettudom\u00e1nyi \u00c9rtesit\u0151, Vol. 33, pp. 221\u20109."},{"key":"key2022012320070034700_b8","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W. (1955), \u201cThe Hungarian method for the assignment problem\u201d, Naval Research Logistics Quarterly, Vol. 2, pp. 83\u201097.","DOI":"10.1002\/nav.3800020109"},{"key":"key2022012320070034700_b9","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W. (1956), \u201cVariants of the Hungarian method for assignment problems\u201d, Naval Research Logistics Quarterly, Vol. 3, pp. 253\u20108.","DOI":"10.1002\/nav.3800030404"},{"key":"key2022012320070034700_b10","unstructured":"Kumar, R. and Li, H. (1988), \u201cInteger programming approach to printed circuit board assembly time optimization\u201d, Oper. Res., Vol. 36 No. 2, pp. 192\u2010201."},{"key":"key2022012320070034700_b11","doi-asserted-by":"crossref","unstructured":"Leipala, T. and Nevalainen, O. (1989), \u201cOptimization of the movements of a component placement machine\u201d, Eur. J. Oper. Res., Vol. 38, pp. 167\u201077.","DOI":"10.1016\/0377-2217(89)90101-X"},{"key":"key2022012320070034700_b12","doi-asserted-by":"crossref","unstructured":"Mainmon, O. and Shtub, A. (1991), \u201cGrouping method for printed circuit board assembly\u201d, Int. J. Prod. Res., Vol. 29 No. 7, pp. 1379\u201090.","DOI":"10.1080\/00207549108948017"},{"key":"key2022012320070034700_b13","unstructured":"Monge, G. (1781), \u201cM\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais\u201d, Histoire de l'Acad\u00e9mie Royale des Sciences, pp. 666\u2010704."},{"key":"key2022012320070034700_b14","doi-asserted-by":"crossref","unstructured":"Moyer, L.K. and Gupta, S.M. (1996), \u201cSMT feeder slot assignment for predetermined component placement paths\u201d, J. Electron. Manufact., Vol. 6 No. 3, pp. 173\u201092.","DOI":"10.1142\/S0960313196000172"},{"key":"key2022012320070034700_b15","doi-asserted-by":"crossref","unstructured":"Munkres, J. (1957), \u201cAlgorithms for the assignment and transportation problems\u201d, Journal of the Society for Industrial and Applied Mathematics, Vol. 5 No. 1, pp. 32\u20108.","DOI":"10.1137\/0105003"},{"key":"key2022012320070034700_b16","doi-asserted-by":"crossref","unstructured":"Sadiq, M., Landers, T.L. and Taylor, G.D. (1993), \u201cA heuristic algorithm for minimizing total production time for a sequence of jobs on a surface mount placement machine\u201d, Int. J. Prod. Res., Vol. 31 No. 6, pp. 1327\u201041.","DOI":"10.1080\/00207549308956794"},{"key":"key2022012320070034700_b17","doi-asserted-by":"crossref","unstructured":"Shih, W., Srihari, K. and Adriance, J. (1996), \u201cExpert system based placement sequence identification for surface mount PCB assembly\u201d, Int. J. Adv. Manufact. Technol., Vol. 11, pp. 413\u201024.","DOI":"10.1007\/BF01178967"},{"key":"key2022012320070034700_b18","doi-asserted-by":"crossref","unstructured":"Sohn, J. and Park, S. (1996), \u201cEfficient operation of a surface mounting machine with a multihead turret\u201d, Int. J. Prod. Res., Vol. 34 No. 4, pp. 1131\u201043.","DOI":"10.1080\/00207549608904954"},{"key":"key2022012320070034700_b19","doi-asserted-by":"crossref","unstructured":"Su, Y.\u2010Y. and Srihari, K. (1996), \u201cPlacement sequence identification using artificial neural networks in surface mount PCB assembly\u201d, Int. J. Adv. Manufact. Technol., Vol. 11, pp. 285\u201099.","DOI":"10.1007\/BF01351286"},{"key":"key2022012320070034700_b20","doi-asserted-by":"crossref","unstructured":"Yeo, S.H., Low, C.W. and Yong, K.H. (1996), \u201cA rule\u2010based frame system for concurrent assembly machines\u201d, Int. J. Adv. Manufact. Technol., Vol. 12, pp. 370\u20106.","DOI":"10.1007\/BF01179813"}],"container-title":["Industrial Robot: An International Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/01439911011081678","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/01439911011081678\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/01439911011081678\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:50:38Z","timestamp":1753401038000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ir\/article\/37\/6\/527-531\/175178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,19]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2010,10,19]]}},"alternative-id":["10.1108\/01439911011081678"],"URL":"https:\/\/doi.org\/10.1108\/01439911011081678","relation":{},"ISSN":["0143-991X"],"issn-type":[{"type":"print","value":"0143-991X"}],"subject":[],"published":{"date-parts":[[2010,10,19]]}}}