{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T03:06:25Z","timestamp":1775790385733,"version":"3.50.1"},"reference-count":63,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T00:00:00Z","timestamp":1733443200000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002385","name":"Ministry of Higher Education","doi-asserted-by":"publisher","award":["FRGS\/1\/2022\/TK10\/UM\/02\/7"],"award-info":[{"award-number":["FRGS\/1\/2022\/TK10\/UM\/02\/7"]}],"id":[{"id":"10.13039\/501100002385","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004386","name":"Universiti Malaya","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004386","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,12,24]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>With the increasing complexity of industrial manufacturing tasks, optimizing Multi-Point Manufacturing (MPF) operations, such as drilling and spot welding, has become essential for improving energy efficiency and execution speed. These tasks can be formulated as multi-dimensional Traveling Salesman Problems (TSPs), where robotic manipulators must traverse multiple points optimally while minimizing energy consumption. However, traditional heuristic algorithms, such as Genetic Algorithm (GA) and Ant Colony Optimization (ACO), face significant limitations. Their iterative nature leads to long computation times, and their performance heavily relies on precise parameter tuning to achieve high-quality solutions. To address these challenges, this study proposes a novel minimum energy consumption scheduling strategy for MPF problems, utilizing a Graph Neural Network (GNN)-based approach enhanced by Transfer Learning. The method employs Self-Adjusting Multi-modal Artificial Neural Networks (SAMANN) to reduce the 6D task nodes into a 2D representation, enabling the reuse of pre-trained 2D TSP models. Fine-tuning is then applied to further optimize performance. Compared with traditional heuristic algorithms, the proposed method significantly reduces computation time while maintaining solution quality. It is also found that the new approach surpasses the performance of the current state-of-the-art (SOTA) neural model in terms of both solution quality and training time across multi-dimensional TSPs and MPF problem domains, offering a robust and efficient solution for real-world MPF applications.<\/jats:p>","DOI":"10.1093\/jcde\/qwae106","type":"journal-article","created":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T21:45:37Z","timestamp":1733867137000},"page":"15-33","source":"Crossref","is-referenced-by-count":3,"title":["Minimizing energy usage in multi-point manufacturing: a dimensional transfer learning strategy"],"prefix":"10.1093","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-1956-3004","authenticated-orcid":false,"given":"Jie","family":"Liu","sequence":"first","affiliation":[{"name":"Department of Mechanical Engineering, Faculty of Engineering, Universiti Malaya , Kuala Lumpur 50603 ,","place":["Malaysia"]},{"name":"Department of Electrical Engineering, Hebei Vocational University of Technology and Engineering , Xingtai 054000 ,","place":["China"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7637-9297","authenticated-orcid":false,"given":"Hwa Jen","family":"Yap","sequence":"additional","affiliation":[{"name":"Department of Mechanical Engineering, Faculty of Engineering , Universiti Malaya, Kuala Lumpur 50603 ,","place":["Malaysia"]}]},{"given":"Anis Salwa Mohd","family":"Khairuddin","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Faculty of Engineering , Universiti Malaya, Kuala Lumpur 50603 ,","place":["Malaysia"]}]}],"member":"286","published-online":{"date-parts":[[2024,12,5]]},"reference":[{"key":"2025041407274397000_bib1","volume-title":"Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing","author":"Aarts","year":"1989"},{"key":"2025041407274397000_bib2","article-title":"Concorde TSP Solver","author":"Applegate","year":"2006"},{"key":"2025041407274397000_bib3","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1162\/089976603321780317","article-title":"Laplacian eigenmaps for dimensionality reduction and data representation","volume":"15","author":"Belkin","year":"2003","journal-title":"Neural Computation"},{"key":"2025041407274397000_bib4","article-title":"Neural combinatorial optimization with reinforcement learning","author":"Bello","year":"2016"},{"key":"2025041407274397000_bib5","volume-title":"Modern Multidimensional Scaling: Theory and Applications","author":"Borg","year":"2005","edition":"2nd ed."},{"key":"2025041407274397000_bib6","article-title":"The transformer network for the traveling salesman problem","author":"Bresson","year":"2021"},{"issue":"1","key":"2025041407274397000_bib7","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s43069-021-00101-z","article-title":"Worst-case analysis of a new heuristic for the travelling salesman problem","volume":"3","author":"Christofides","year":"2022","journal-title":"Operations Research Forum"},{"key":"2025041407274397000_bib8","doi-asserted-by":"publisher","first-page":"1556","DOI":"10.1109\/ROBIO.2012.6491189","article-title":"Path planning algorithm for space manipulator with a minimum energy demand","volume-title":"2012 IEEE International Conference on Robotics and Biomimetics (ROBIO)","author":"Chung","year":"2012"},{"key":"2025041407274397000_bib9","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-540-68279-0_1","article-title":"Solution of a large-scale traveling-salesman problem","author":"Chv\u00e1tal","year":"2010","journal-title":"50 Years of Integer Programming 1958-2008: from the Early Years to the State-of-the-Art"},{"key":"2025041407274397000_bib10","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-93031-2_9","article-title":"Learning heuristics for the TSP by policy gradient","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research: 15th International Conference, CPAIOR 2018","author":"Deudon","year":"2018"},{"key":"2025041407274397000_bib11","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"key":"2025041407274397000_bib12","doi-asserted-by":"publisher","first-page":"5591","DOI":"10.1073\/pnas.1031596100","article-title":"Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data","volume":"100","author":"Donoho","year":"2003","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"2025041407274397000_bib13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","article-title":"Ant colony system: A cooperative learning approach to the traveling salesman problem","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"2025041407274397000_bib14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.15388\/22-INFOR491","article-title":"Geometric MDS performance for large data dimensionality reduction and visualization","volume":"33","author":"Dzemyda","year":"2022","journal-title":"Informatica"},{"key":"2025041407274397000_bib15","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.cirp.2011.03.095","article-title":"Time-optimal trajectory generation for 5-axis on-the-fly laser drilling","volume":"60","author":"Erkorkmaz","year":"2011","journal-title":"CIRP Annals"},{"key":"2025041407274397000_bib16","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1109\/TCYB.2019.2962865","article-title":"Explicit evolutionary multitasking for combinatorial optimization: A case study on capacitated vehicle routing problem","volume":"51","author":"Feng","year":"2020","journal-title":"IEEE Transactions on Cybernetics"},{"key":"2025041407274397000_bib17","doi-asserted-by":"publisher","first-page":"7474","DOI":"10.1609\/aaai.v35i8.16916","article-title":"Generalize a small pre-trained model to arbitrarily large TSP instances","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","author":"Fu","year":"2021"},{"key":"2025041407274397000_bib18","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/800029.808532","article-title":"A dynamic programming approach to sequencing problems","volume-title":"Proceedings of the 1961 16th ACM National Meeting, ACM'61","author":"Held","year":"1961"},{"key":"2025041407274397000_bib19","volume-title":"An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems","author":"Helsgaun","year":"2017"},{"key":"2025041407274397000_bib20","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.cirp.2007.05.085","article-title":"Time minimum trajectory planning of a 2-DOF translational parallel robot for pick-and-place operations","volume":"56","author":"Huang","year":"2007","journal-title":"CIRP Annals"},{"key":"2025041407274397000_bib21","article-title":"Global CO2 emissions in 2021","author":"International Energy Agency","year":"2022"},{"key":"2025041407274397000_bib22","article-title":"World Robotics 2024 \u2013 Industrial Robots","author":"International Federation of Robotics","year":"2024"},{"key":"2025041407274397000_bib23","first-page":"448","article-title":"Batch normalization: Accelerating deep network training by reducing internal covariate shift","volume-title":"Proceedings of the 32nd International Conference on Machine Learning","author":"Ioffe","year":"2015"},{"key":"2025041407274397000_bib24","volume-title":"A User's Guide to Principal Components","author":"Jackson","year":"2005"},{"key":"2025041407274397000_bib25","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1109\/72.363467","article-title":"Artificial neural networks for feature extraction and multivariate data projection","volume":"6","author":"Jianchang","year":"1995","journal-title":"IEEE Transactions on Neural Networks"},{"key":"2025041407274397000_bib26","article-title":"An efficient graph convolutional network technique for the travelling salesman problem","author":"Joshi","year":"2019"},{"key":"2025041407274397000_bib27","doi-asserted-by":"publisher","first-page":"7982","DOI":"10.1007\/s10489-024-05603-x","article-title":"A lightweight CNN-transformer model for learning traveling salesman problems","volume":"54","author":"Jung","year":"2024","journal-title":"Applied Intelligence"},{"key":"2025041407274397000_bib28","first-page":"5656","article-title":"Learning combinatorial optimization algorithms over graphs","volume-title":"Advances in Neural Information Processing Systems 30","author":"Khalil","year":"2017"},{"key":"2025041407274397000_bib29","article-title":"Attention, learn to solve routing problems!","author":"Kool","year":"2018"},{"key":"2025041407274397000_bib30","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.neucom.2022.08.005","article-title":"Solve routing problems with a residual edge-graph attention neural network","volume":"508","author":"Lei","year":"2022","journal-title":"Neurocomputing"},{"key":"2025041407274397000_bib31","doi-asserted-by":"publisher","first-page":"2521","DOI":"10.16383\/j.aas.c200551","article-title":"Research reviews of combinatorial optimization methods based on deep reinforcement learning","volume":"47","author":"Li","year":"2021","journal-title":"Zidonghua Xuebao\/Acta Automatica Sinica"},{"key":"2025041407274397000_bib32","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling-salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Operations Research"},{"key":"2025041407274397000_bib33","doi-asserted-by":"publisher","first-page":"6687","DOI":"10.1109\/TII.2020.3043734","article-title":"Energy-efficient scheduling of distributed flow shop with heterogeneous factories: A real-world case from automobile industry in China","volume":"17","author":"Lu","year":"2021","journal-title":"IEEE Transactions on Industrial Informatics"},{"key":"2025041407274397000_bib34","doi-asserted-by":"publisher","first-page":"102277","DOI":"10.1016\/j.rcim.2021.102277","article-title":"A Pareto-based collaborative multi-objective optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers","volume":"74","author":"Lu","year":"2022","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"key":"2025041407274397000_bib35","doi-asserted-by":"publisher","first-page":"3563846","DOI":"10.1155\/2018\/3563846","article-title":"Collision-free path-planning for six-DOF serial harvesting robot based on energy optimal and artificial potential field","volume":"2018","author":"Luo","year":"2018","journal-title":"Complexity"},{"key":"2025041407274397000_bib36","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1911.04936","article-title":"Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning","author":"Ma","year":"2019"},{"key":"2025041407274397000_bib37","doi-asserted-by":"publisher","first-page":"507","DOI":"10.15388\/Informatica.2011.339","article-title":"Efficient data projection for visual analysis of large data sets using neural networks","volume":"22","author":"Medvedev","year":"2011","journal-title":"Informatica"},{"key":"2025041407274397000_bib38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/CHILECON.2017.8229677","article-title":"Modeling a simple traveling salesman problem for improving energy efficiency in robots that execute computer numerical control machining","volume-title":"2017 CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON)","author":"Morales","year":"2017"},{"key":"2025041407274397000_bib39","first-page":"1","article-title":"Reinforcement learning for solving the vehicle routing problem","volume-title":"Advances in Neural Information Processing Systems 31","author":"Nazari","year":"2018"},{"key":"2025041407274397000_bib40","article-title":"Divide and conquer networks","author":"Nowak","year":"2016"},{"key":"2025041407274397000_doi63_669_150224","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1007\/s00170-014-6737-z","article-title":"Reducing the energy consumption of industrial robots in manufacturing systems","volume":"78","author":"Paryanto","year":"2015","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"key":"2025041407274397000_bib41","doi-asserted-by":"publisher","first-page":"13727","DOI":"10.1609\/aaai.v35i15.17618","article-title":"Guiding non-autoregressive neural machine translation decoding with reordering information","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","author":"Ran","year":"2021"},{"key":"2025041407274397000_bib42","doi-asserted-by":"publisher","first-page":"2352","DOI":"10.1162\/NECO_a_00990","article-title":"Deep convolutional neural networks for image classification: A comprehensive review","volume":"29","author":"Rawat","year":"2017","journal-title":"Neural Computation"},{"key":"2025041407274397000_bib43","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","article-title":"Nonlinear dimensionality reduction by locally linear embedding","volume":"290","author":"Roweis","year":"2000","journal-title":"Science"},{"key":"2025041407274397000_bib44","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/T-C.1969.222678","article-title":"A nonlinear mapping for data structure analysis","volume-title":"IEEE Transactions on Computers","author":"Sammon","year":"1969"},{"key":"2025041407274397000_bib45","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","article-title":"A global geometric framework for nonlinear dimensionality reduction","volume":"290","author":"Tenenbaum","year":"2000","journal-title":"Science"},{"key":"2025041407274397000_bib46","first-page":"5998","article-title":"Attention is all you need","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems","author":"Vaswani","year":"2017"},{"key":"2025041407274397000_bib47","first-page":"2695","article-title":"Pointer networks","volume-title":"Advances in Neural Information Processing Systems","author":"Vinyals","year":"2015"},{"key":"2025041407274397000_bib48","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1016\/j.ins.2022.07.082","article-title":"Solving combinatorial optimization problems over graphs with BERT-based deep reinforcement learning","volume":"619","author":"Wang","year":"2023","journal-title":"Information Sciences"},{"key":"2025041407274397000_bib49","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00992696","article-title":"Simple statistical gradient-following algorithms for connectionist reinforcement learning","volume":"8","author":"Williams","year":"1992","journal-title":"Machine Learning"},{"key":"2025041407274397000_bib50","doi-asserted-by":"publisher","first-page":"5057","DOI":"10.1109\/TNNLS.2021.3068828","article-title":"Learning improvement heuristics for solving routing problems","volume":"33","author":"Wu","year":"2022","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"2025041407274397000_bib51","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","article-title":"A comprehensive survey on graph neural networks","volume":"32","author":"Wu","year":"2020","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"2025041407274397000_bib52","article-title":"Reinforcement learning-based non-autoregressive solver for traveling salesman problems","author":"Xiao","year":"2023"},{"key":"2025041407274397000_bib53","doi-asserted-by":"publisher","first-page":"4346","DOI":"10.1109\/ICRA40945.2020.9196999","article-title":"Planning an efficient and robust base sequence for a mobile manipulator performing multiple pick-and-place tasks","volume-title":"2020 IEEE International Conference on Robotics and Automation (ICRA)","author":"Xu","year":"2020"},{"key":"2025041407274397000_bib54","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.neunet.2022.12.023","article-title":"Memory-efficient transformer-based network model for traveling salesman problem","volume":"161","author":"Yang","year":"2023","journal-title":"Neural Networks"},{"key":"2025041407274397000_bib55","doi-asserted-by":"publisher","first-page":"e4974","DOI":"10.1002\/cpe.4974","article-title":"Parallel iterative hill climbing algorithm to solve TSP on GPU","volume":"31","author":"Yelmewad","year":"2019","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"2025041407274397000_bib56","first-page":"3320","article-title":"How transferable are features in deep neural networks?","volume-title":"Proceedings of the 27th International Conference on Neural Information Processing Systems\u2014","author":"Yosinski","year":"2014"},{"key":"2025041407274397000_bib57","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":"Robotics and Computer-Integrated Manufacturing"},{"key":"2025041407274397000_bib58","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.jcde.2016.02.003","article-title":"Minimum time path planning of robotic manipulator in drilling\/spot welding tasks","volume":"3","author":"Zhang","year":"2016","journal-title":"Journal of Computational Design and Engineering"},{"key":"2025041407274397000_bib59","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1109\/ROBIO.2016.7866497","article-title":"Motion planning of hyper-redundant manipulators based on ant colony optimization","volume-title":"2016 IEEE International Conference on Robotics and Biomimetics (ROBIO)","author":"Zhao","year":"2016"},{"key":"2025041407274397000_bib60","doi-asserted-by":"publisher","first-page":"106359","DOI":"10.1016\/j.neunet.2024.106359","article-title":"A deep reinforcement learning algorithm framework for solving multi-objective traveling salesman problem based on feature transformation","volume":"176","author":"Zhao","year":"2024","journal-title":"Neural Networks"},{"key":"2025041407274397000_bib61","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.neunet.2023.01.018","article-title":"An accelerated end-to-end method for solving routing problems","volume":"164","author":"Zhu","year":"2023","journal-title":"Neural Networks"},{"key":"2025041407274397000_bib62","doi-asserted-by":"publisher","first-page":"6699","DOI":"10.1109\/TAI.2024.3461630","article-title":"Reinforcement learning for solving colored traveling salesman problems: An entropy-insensitive attention approach","volume":"5","author":"Zhu","year":"2024","journal-title":"IEEE Transactions on Artificial Intelligence"}],"container-title":["Journal of Computational Design and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/jcde\/advance-article-pdf\/doi\/10.1093\/jcde\/qwae106\/60964827\/qwae106.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jcde\/article-pdf\/12\/1\/15\/60964827\/qwae106.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/jcde\/article-pdf\/12\/1\/15\/60964827\/qwae106.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,14]],"date-time":"2025-04-14T07:28:07Z","timestamp":1744615687000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/jcde\/article\/12\/1\/15\/7917626"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,5]]},"references-count":63,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,12,24]]}},"URL":"https:\/\/doi.org\/10.1093\/jcde\/qwae106","relation":{},"ISSN":["2288-5048"],"issn-type":[{"value":"2288-5048","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2025,1]]},"published":{"date-parts":[[2024,12,5]]}}}