{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:31:09Z","timestamp":1774420269370,"version":"3.50.1"},"reference-count":43,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T00:00:00Z","timestamp":1660953600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,8,20]],"date-time":"2022-08-20T00:00:00Z","timestamp":1660953600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,8,20]]},"DOI":"10.1109\/case49997.2022.9926520","type":"proceedings-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T00:58:44Z","timestamp":1667523524000},"page":"1198-1205","source":"Crossref","is-referenced-by-count":4,"title":["Pareto Frontier Approximation Network (PA-Net) to Solve Bi-objective TSP"],"prefix":"10.1109","author":[{"given":"Ishaan","family":"Mehta","sequence":"first","affiliation":[{"name":"Toronto Metropolitan University,Department of Mechanical and Industrial Engineering"}]},{"given":"Sharareh","family":"Taghipour","sequence":"additional","affiliation":[{"name":"Toronto Metropolitan University,Department of Mechanical and Industrial Engineering"}]},{"given":"Sajad","family":"Saeedi","sequence":"additional","affiliation":[{"name":"Toronto Metropolitan University,Department of Mechanical and Industrial Engineering"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICEIEC.2019.8784651"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/wcica.2002.1021392"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2004.04.003"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460566"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11218-8_6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2016.7743866"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88051-6_14"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.802873"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2295886"},{"issue":"4","key":"ref10","first-page":"508","article-title":"An external archive guided multi-objective evolutionary algorithm based on decomposition for combinatorial optimization","volume":"19","author":"Cai","year":"2014","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2600642"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2977661"},{"key":"ref14","article-title":"Machine learning for combinatorial optimization: a methodological tour d\u2019horizon","author":"Bengio","year":"2020","journal-title":"European Journal of Operational Research"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3004964"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105400"},{"key":"ref17","first-page":"2692","article-title":"Pointer networks","author":"Vinyals","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref18","article-title":"An efficient graph convolutional network technique for the travelling salesman problem","author":"Joshi","year":"2019"},{"key":"ref19","article-title":"Neural combinatorial optimization with reinforcement learning","author":"Bello","year":"2016"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"ref21","article-title":"Attention, learn to solve routing problems!","author":"Kool","year":"2018"},{"key":"ref22","article-title":"Learning to iteratively solve routing problems with dual-aspect collaborative transformer","volume":"34","author":"Ma","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref23","first-page":"527","article-title":"Multi-task learning as multi-objective optimization","author":"Sener","year":"2018","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref24","first-page":"12060","article-title":"Pareto multitask learning","author":"Lin","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref25","first-page":"6597","article-title":"Multi-task learning with user preferences: Gradient descent with controlled ascent in pareto optimization","volume-title":"International Conference on Machine Learning","author":"Mahapatra"},{"key":"ref26","article-title":"Efficient multi-objective optimization for deep learning","author":"Ruchte","year":"2021"},{"key":"ref27","article-title":"Learning the pareto front with hypernetworks","volume-title":"International Conference on Learning Representations","author":"Navon"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3987"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2014.6889738"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2016.08.152"},{"key":"ref31","first-page":"14636","article-title":"A generalized algorithm for multi-objective reinforcement learning and policy adaptation","author":"Yang","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4961"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2009.03.037"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0186-0"},{"key":"ref35","volume-title":"Advances in multi-objective nature inspired computing.","volume":"272","author":"Coello","year":"2009"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496307510"},{"key":"ref37","article-title":"Reinforcement learning for solving the vehicle routing problem","volume":"31","author":"Nazari","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref38","article-title":"Reward constrained policy optimization","author":"Tessler","year":"2018"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696"},{"key":"ref40","first-page":"9300","article-title":"Multi-agent routing value iteration network","volume-title":"International Conference on Machine Learning","author":"Sykora"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.12.014"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.11.016"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/CRV52889.2021.00019"}],"event":{"name":"2022 IEEE 18th International Conference on Automation Science and Engineering (CASE)","location":"Mexico City, Mexico","start":{"date-parts":[[2022,8,20]]},"end":{"date-parts":[[2022,8,24]]}},"container-title":["2022 IEEE 18th International Conference on Automation Science and Engineering (CASE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9926286\/9926419\/09926520.pdf?arnumber=9926520","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T06:25:43Z","timestamp":1706077543000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9926520\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,20]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/case49997.2022.9926520","relation":{},"subject":[],"published":{"date-parts":[[2022,8,20]]}}}