{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:18:32Z","timestamp":1750220312045,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T00:00:00Z","timestamp":1637280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,19]]},"DOI":"10.1145\/3501774.3501795","type":"proceedings-article","created":{"date-parts":[[2022,3,26]],"date-time":"2022-03-26T16:12:37Z","timestamp":1648311157000},"page":"142-149","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The Improvement of Simulated Annealing Algorithm on the Penalty Function in Multi-agent Traveling Salesman Problem"],"prefix":"10.1145","author":[{"given":"Tianchen","family":"Ren","sequence":"first","affiliation":[{"name":"Xi'an Aeronautical University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiayi","family":"Yang","sequence":"additional","affiliation":[{"name":"Nanjing Normal University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinxin","family":"Li","sequence":"additional","affiliation":[{"name":"University of Michigan, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,3,26]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"12","volume-title":"The Multiagent Planning Problem. Complexity","author":"Tam\u00e1s K.","unstructured":"Tam\u00e1s , K. , Giovanni , G. , Bendeg\u00faz , D. B. 2017. The Multiagent Planning Problem. Complexity : pp. 12 . Tam\u00e1s, K., Giovanni, G., Bendeg\u00faz, D. B. 2017. The Multiagent Planning Problem. Complexity: pp.12."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Li W. 2020. Solution Attractor of Local Search System: A Method to Reduce Computational Complexity of the Traveling Salesman Problem. In: Donald D. (Eds.). Novel Trends in the Traveling Salesman Problem. IntechOpen. Chapter 3.  Li W. 2020. Solution Attractor of Local Search System: A Method to Reduce Computational Complexity of the Traveling Salesman Problem. In: Donald D. (Eds.). Novel Trends in the Traveling Salesman Problem. IntechOpen. Chapter 3.","DOI":"10.5772\/intechopen.90521"},{"key":"e_1_3_2_1_3_1","unstructured":"Xing Z. Tu S. Xu l. 2020. Solve Traveling Salesman Problem by Monte Carlo Tree Search and Deep Neural Network. https:\/\/arxiv.org\/pdf\/2005.06879.pdf.  Xing Z. Tu S. Xu l. 2020. Solve Traveling Salesman Problem by Monte Carlo Tree Search and Deep Neural Network. https:\/\/arxiv.org\/pdf\/2005.06879.pdf."},{"issue":"2","key":"e_1_3_2_1_4_1","first-page":"699","article-title":"Solving Multiple Traveling Salesman Problem using the Gravitational Emulation Local Search","volume":"9","author":"Shokouhi Rostami A.","year":"2015","unstructured":"Shokouhi Rostami , A. , Mohanna , F. , Keshavarz , H. , Asghar Rahmani Hosseinabadi , A. 2015 . Solving Multiple Traveling Salesman Problem using the Gravitational Emulation Local Search Algorithm. Appl. Math. Inf. Sci. 9 , No. 2 , 699 - 709 . Shokouhi Rostami,A., Mohanna,F., Keshavarz, H., Asghar Rahmani Hosseinabadi, A. 2015. Solving Multiple Traveling Salesman Problem using the Gravitational Emulation Local Search Algorithm. Appl. Math. Inf. Sci. 9, No.2, 699-709.","journal-title":"Algorithm. Appl. Math. Inf. Sci."},{"key":"e_1_3_2_1_5_1","first-page":"100","volume-title":"Optimization of Multiple Traveling Salesman Problem Based on Simulated Annealing Genetic Algorithm. In: MATEC Web of Conferences. Cohasset.","author":"Xu M.","year":"2017","unstructured":"Xu , M. , Li , S. , Guo , J. 2017 . Optimization of Multiple Traveling Salesman Problem Based on Simulated Annealing Genetic Algorithm. In: MATEC Web of Conferences. Cohasset. pp. 100 . Xu,M., Li, S., Guo, J. 2017. Optimization of Multiple Traveling Salesman Problem Based on Simulated Annealing Genetic Algorithm. In: MATEC Web of Conferences. Cohasset. pp.100."},{"key":"e_1_3_2_1_6_1","unstructured":"Cook W. 2017. National Traveling Salesman Problems. http:\/\/www.math.uwaterloo.ca\/tsp\/world\/countries.html#DJ  Cook W. 2017. National Traveling Salesman Problems. http:\/\/www.math.uwaterloo.ca\/tsp\/world\/countries.html#DJ"},{"key":"e_1_3_2_1_7_1","unstructured":"Brownlee J. 2021. Simulated Annealing from Scratch in Python. https:\/\/machinelearningmastery.com\/simulated-annealing-from-scratch-in-python\/.  Brownlee J. 2021. Simulated Annealing from Scratch in Python. https:\/\/machinelearningmastery.com\/simulated-annealing-from-scratch-in-python\/."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.applthermaleng.2016.01.143"},{"key":"e_1_3_2_1_9_1","unstructured":"Varty Z. 2017. Simulated Annealing Overview. https:\/\/www.lancaster.ac.uk\/pg\/varty\/RTOne.pdf  Varty Z. 2017. Simulated Annealing Overview. https:\/\/www.lancaster.ac.uk\/pg\/varty\/RTOne.pdf"},{"key":"e_1_3_2_1_10_1","article-title":"A simulated annealing algorithm for the placement of dynamic mesh routers in a wireless mesh network with mobile clients","volume":"1","author":"Lamri S.","year":"2018","unstructured":"Lamri , S. , Louiza , B. , Djamil , A. 2018 . A simulated annealing algorithm for the placement of dynamic mesh routers in a wireless mesh network with mobile clients . Internet Technology Letters , Volume 1 , Issue 5. DOI: https:\/\/doi.org\/10.1002\/itl2.35. 10.1002\/itl2.35 Lamri, S., Louiza, B., Djamil, A. 2018. A simulated annealing algorithm for the placement of dynamic mesh routers in a wireless mesh network with mobile clients. Internet Technology Letters, Volume 1, Issue 5. DOI: https:\/\/doi.org\/10.1002\/itl2.35.","journal-title":"Internet Technology Letters"}],"event":{"name":"ESSE 2021: 2021 2nd European Symposium on Software Engineering","acronym":"ESSE 2021","location":"Larissa Greece"},"container-title":["2021 2nd European Symposium on Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3501774.3501795","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3501774.3501795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:45Z","timestamp":1750191105000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3501774.3501795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,19]]},"references-count":10,"alternative-id":["10.1145\/3501774.3501795","10.1145\/3501774"],"URL":"https:\/\/doi.org\/10.1145\/3501774.3501795","relation":{},"subject":[],"published":{"date-parts":[[2021,11,19]]},"assertion":[{"value":"2022-03-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}