{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T11:05:18Z","timestamp":1774868718084,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T00:00:00Z","timestamp":1769212800000},"content-version":"vor","delay-in-days":23,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100004386","name":"Universiti Malaya","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004386","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s10489-026-07091-7","type":"journal-article","created":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T01:59:01Z","timestamp":1769219941000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling all-scale multi-point manufacturing problems with a single neural model"],"prefix":"10.1007","volume":"56","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-1956-3004","authenticated-orcid":false,"given":"Jie","family":"Liu","sequence":"first","affiliation":[]},{"given":"Hwa Jen","family":"Yap","sequence":"additional","affiliation":[]},{"given":"Anis Salwa","family":"Mohd Khairuddin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,24]]},"reference":[{"issue":"1","key":"7091_CR1","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.cirp.2011.03.023","volume":"60","author":"K Erkorkmaz","year":"2011","unstructured":"Erkorkmaz K, Alzaydi A, Elfizy A, Engin S (2011) Time-optimal trajectory generation for 5-axis on-the-fly laser drilling. CIRP Ann 60(1):411\u2013414","journal-title":"CIRP Ann"},{"issue":"1","key":"7091_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.cirp.2007.05.085","volume":"56","author":"T Huang","year":"2007","unstructured":"Huang T, Wang P, Mei J, Zhao X, Chetwynd D (2007) Time minimum trajectory planning of a 2-dof translational parallel robot for pick-and-place operations. CIRP Ann 56(1):365\u2013368","journal-title":"CIRP Ann"},{"issue":"2","key":"7091_CR3","first-page":"132","volume":"3","author":"Q Zhang","year":"2016","unstructured":"Zhang Q, Zhao M-Y (2016) Minimum time path planning of robotic manipulator in drilling\/spot welding tasks. J Comput Des Eng 3(2):132\u2013139","journal-title":"J Comput Des Eng"},{"key":"7091_CR4","doi-asserted-by":"crossref","unstructured":"Morales C, Adasme P (2017) Modeling a simple traveler salesman problem for improving energy efficiency in robots that execute computer numerical control machining. In: 2017 CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON). IEEE, pp 1\u20135","DOI":"10.1109\/CHILECON.2017.8229677"},{"key":"7091_CR5","doi-asserted-by":"crossref","unstructured":"Zhao J, Zhao L, Liu H (2016) Motion planning of hyper-redundant manipulators based on ant colony optimization. In: 2016 IEEE International Conference on Robotics and Biomimetics (ROBIO). IEEE, pp 1250\u20131255","DOI":"10.1109\/ROBIO.2016.7866497"},{"issue":"1","key":"7091_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.rcim.2004.04.003","volume":"21","author":"PT Zacharia","year":"2005","unstructured":"Zacharia PT, Aspragathos N (2005) Optimal robot task scheduling based on genetic algorithms. Robot Comput-Integr Manuf 21(1):67\u201379","journal-title":"Robot Comput-Integr Manuf"},{"key":"7091_CR7","doi-asserted-by":"crossref","unstructured":"Xu J, Harada K, Wan W, Ueshiba T, Domae Y (2020) Planning an efficient and robust base sequence for a mobile manipulator performing multiple pick-and-place tasks. In: 2020 IEEE International Conference on Robotics and Automation (ICRA). IEEE, pp 11018\u201311024","DOI":"10.1109\/ICRA40945.2020.9196999"},{"key":"7091_CR8","doi-asserted-by":"crossref","unstructured":"Chung WK, Xu Y (2012) Path planning algorithm for space manipulator with a minimum energy demand. In: 2012 IEEE International Conference on Robotics and Biomimetics (ROBIO). IEEE, pp 1556\u20131563","DOI":"10.1109\/ROBIO.2012.6491189"},{"issue":"1","key":"7091_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53\u201366","journal-title":"IEEE Trans Evol Comput"},{"key":"7091_CR10","unstructured":"Khalil E, Dai H, Zhang Y, Dilkina B, Song L (2017) Learning combinatorial optimization algorithms over graphs. Adv Neural Inf Process Syst 30"},{"key":"7091_CR11","doi-asserted-by":"crossref","unstructured":"Xiao Y, Wang D, Li B, Chen H, Pang W, Wu X, Li H, Xu D, Liang Y, Zhou Y (2024) Reinforcement learning-based nonautoregressive solver for traveling salesman problems. IEEE Trans Neural Netw Learn Syst","DOI":"10.1109\/TNNLS.2024.3483231"},{"key":"7091_CR12","doi-asserted-by":"crossref","unstructured":"Ma J, Zhao Z, Yi X, Chen J, Hong L, Chi EH (2018) Modeling task relationships in multi-task learning with multi-gate mixture-of-experts. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery & data mining, pp 1930\u20131939","DOI":"10.1145\/3219819.3220007"},{"key":"7091_CR13","doi-asserted-by":"crossref","unstructured":"Kendall A, Gal Y, Cipolla R (2018) Multi-task learning using uncertainty to weigh losses for scene geometry and semantics. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 7482\u20137491","DOI":"10.1109\/CVPR.2018.00781"},{"key":"7091_CR14","unstructured":"Applegate DL, Bixby RE, Chv\u00e1tal V, Cook WJ (2011) The traveling salesman problem: a computational study. Princeton University Press, Princeton"},{"key":"7091_CR15","first-page":"966","volume":"12","author":"K Helsgaun","year":"2017","unstructured":"Helsgaun K (2017) An extension of the lin-kernighan-helsgaun tsp solver for constrained traveling salesman and vehicle routing problems. Roskilde: Roskilde University 12:966\u2013980","journal-title":"Roskilde: Roskilde University"},{"issue":"6","key":"7091_CR16","doi-asserted-by":"publisher","first-page":"3143","DOI":"10.1109\/TCYB.2019.2962865","volume":"51","author":"L Feng","year":"2020","unstructured":"Feng L, Huang Y, Zhou L, Zhong J, Gupta A, Tang K, Tan KC (2020) Explicit evolutionary multitasking for combinatorial optimization: a case study on capacitated vehicle routing problem. IEEE Trans Cybern 51(6):3143\u20133156","journal-title":"IEEE Trans Cybern"},{"key":"7091_CR17","unstructured":"Vinyals O, Fortunato M, Jaitly N (2015) Pointer networks. Adv Neural Inf Process Syst 28"},{"issue":"11","key":"7091_CR18","first-page":"2521","volume":"47","author":"K-W Li","year":"2021","unstructured":"Li K-W, Zhang T, Wang R, Qin W, He H-H, Huang H (2021) Research reviews of combinatorial optimization methods based on deep reinforcement learning. Acta Automatica Sinica 47(11):2521\u20132537","journal-title":"Acta Automatica Sinica"},{"key":"7091_CR19","doi-asserted-by":"crossref","unstructured":"Fu Z-H, Qiu K-B, Zha H (2021) Generalize a small pre-trained model to arbitrarily large tsp instances. In: Proceedings of the AAAI conference on artificial intelligence, vol 35, pp 7474\u20137482","DOI":"10.1609\/aaai.v35i8.16916"},{"key":"7091_CR20","unstructured":"Bello I, Pham H, Le QV, Norouzi M, Bengio S (2016) Neural combinatorial optimization with reinforcement learning. arXiv:1611.09940"},{"key":"7091_CR21","unstructured":"Nazari M, Oroojlooy A, Snyder L, Tak\u00e1c M (2018) Reinforcement learning for solving the vehicle routing problem. Advances Neural Inf Process Syst 31"},{"key":"7091_CR22","unstructured":"Kool W, Van\u00a0Hoof H, Welling M (2018) Attention, learn to solve routing problems! arXiv:1803.08475"},{"key":"7091_CR23","unstructured":"Bresson X, Laurent T (2021) The transformer network for the traveling salesman problem. arXiv:2103.03012"},{"key":"7091_CR24","doi-asserted-by":"crossref","unstructured":"Deudon M, Cournut P, Lacoste A, Adulyasak Y, Rousseau L-M (2018) Learning heuristics for the tsp by policy gradient. In: Integration of constraint programming, artificial intelligence, and operations research: 15th international conference, CPAIOR 2018, Delft, The Netherlands, June 26\u201329, 2018, Proceedings 15. Springer, pp 170\u2013181","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"7091_CR25","unstructured":"Nowak A, Folqu\u00e9 D, Bruna J (2018) Divide and conquer networks. In: International conference on learning representations"},{"key":"7091_CR26","unstructured":"Joshi CK, Laurent T, Bresson X (2019) An efficient graph convolutional network technique for the travelling salesman problem. arXiv:1906.01227"},{"key":"7091_CR27","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.neunet.2023.02.014","volume":"161","author":"H Yang","year":"2023","unstructured":"Yang H, Zhao M, Yuan L, Yu Y, Li Z, Gu M (2023) Memory-efficient transformer-based network model for traveling salesman problem. Neural Netw 161:589\u2013597","journal-title":"Neural Netw"},{"key":"7091_CR28","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/j.neunet.2023.05.003","volume":"164","author":"T Zhu","year":"2023","unstructured":"Zhu T, Shi X, Xu X, Cao J (2023) An accelerated end-to-end method for solving routing problems. Neural Netw 164:535\u2013545","journal-title":"Neural Netw"},{"issue":"1","key":"7091_CR29","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/s11760-024-03709-w","volume":"19","author":"H Li","year":"2025","unstructured":"Li H, Qianqian D (2025) Solving method of traveling salesman problem based on performer graph self-attention mechanism. SIViP 19(1):154","journal-title":"SIViP"},{"key":"7091_CR30","doi-asserted-by":"crossref","unstructured":"Ye T, Zhang Z, Zhang Q, Chen J, Wang J (2025) Solving multiobjective combinatorial optimization via learning to improve method. IEEE Trans Emerg Topics Comput Intell","DOI":"10.1109\/TETCI.2025.3540424"},{"key":"7091_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2025.127311","volume":"278","author":"J Luo","year":"2025","unstructured":"Luo J, Li C (2025) An efficient encoder-decoder network for the capacitated vehicle routing problem. Expert Syst Appl 278:127311","journal-title":"Expert Syst Appl"},{"issue":"3","key":"7091_CR32","doi-asserted-by":"publisher","first-page":"155","DOI":"10.3390\/systems13030155","volume":"13","author":"J Li","year":"2025","unstructured":"Li J, Fu W, Huang G, Liu K, Zhang J, Fu Y (2025) Combining mamba and attention-based neural network for electric ground-handling vehicles scheduling. Systems 13(3):155","journal-title":"Systems"},{"issue":"1","key":"7091_CR33","first-page":"15","volume":"12","author":"J Liu","year":"2025","unstructured":"Liu J, Yap HJ, Khairuddin ASM (2025) Minimizing energy usage in multi-point manufacturing: a dimensional transfer learning strategy. J Comput Des Eng 12(1):15\u201333","journal-title":"J Comput Des Eng"},{"issue":"1","key":"7091_CR34","doi-asserted-by":"publisher","first-page":"3563846","DOI":"10.1155\/2018\/3563846","volume":"2018","author":"L Luo","year":"2018","unstructured":"Luo L, Wen H, Lu Q, Huang H, Chen W, Zou X, Wang C (2018) Collision-free path-planning for six-dof serial harvesting robot based on energy optimal and artificial potential field. Complexity 2018(1):3563846","journal-title":"Complexity"},{"key":"7091_CR35","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1007379606734","volume":"28","author":"R Caruana","year":"1997","unstructured":"Caruana R (1997) Multitask learning. Mach Learn 28:41\u201375","journal-title":"Mach Learn"},{"issue":"1","key":"7091_CR36","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1162\/neco.1991.3.1.79","volume":"3","author":"RA Jacobs","year":"1991","unstructured":"Jacobs RA, Jordan MI, Nowlan SJ, Hinton GE (1991) Adaptive mixtures of local experts. Neural Comput 3(1):79\u201387","journal-title":"Neural Comput"},{"key":"7091_CR37","unstructured":"Eigen D, Ranzato M, Sutskever I (2013) Learning factored representations in a deep mixture of experts. arXiv:1312.4314"},{"key":"7091_CR38","unstructured":"Shazeer N, Mirhoseini A, Maziarz K, Davis A, Le Q, Hinton G, Dean J (2017) Outrageously large neural networks: the sparsely-gated mixture-of-experts layer. arXiv:1701.06538"},{"key":"7091_CR39","unstructured":"Ioffe S (2015) Batch normalization: accelerating deep network training by reducing internal covariate shift. arXiv:1502.03167"},{"key":"7091_CR40","unstructured":"Vaswani A (2017) Attention is all you need. Adv Neural Inf Process Syst"},{"key":"7091_CR41","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.neucom.2022.08.005","volume":"508","author":"K Lei","year":"2022","unstructured":"Lei K, Guo P, Wang Y, Wu X, Zhao W (2022) Solve routing problems with a residual edge-graph attention neural network. Neurocomputing 508:79\u201398","journal-title":"Neurocomputing"},{"key":"7091_CR42","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1022672621406","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams RJ (1992) Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach Learn 8:229\u2013256","journal-title":"Mach Learn"},{"key":"7091_CR43","unstructured":"Ma Q, Ge S, He D, Thaker D, Drori I (2019) Combinatorial optimization by graph pointer networks and hierarchical reinforcement learning. arXiv:1911.04936"},{"key":"7091_CR44","doi-asserted-by":"publisher","unstructured":"Dijkstra EW (2022) A note on two problems in connexion with graphs, 1st edn. Association for Computing Machinery, New York, NY, USA, pp 287\u2013290. https:\/\/doi.org\/10.1145\/3544585.3544600","DOI":"10.1145\/3544585.3544600"},{"issue":"1","key":"7091_CR45","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held M, Karp RM (1962) A dynamic programming approach to sequencing problems. J Soc Ind Appl Math 10(1):196\u2013210","journal-title":"J Soc Ind Appl Math"},{"issue":"2","key":"7091_CR46","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498\u2013516","journal-title":"Oper Res"},{"issue":"4","key":"7091_CR47","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling-salesman problem. J Oper Res Soc Am 2(4):393\u2013410","journal-title":"J Oper Res Soc Am"},{"key":"7091_CR48","doi-asserted-by":"crossref","unstructured":"Christofides N (2022) Worst-case analysis of a new heuristic for the travelling salesman problem. In: Operations research forum, vol 3. Springer, p 20","DOI":"10.1007\/s43069-021-00101-z"},{"key":"7091_CR49","volume-title":"Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing","author":"E Aarts","year":"1989","unstructured":"Aarts E, Korst J (1989) Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing. John Wiley & Sons, Inc., USA"},{"issue":"7","key":"7091_CR50","doi-asserted-by":"publisher","first-page":"4974","DOI":"10.1002\/cpe.4974","volume":"31","author":"P Yelmewad","year":"2019","unstructured":"Yelmewad P, Talawar B (2019) Parallel iterative hill climbing algorithm to solve tsp on gpu. Concurr Comput Pract Exp 31(7):4974","journal-title":"Concurr Comput Pract Exp"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-026-07091-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-026-07091-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-026-07091-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T10:16:27Z","timestamp":1774865787000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-026-07091-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["7091"],"URL":"https:\/\/doi.org\/10.1007\/s10489-026-07091-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"7 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"55"}}