{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T14:56:02Z","timestamp":1771685762675,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/icci-cc.2013.6622277","type":"proceedings-article","created":{"date-parts":[[2013,10,11]],"date-time":"2013-10-11T22:58:11Z","timestamp":1381532291000},"page":"421-427","source":"Crossref","is-referenced-by-count":6,"title":["Flexible route planning for amusement parks navigation"],"prefix":"10.1109","author":[{"given":"Hayato","family":"Ohwada","sequence":"first","affiliation":[]},{"given":"Masato","family":"Okada","sequence":"additional","affiliation":[]},{"given":"Katsutoshi","family":"Kanamori","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.7763\/IJMLC.2012.V2.234"},{"key":"14","first-page":"111","article-title":"A constraint-based route search system for smart phone in attraction facilities","author":"shibuya","year":"2012","journal-title":"The International Multi-Conference on Complexity Informatics and Cybernetics"},{"key":"11","year":"0"},{"key":"12","year":"0"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"2","author":"syouta","year":"0","journal-title":"The Minimum Route in Universal Studio Japan"},{"key":"1","author":"yuki","year":"0","journal-title":"OR of Amusement Park as an Example of the 2005 World Exposition Aichi Japan"},{"key":"10","first-page":"731","article-title":"Optimal placement of valves in a water distribution network with CLP (FD)","author":"massimiliano","year":"2011","journal-title":"the 16th International Conference on Logic Programming"},{"key":"7","first-page":"1","article-title":"Comparison of approximate methods for traveling salesman problem. IEICE transactions on fundamentals of electronics","volume":"625","author":"takenori","year":"2102","journal-title":"Computer and Communication Sciences"},{"key":"6","article-title":"Inversed function delayed network for traveling salesman problem","author":"takahiro","year":"0","journal-title":"IEICE Trans Fundamentals Elec"},{"key":"5","first-page":"17","article-title":"Solving vehicle routing problems with soft time windows using chaotic neuro dynamics","volume":"105","author":"takashi","year":"2006","journal-title":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1997.592327"},{"key":"9","first-page":"316","article-title":"Solving small TSPs with constraints","author":"caseau","year":"1997","journal-title":"Proc The 14th International Conference on Logic Programming"},{"key":"8","first-page":"61","article-title":"A randomized and genetic hybrid algorithm for the traveling salesman problem","volume":"27","author":"eiichi","year":"2001","journal-title":"Information Processing Society of Japan"}],"event":{"name":"2013 12th IEEE International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)","location":"New York, NY, USA","start":{"date-parts":[[2013,7,16]]},"end":{"date-parts":[[2013,7,18]]}},"container-title":["2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6605694\/6622214\/06622277.pdf?arnumber=6622277","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T13:13:39Z","timestamp":1490188419000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6622277\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icci-cc.2013.6622277","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}