{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:39:47Z","timestamp":1730273987654,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1109\/isic.2003.1254708","type":"proceedings-article","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T20:35:01Z","timestamp":1303936501000},"page":"620-625","source":"Crossref","is-referenced-by-count":1,"title":["Agent-based planning method for an on-demand transportation system"],"prefix":"10.1109","author":[{"given":"T.","family":"Miyamoto","sequence":"first","affiliation":[]},{"given":"K.","family":"Nakatyou","sequence":"additional","affiliation":[]},{"given":"S.","family":"Kumagai","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"639","article-title":"Online Dial-a-ride Problem: Minimizing the Completion tune","author":"ascheuer","year":"2000","journal-title":"STACS 2000 17th Annual Symposium on Theoretical Aspecte Of Computer Science Lecture Notes In Computer Science 1770"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46521-9_11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-0114(99)00035-4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/3468.531903"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02031946"},{"key":"ref4","first-page":"30","article-title":"The Dial-a-ride Problem in a Public Transit System","volume":"82","author":"uchimura","year":"1999","journal-title":"Electronics and Communications in Japan Part In Fundamental Electronic Science"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2002.1015354"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0898-1221(97)00090-4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1080\/03052159808941240"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-947X(1992)118:3(391)"},{"key":"ref7","first-page":"19","article-title":"Exact and Heuristic Procedures for the Traveling Salesman Problem with Precedence Constraints, Based on Dynamic-Programming","volume":"32","author":"bianco","year":"1994","journal-title":"Inferno"},{"article-title":"A New Parallel Tour Construction Algorithm for the Vehicle Routing Problem with Time Window","year":"0","author":"antes","key":"ref2"},{"key":"ref1","article-title":"Context-Dependent Agents for Real-TIme Scheduling in Manufacturing Systems","volume":"e85 a","author":"miyamoto","year":"2002","journal-title":"IEICE Transaction on Fundamentals of Electronics Communications and Computer Sciences"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00261-9"}],"event":{"name":"Proceedings of the 2003 IEEE International Symposium on Intelligent Control","start":{"date-parts":[[2003,10,8]]},"location":"Houston, TX, USA","end":{"date-parts":[[2003,10,8]]}},"container-title":["Proceedings of the 2003 IEEE International Symposium on Intelligent Control ISIC-03"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8881\/28053\/01254708.pdf?arnumber=1254708","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T01:33:07Z","timestamp":1489455187000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1254708\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isic.2003.1254708","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}