{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T11:49:46Z","timestamp":1774007386097,"version":"3.50.1"},"reference-count":76,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T00:00:00Z","timestamp":1646265600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology (MOST) of Taiwan","doi-asserted-by":"crossref","award":["MOST 108-2221-E-006-142, MOST 108-2636-E-006-013, MOST 109-2636-E-006-025, and MOST 110-2636-E-006-011"],"award-info":[{"award-number":["MOST 108-2221-E-006-142, MOST 108-2636-E-006-013, MOST 109-2636-E-006-025, and MOST 110-2636-E-006-011"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2022,6,30]]},"abstract":"<jats:p>\n            Hybrid computational intelligent systems that synergize learning-based inference models and route planning strategies have thrived in recent years. In this article, we focus on the non-monotonicity originated from heterogeneous urban data, as well as heuristics based on neural networks, and thereafter formulate the traveling transporter problem (TTP). TTP is a multi-criteria optimization problem and may be applied to the circular route deployment in public transportation. In particular, TTP aims to find an optimized route that maximizes passenger flow according to a neural-network-based inference model and minimizes the length of the route given several constraints, including must-visit stations and the requirement for additional ones. As a variation of the traveling salesman problem (TSP), we propose a framework that first recommends new stations\u2019 location while considering the herding effect between stations, and thereafter combines state-of-the-art TSP solvers and a metaheuristic named\n            <jats:italic>Trembling Hand<\/jats:italic>\n            , which is inspired by self-efficacy for solving TTP. Precisely, the proposed Trembling Hand enhances the spatial exploration considering the structural patterns, previous actions, and aging factors. Evaluation conducted on two real-world mass transit systems, Tainan and Chicago, shows that the proposed framework can outperform other state-of-the-art methods by securing the Pareto-optimal toward the objectives of TTP among comparative methods under various constrained settings.\n          <\/jats:p>","DOI":"10.1145\/3510034","type":"journal-article","created":{"date-parts":[[2022,3,3]],"date-time":"2022-03-03T09:07:01Z","timestamp":1646298421000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Traveling Transporter Problem: Arranging a New Circular Route in a Public Transportation System Based on Heterogeneous Non-Monotonic Urban Data"],"prefix":"10.1145","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7024-2476","authenticated-orcid":false,"given":"Fandel","family":"Lin","sequence":"first","affiliation":[{"name":"National Cheng Kung University, Tainan, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6924-1337","authenticated-orcid":false,"given":"Hsun-Ping","family":"Hsieh","sequence":"additional","affiliation":[{"name":"National Cheng Kung University, Tainan, Taiwan"}]}],"member":"320","published-online":{"date-parts":[[2022,3,3]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.3389\/fpsyg.2019.01795"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.1.82.15157"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1037\/0003-066X.37.2.122"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1037\/0003-066X.44.9.1175"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03456-5_24"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15775-2_25"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.10.004"},{"key":"e_1_3_1_10_2","volume-title":"Proceedings of the ICLR Workshop","author":"Bello Irwan","year":"2017","unstructured":"Irwan Bello, Hieu Pham, Quoc V. Le, Mohammad Norouzi, and Samy Bengio. 2017. Neural combinatorial optimization with reinforcement learning. In Proceedings of the ICLR Workshop."},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00982-2_12"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2008.04.001"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/S2212-5671(12)00147-5"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73956-2_24"},{"key":"e_1_3_1_15_2","volume-title":"Proceedings of the 2017 IEEE 9th International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment, and Management (HNICEM\u201917)","author":"Glenn Stanley","year":"2017","unstructured":"Stanley Glenn E. Brucal, and Elmer P. Dadios. 2017. Comparative analysis of solving traveling salesman problem using artificial intelligence algorithms. In Proceedings of the 2017 IEEE 9th International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment, and Management (HNICEM\u201917)."},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104854"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3362693"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.11.046"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/69"},{"key":"e_1_3_1_20_2","unstructured":"TSP. 2020. Concorde TSP Solver. Retrieved January 21 2022 from http:\/\/www.math.uwaterloo.ca\/tsp\/concorde.html."},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.5555\/129837"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2019.09.172"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975499.5"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2014.0534"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02094-0_7"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCI.2006.329691"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00116-6"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(91)90068-U"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"key":"e_1_3_1_31_2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Company."},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90059-1"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5819"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.3389\/frobt.2019.00125"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.18.6.1138"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-009-0004-6"},{"key":"e_1_3_1_39_2","volume-title":"Using POPMUSIC for Candidate Set Generation in the Lin-Kernighan-Helsgaun TSP SolverTechnical Report","author":"Helsgaun Keld","year":"2018","unstructured":"Keld Helsgaun. 2018. Using POPMUSIC for Candidate Set Generation in the Lin-Kernighan-Helsgaun TSP Solver. Technical Report. Roskilde University."},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.29322\/IJSRP.8.12.2018.p8481"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2932801"},{"key":"e_1_3_1_42_2","first-page":"4070","volume-title":"Proceedings of the 25th International Conference on Artificial Intelligence (IJCAI\u201916)","author":"Kamar Ece","year":"2016","unstructured":"Ece Kamar. 2016. Directions in hybrid intelligence: Complementing AI systems with human intelligence. In Proceedings of the 25th International Conference on Artificial Intelligence (IJCAI\u201916). 4070\u20134073."},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1137\/0208045"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-00951-3_11"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1037\/0882-7974.17.4.571"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90138-Y"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006529012972"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2019.1800289"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1314\/1\/012116"},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"issue":"1","key":"e_1_3_1_52_2","first-page":"1","article-title":"A joint passenger flow inference and path recommender system for deploying new routes and stations of mass transit transportation","volume":"16","author":"Lin Fandel","year":"2021","unstructured":"Fandel Lin and Hsun-Ping Hsieh. 2021. A joint passenger flow inference and path recommender system for deploying new routes and stations of mass transit transportation. ACM Transactions on Knowledge Discovery from Data 16, 1 (2021), 1\u201336.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM50108.2020.00137"},{"key":"e_1_3_1_54_2","first-page":"275","volume-title":"Machine Learning and Knowledge Discovery in Databases: Applied Data Science Track","author":"Lin Fandel","year":"2020","unstructured":"Fandel Lin, Hsun-Ping Hsieh, and Jie-Yu Fang. 2020. A route-affecting region based approach for feature extraction in transportation route planning. In Machine Learning and Knowledge Discovery in Databases: Applied Data Science Track. Lecture Notes in Computer Science, Vol. 12461. Springer, 275\u2013290."},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1961.5219222"},{"key":"e_1_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/NEUREL.2012.6419953"},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1080\/13658810600661508"},{"key":"e_1_3_1_59_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33021-6_21"},{"key":"e_1_3_1_60_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2015.10.006"},{"key":"e_1_3_1_61_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125403"},{"key":"e_1_3_1_62_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014731"},{"key":"e_1_3_1_63_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-9688-4_3"},{"key":"e_1_3_1_64_2","first-page":"81","volume-title":"Proceedings of the 11th Annual Symposium on Combinatorial Search (SoCS\u201918)","author":"Shaham Eshed","year":"2018","unstructured":"Eshed Shaham, Ariel Felner, Nathan R. Sturtevant, and Jeffrey S. Rosenschein. 2018. Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics. In Proceedings of the 11th Annual Symposium on Combinatorial Search (SoCS\u201918). 81\u201398."},{"key":"e_1_3_1_65_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2017.2759218"},{"key":"e_1_3_1_66_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0192274"},{"key":"e_1_3_1_67_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtrangeo.2004.11.003"},{"key":"e_1_3_1_68_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.06.039"},{"key":"e_1_3_1_69_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.21856"},{"key":"e_1_3_1_70_2","doi-asserted-by":"publisher","DOI":"10.1145\/1064546.1103378"},{"key":"e_1_3_1_71_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2015\/854218","article-title":"Solving large-scale TSP using a fast wedging insertion partitioning approach","author":"Xiang Zuoyong","year":"2015","unstructured":"Zuoyong Xiang, Zhenyu Chen, Xingyu Gao, Xinjun Wang, Fangchun Di, Lixin Li, Guangyi Liu, and Yi Zhang. 2015. Solving large-scale TSP using a fast wedging insertion partitioning approach. Mathematical Problems in Engineering 2015 (2015), 1\u20138.","journal-title":"Mathematical Problems in Engineering"},{"key":"e_1_3_1_72_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2020.01.002"},{"key":"e_1_3_1_73_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(97)00016-7"},{"key":"e_1_3_1_74_2","doi-asserted-by":"publisher","DOI":"10.1109\/72.363466"},{"key":"e_1_3_1_75_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397536.3422250"},{"key":"e_1_3_1_76_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2010.08.001"},{"key":"e_1_3_1_77_2","first-page":"412","volume-title":"Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS\u201908)","author":"Ziebart Brain D.","year":"2008","unstructured":"Brain D. Ziebart, Anind K. Dey, and James Andrew Bagnell. 2008. Fast planning for dynamic preferences. In Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS\u201908). 412\u2013419."}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3510034","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3510034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:24Z","timestamp":1750191144000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3510034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,3]]},"references-count":76,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6,30]]}},"alternative-id":["10.1145\/3510034"],"URL":"https:\/\/doi.org\/10.1145\/3510034","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,3]]},"assertion":[{"value":"2021-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-03-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}