{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:30:32Z","timestamp":1750221032116,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T00:00:00Z","timestamp":1569283200000},"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":[[2019,9,24]]},"DOI":"10.1145\/3338840.3355644","type":"proceedings-article","created":{"date-parts":[[2019,11,12]],"date-time":"2019-11-12T21:49:16Z","timestamp":1573595356000},"page":"244-249","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Time-dependent theme park routing problem"],"prefix":"10.1145","author":[{"given":"Yang","family":"Zhang","sequence":"first","affiliation":[{"name":"Hosei University, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiacheng","family":"Li","sequence":"additional","affiliation":[{"name":"Hosei University, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaoman","family":"Du","sequence":"additional","affiliation":[{"name":"Hosei University, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Li","sequence":"additional","affiliation":[{"name":"Hosei University, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,9,24]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Hidenori. Kawamura Koichi. Kurumatani and Azuma Ohuchi. 2003. A Study on Coordination Scheduling Algorithm for Theme Park Problem with Multiagent IPSJ SIG technical reports (ICS). (2002-ICS-131) 25--30.  Hidenori. Kawamura Koichi. Kurumatani and Azuma Ohuchi. 2003. A Study on Coordination Scheduling Algorithm for Theme Park Problem with Multiagent IPSJ SIG technical reports (ICS). (2002-ICS-131) 25--30."},{"volume-title":"Toward Development of Mass User Support in Ubiquitous Environment, IPSJ SIG technical reports (UBI).","year":"2003","author":"Hidenori Kawamura","key":"e_1_3_2_1_2_1"},{"volume-title":"Comparison of Traversal Strategies in Theme Parks","year":"2007","author":"Yasushi Yanagita","key":"e_1_3_2_1_3_1"},{"issue":"7","key":"e_1_3_2_1_4_1","first-page":"1507","article-title":"An Optimal Routing Problem for Sightseeing and its Solution","volume":"24","author":"Yoshitaka Nakamura","year":"2004","journal-title":"IEEJ Trans. EIS."},{"key":"e_1_3_2_1_5_1","first-page":"31","article-title":"Algorithm and System of Information Providing Service for a Traveling route of Multiple spots","volume":"99","year":"1999","journal-title":"IPSJ SIG Notes"},{"key":"e_1_3_2_1_6_1","volume-title":"Papers and Proceedings of the Geographic Information Systems Association.","volume":"9","author":"Okunuki Y. Sadahiro.","year":"2000"},{"key":"e_1_3_2_1_7_1","unstructured":"Junichi. Ochiai Hitoshi. Kanoh. 2013. Solving Time-Dependent Traveling Salesman Problem using Ant Colony Optimization Based on Predicted Traffic and Its Application to a Real Road Network. IPSJ SIG technical reports (MPS) 1--6.  Junichi. Ochiai Hitoshi. Kanoh. 2013. Solving Time-Dependent Traveling Salesman Problem using Ant Colony Optimization Based on Predicted Traffic and Its Application to a Real Road Network. IPSJ SIG technical reports (MPS) 1--6."},{"issue":"2","key":"e_1_3_2_1_8_1","first-page":"274","article-title":"Dynasearch Algorithms for Solving Time Dependent Travelling Salesman Problem","volume":"24","author":"Li Yanfeng","year":"2009","journal-title":"Control and Decision."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1090.001.0001"},{"key":"e_1_3_2_1_10_1","unstructured":"Maojun. Li Tong. Tiaosheng. 1999. A partheno-genetic algorithm and analysis on its global convergence. Acta automatica sinica. 25.1 68--72.  Maojun. Li Tong. Tiaosheng. 1999. A partheno-genetic algorithm and analysis on its global convergence. Acta automatica sinica. 25.1 68--72."}],"event":{"name":"RACS '19: International Conference on Research in Adaptive and Convergent Systems","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Chongqing China","acronym":"RACS '19"},"container-title":["Proceedings of the Conference on Research in Adaptive and Convergent Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338840.3355644","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3338840.3355644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:43:29Z","timestamp":1750207409000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3338840.3355644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,24]]},"references-count":10,"alternative-id":["10.1145\/3338840.3355644","10.1145\/3338840"],"URL":"https:\/\/doi.org\/10.1145\/3338840.3355644","relation":{},"subject":[],"published":{"date-parts":[[2019,9,24]]},"assertion":[{"value":"2019-09-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}