{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:28:41Z","timestamp":1766269721487,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2018,11,13]],"date-time":"2018-11-13T00:00:00Z","timestamp":1542067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71532002"],"award-info":[{"award-number":["71532002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>This paper shows the results of our study on the pick-and-place optimization problem. To solve this problem efficiently, an iterated hybrid local search algorithm (IHLS) which combines local search with integer programming is proposed. In the section of local search, the greedy algorithm with distance weight strategy and the convex-hull strategy is developed to determine the pick-and-place sequence; in the section of integer programming, an integer programming model is built to complete the feeder assignment problem. The experimental results show that the IHLS algorithm we proposed has high computational efficiency. Furthermore, compared with the genetic algorithm and the memetic algorithm, the IHLS is less time-consuming and more suitable in solving a large-scale problem.<\/jats:p>","DOI":"10.3390\/sym10110633","type":"journal-article","created":{"date-parts":[[2018,11,14]],"date-time":"2018-11-14T10:58:22Z","timestamp":1542193102000},"page":"633","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An Iterated Hybrid Local Search Algorithm for Pick-and-Place Sequence Optimization"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7959-7676","authenticated-orcid":false,"given":"Jinsheng","family":"Gao","sequence":"first","affiliation":[{"name":"School of Mechanical, Electronic and Control Engineering, Beijing Jiaotong University, Beijing 100044, China"}]},{"given":"Xiaomin","family":"Zhu","sequence":"additional","affiliation":[{"name":"School of Mechanical, Electronic and Control Engineering, Beijing Jiaotong University, Beijing 100044, China"}]},{"given":"Anbang","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Mechanical, Electronic and Control Engineering, Beijing Jiaotong University, Beijing 100044, China"}]},{"given":"Qingyang","family":"Meng","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Beijing Jiaotong University, Beijing 100044, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0246-5058","authenticated-orcid":false,"given":"Runtong","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Beijing Jiaotong University, Beijing 100044, China"}]}],"member":"1968","published-online":{"date-parts":[[2018,11,13]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2819","DOI":"10.1007\/s00170-016-8942-4","article-title":"PCB assembly optimization in a single gantry high-speed rotary-head collect-and-place machine","volume":"88","author":"Li","year":"2017","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1080\/09537280701602683","article-title":"A heuristic approach for component scheduling on a high speed PCB assembly machine","volume":"18","author":"Ho","year":"2007","journal-title":"Prod. Plan. Control"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1080\/00207540310001601073","article-title":"Precedence constrained TSP arising in printed circuit board assembly","volume":"42","author":"Or","year":"2004","journal-title":"Int. J. Prod. Res."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.cie.2004.09.007","article-title":"Operations planning for collect-and-place machines in PCB assembly","volume":"47","author":"Grunow","year":"2004","journal-title":"Comput. Ind. Eng."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.ijpe.2004.01.003","article-title":"Component allocation and feeder arrangement for a dual-gantry multi-head surface mounting placement tool","volume":"95","author":"Sun","year":"2005","journal-title":"Int. J. Prod. Econ."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1080\/09511929508944672","article-title":"A dynamic point specification approach to sequencing robot moves for PCB assembly","volume":"8","author":"Wang","year":"1995","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.cie.2007.12.008","article-title":"The optimization of printed circuit board manufacturing by improving the drilling process productivity","volume":"55","author":"Ancu","year":"2008","journal-title":"Comput. Ind. Eng."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Shah, H., Tairan, N., Garg, H., and Ghazali, R. (2018). A Quick Gbest Guided Artificial Bee Colony Algorithm for Stock Market Prices Prediction. Symmetry, 10.","DOI":"10.3390\/sym10070292"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Po\u0142ap, D., and Wo\u2019zniak, M. (2017). Polar Bear Optimization Algorithm: Meta-Heuristic with Fast Population Movement and Dynamic Birth and Death Mechanism. Symmetry, 9.","DOI":"10.3390\/sym9100203"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Duan, K., Fong, S., Siu, S.W.I., Song, W., and Guan, S.S.-U. (2018). Adaptive Incremental Genetic Algorithm for Task Scheduling in Cloud Environments. Symmetry, 10.","DOI":"10.3390\/sym10050168"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Hassanat, A.B., Prasath, V.B.S., Abbadi, M.A., Abu-Qdari, S.A., and Faris, H. (2018). An Improved Genetic Algorithm with a New Initialization Mechanism Based on Regression Techniques. Information, 9.","DOI":"10.3390\/info9070167"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Zhao, H., Gao, W., Deng, W., and Sun, M. (2018). Study on an Adaptive Co-Evolutionary ACO Algorithm for Complex Optimization Problems. Symmetry, 10.","DOI":"10.3390\/sym10040104"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"3949","DOI":"10.1080\/00207540600791608","article-title":"PCB assembly scheduling for collect-and-place machines using genetic algorithms","volume":"45","author":"Kulak","year":"2007","journal-title":"Int. J. Prod. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1007\/s00170-006-0918-3","article-title":"A genetic-based algorithm for the operational sequence of a high speed chip placement machine","volume":"36","author":"Chyu","year":"2008","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.dam.2015.03.009","article-title":"Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly","volume":"192","author":"Alkaya","year":"2015","journal-title":"Discret. Appl. Math."},{"key":"ref_16","doi-asserted-by":"crossref","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."},{"key":"ref_17","doi-asserted-by":"crossref","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."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10489-016-0775-1","article-title":"Optimization of printed circuit board component placement using an efficient hybrid genetic algorithm","volume":"45","author":"Lin","year":"2016","journal-title":"Appl. Intell."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"2930","DOI":"10.1080\/00207543.2016.1229071","article-title":"Mechanism to minimise the assembly time with feeder assignment for a multi-headed gantry and high-speed SMT machine","volume":"55","author":"Han","year":"2016","journal-title":"Int. J. Prod. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1080\/00207543.2016.1200154","article-title":"An MILP model and a hybrid evolutionary algorithm for integrated operation optimisation of multi-head surface mounting machines in PCB assembly","volume":"55","author":"Luo","year":"2016","journal-title":"Int. J. Prod. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1109\/96.475281","article-title":"Integer programming approach to printed circuit board assembly time optimization","volume":"18","author":"Kumar","year":"1995","journal-title":"IEEE Trans. Compon. Packag. Manuf. Technol. Part B"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0377-2217(99)00169-1","article-title":"Optimization of printed circuit board manufacturing: Integrated modeling and algorithms","volume":"124","author":"Altinkemer","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_23","doi-asserted-by":"crossref","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":"2009","journal-title":"Expert Syst. Appl."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1016","DOI":"10.1080\/00207543.2013.828173","article-title":"An MILP model and clustering heuristics for LED assembly optimisation on high-speed hybrid pick-and-place machines","volume":"52","author":"Luo","year":"2014","journal-title":"Int. J. Prod. Res."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Iantovics, L.B., Dehmer, M., and Emmert-Streib, F. (2018). MetrIntSimil\u2014An Accurate and Robust Metric for Comparison of Similarity in Intelligence of Any Number of Cooperative Multiagent Systems. Symmetry, 10.","DOI":"10.3390\/sym10020048"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Essani, F.H., and Haider, S. (2018). An Algorithm for Mapping the Asymmetric Multiple Traveling Salesman Problem onto Colored Petri Nets. Algorithms, 11.","DOI":"10.3390\/a11100143"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0020-0190(96)00125-1","article-title":"The convex-hull-and-k-line travelling salesman problem","volume":"59","author":"Deineko","year":"1996","journal-title":"Inf. Process. Lett."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Cotta, C., and Fern\u00e0ndez, J. (2007). Memetic Algorithms in Planning, Scheduling, and Timetabling. Evolutionary Scheduling, Springer.","DOI":"10.1007\/978-3-540-48584-1_1"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/11\/633\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:29:22Z","timestamp":1760196562000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/11\/633"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,13]]},"references-count":28,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2018,11]]}},"alternative-id":["sym10110633"],"URL":"https:\/\/doi.org\/10.3390\/sym10110633","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2018,11,13]]}}}