{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T19:37:42Z","timestamp":1771961862303,"version":"3.50.1"},"reference-count":25,"publisher":"ASME International","issue":"2","license":[{"start":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T00:00:00Z","timestamp":1655337600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.asme.org\/publications-submissions\/publishing-information\/legal-policies"}],"content-domain":{"domain":["asmedigitalcollection.asme.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,4,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The tape carrier packaging machine with multiple sucking discs is designed for modern, high-speed packaging production line, which is an important part of the electronic manufacturing process. The efficiency of the part-picking can directly affect the efficiency of the packaging production line. The problem involves at least three coupled sub-problems: the number of picking rounds, the matching relationship between the parts and sucking discs, and the picking order. Because the actual industrial production requires real-time or soft real-time scheduling, the challenge is how to efficiently solve this multi-dimensional combinatorial optimization problem within a fairly limited time. The existing advanced algorithms such as the genetic algorithm and the simulated annealing algorithm usually require complex and time-consuming encoding and decoding while solving this problem. In contrast, the ant colony algorithm has advantages in the convergence rate and parallel computing, especially for searching high dimensional paths in dynamic environments. In order to further improve the comprehensive performance of the ant colony algorithm in solving multi-dimensional coupled optimization problems in extremely limited time, we propose a novel two-layer heterogeneous ant colony system based on three strategies: (1) a bottom-up two-layer solution framework to decouple the original tightly coupled problem into a loosely coupled problem composed of two sub-problems; (2) a candidate cluster augmentation strategy based on the Delaunay triangulation to improve the diversity and quality of the clusters; (3) a co-evolution between a pair of heterogeneous colonies by mixing the high-quality pheromone properly as well as a co-evolution based on the prior knowledge. Finally, through a large set of comparisons, the average picking efficiency of Two-layer Heterogeneous Ant Colony System improved by the three proposed strategies is 13\u201316% higher than that of other popular heuristic algorithms.<\/jats:p>","DOI":"10.1115\/1.4054479","type":"journal-article","created":{"date-parts":[[2022,5,4]],"date-time":"2022-05-04T08:04:16Z","timestamp":1651651456000},"update-policy":"https:\/\/doi.org\/10.1115\/crossmarkpolicy-asme","source":"Crossref","is-referenced-by-count":2,"title":["A Two-Layer Heterogeneous Ant Colony System With Applications in Part-Picking Planning"],"prefix":"10.1115","volume":"23","author":[{"given":"Liangang","family":"Xie","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University Institute of Intelligent Manufacturing and Information Engineering; School of Mechanical Engineering, , Shanghai 200240 , China"}]},{"given":"Xianda","family":"Li","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University Institute of Intelligent Manufacturing and Information Engineering; School of Mechanical Engineering, , Shanghai 200240 , China"}]},{"given":"Xiangzhi","family":"Wei","sequence":"additional","affiliation":[{"name":"Donghua University College of Mechanical Engineering, , Shanghai 201620 , China"}]}],"member":"33","published-online":{"date-parts":[[2022,6,16]]},"reference":[{"issue":"1","key":"2022061711275905300_CIT0001","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TASE.2020.3020050","article-title":"Manipulator Motion Planning for Part Pickup and Transport Operations From a Moving Base","volume":"99","author":"Thakar","year":"2020","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"1","key":"2022061711275905300_CIT0002","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1016\/j.asoc.2007.02.012","article-title":"Enhancing Optimal Feeder Assignment of the Multi-Head Surface Mounting Machine Using Genetic Algorithms","volume":"8","author":"Li","year":"2008","journal-title":"Appl. Soft Comput. Arch."},{"issue":"3","key":"2022061711275905300_CIT0003","doi-asserted-by":"publisher","first-page":"7002","DOI":"10.1016\/j.eswa.2008.08.025","article-title":"An Integrated Scheduling Problem of PCB Components on Sequential Pick-and-Place Machines: Mathematical Models and Heuristic Solutions","volume":"36","author":"Ho","year":"2010","journal-title":"Expert Syst. Appl. Int. J."},{"issue":"5","key":"2022061711275905300_CIT0004","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1007\/s10845-010-0461-9","article-title":"Developing a Varietal GA with ESMA Strategy for Solving the Pick and Place Problem in Printed Circuit Board Assembly Line","volume":"23","author":"Chang","year":"2012","journal-title":"J. Intell. Manuf."},{"issue":"2","key":"2022061711275905300_CIT0005","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.3233\/JIFS-169883","article-title":"Ant Colony Optimization and Image Model-Based Robot Manipulator System for Pick-and-Place Tasks","volume":"36","author":"Wong","year":"2019","journal-title":"J. Intell. Fuzzy Syst."},{"issue":"1","key":"2022061711275905300_CIT0006","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10845-012-0668-z","article-title":"Efficient Metaheuristics for Pick and Place Robotic Systems Optimization","volume":"25","author":"Daoud","year":"2014","journal-title":"J. Intell. Manuf."},{"issue":"2","key":"2022061711275905300_CIT0007","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.disopt.2006.11.006","article-title":"A Model to Optimize Placement Operations on Dual-Head Placement Machines","volume":"4","author":"Wilhelm","year":"2007","journal-title":"Discrete Optim."},{"issue":"20","key":"2022061711275905300_CIT0008","doi-asserted-by":"publisher","first-page":"6252","DOI":"10.1080\/00207543.2019.1675917","article-title":"Hybrid Spider Monkey Optimization Algorithm for Multi-Level Planning and Scheduling Problems of Assembly Lines","volume":"58","author":"Mumtaz","year":"2019","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"2022061711275905300_CIT0009","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1109\/tase.2018.2855099","article-title":"Clustering-Based Heuristic to Optimize Nozzle and Feeder Assignments for Collect-and-Place Assembly","volume":"16","author":"Li","year":"2019","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"15","key":"2022061711275905300_CIT0010","doi-asserted-by":"publisher","first-page":"6818","DOI":"10.1016\/j.eswa.2014.04.038","article-title":"An Improved Shuffled Frog-Leaping Algorithm to Optimize Component Pick-and-Place Sequencing Optimization Problem","volume":"41","author":"Zhu","year":"2014","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"2022061711275905300_CIT0011","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s00170-006-0777-y","article-title":"A Particle Swarm Optimization Approach to Optimize Component Placement in Printed Circuit Board Assembly","volume":"35","author":"Chen","year":"2007","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"2022061711275905300_CIT0012","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/TASE.2019.2916925","article-title":"Optimization of Component Sequencing and Feeder Assignment for a Chip Shooter Machine Using Shuffled Frog-Leaping Algorithm","volume":"17","author":"Hsu","year":"2019","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"1","key":"2022061711275905300_CIT0013","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.rcim.2004.04.003","article-title":"Optimal Robot Task Scheduling Based on Genetic Algorithms","volume":"21","author":"Zacharia","year":"2005","journal-title":"Robot. Comput.-Integr. Manuf."},{"issue":"4","key":"2022061711275905300_CIT0014","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1016\/j.cie.2008.07.017","article-title":"A Job Assignment Model for Conveyor-Aided Picking System","volume":"56","author":"Hou","year":"2009","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"2022061711275905300_CIT0015","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.rcim.2011.12.001","article-title":"Multirobot Coordination in Pick-and-Place Tasks on a Moving Conveyor","volume":"28","author":"Bozma","year":"2012","journal-title":"Robot. Comput.-Integr. Manuf."},{"issue":"6","key":"2022061711275905300_CIT0016","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1002\/pts.1984","article-title":"Plant Layout and Pick-and-Place Strategies for Improving Performances in Secondary Packaging Plants of Food Products","volume":"26","author":"Comba","year":"2013","journal-title":"Packag. Technol. Sci."},{"key":"2022061711275905300_CIT0017","first-page":"1","article-title":"Comparative Analysis of Pick & Place Strategies for a Multi-Robot Application","author":"Humbert","year":"2015"},{"key":"2022061711275905300_CIT0018","unstructured":"Rendon D.P., B.\n          , 2013, \u201cModelling and Simulation of a Scheduling Algorithm for a Pick and Place Packaging System,\u201d Master\u2019s thesis, Politechnico di Milano, Italy."},{"key":"2022061711275905300_CIT0019","volume-title":"Handbook of Discrete and Computational Geometry","author":"O'Rourke","year":"2004"},{"issue":"8","key":"2022061711275905300_CIT0020","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","article-title":"MAX-MIN Ant System","volume":"16","author":"Stutzle","year":"2000","journal-title":"Future Gener. Comput. Syst."},{"issue":"1","key":"2022061711275905300_CIT0021","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TSMC.1986.289288","article-title":"Optimization of Control Parameters for Genetic Algorithms","volume":"16","author":"Grefenstette","year":"1986","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"2022061711275905300_CIT0022","first-page":"606","volume-title":"Readings in Computer Vision","author":"Kirpatrick","year":"1987"},{"key":"2022061711275905300_CIT0023","doi-asserted-by":"crossref","DOI":"10.1109\/ICMLC.2004.1382200","article-title":"A Discrete PSO Method for Generalized TSP Problem","author":"Zhi","year":"2004"},{"issue":"5","key":"2022061711275905300_CIT0024","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","article-title":"Particle Swarm Optimization-Based Algorithms for TSP and Generalized TSP","volume":"103","author":"Shi","year":"2007","journal-title":"Inf. Process. Lett."},{"key":"2022061711275905300_CIT0025","first-page":"591","volume-title":"International Conference on Evolutionary Programming","author":"Shi","year":"1998"}],"container-title":["Journal of Computing and Information Science in Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/23\/2\/021014\/6887744\/jcise_23_2_021014.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/23\/2\/021014\/6887744\/jcise_23_2_021014.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T11:28:18Z","timestamp":1655465298000},"score":1,"resource":{"primary":{"URL":"https:\/\/asmedigitalcollection.asme.org\/computingengineering\/article\/23\/2\/021014\/1140685\/A-Two-Layer-Heterogeneous-Ant-Colony-System-With"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,16]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4,1]]}},"URL":"https:\/\/doi.org\/10.1115\/1.4054479","relation":{},"ISSN":["1530-9827","1944-7078"],"issn-type":[{"value":"1530-9827","type":"print"},{"value":"1944-7078","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,16]]},"article-number":"021014"}}