{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:02:21Z","timestamp":1725559341137},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540269748"},{"type":"electronic","value":"9783540318897"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11512073_24","type":"book-chapter","created":{"date-parts":[[2010,7,9]],"date-time":"2010-07-09T17:07:27Z","timestamp":1278695247000},"page":"323-334","source":"Crossref","is-referenced-by-count":0,"title":["Scalability of Dial-a-Ride Systems\u2014A Case Study to Assess Utilities of Ubiquitous Mass User Support"],"prefix":"10.1007","author":[{"given":"Noda","family":"Itsuki","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","first-page":"838","volume-title":"Proceedings of the 19th conference on Winter simulation","author":"W.A. Bailey Jr.","year":"1987","unstructured":"Bailey Jr., W.A., Clark Jr., T.D.: A simulation analysis of demand and fleet size effects on taxicab service rates. In: Proceedings of the 19th conference on Winter simulation, pp. 838\u2013844. ACM Press, New York (1987)"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","volume":"10","author":"L.D. Bodin","year":"1983","unstructured":"Bodin, L.D., Golden, B.L., Assad, A., Ball, M.O.: Routing and scheduling of vehicles and crews: the state of the art. Computers and Operation Research\u00a010, 63\u2013211 (1983)","journal-title":"Computers and Operation Research"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Bianco, L., Mingozzi, A., Riccaiardelli, S., Spadoni, M.: Exact and heuristic procedures for the traveling salesman problem with procedence constraints, based on dynamic programming. In: INFOR, 32th edn., pp. 19\u201331 (1994)","DOI":"10.1080\/03155986.1994.11732235"},{"issue":"1","key":"24_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0166-218X(00)00390-5","volume":"113","author":"D. Hauptmeier","year":"2001","unstructured":"Hauptmeier, D., Krumke, S.O., Rambau, J., Wirth, H.-C.: Euler is standing in line dial-a-ride problems with precedence-constraints. Discrete Applied Mathematics\u00a0113(1), 87\u2013107 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0377-2217(93)E0292-6","volume":"83","author":"P. Healy","year":"1995","unstructured":"Healy, P., Moll, R.: A new extension of local search applied to the dial-a-ride problem. European Journal of Operations Research\u00a083, 83\u2013104 (1995)","journal-title":"European Journal of Operations Research"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/3-540-44683-4_43","volume-title":"Mathematical Foundations of Computer Science 2001","author":"S.O. Krumke","year":"2001","unstructured":"Krumke, S.O., de Paepe, W.E., Poensgen, D., Stougie, L.: News from the Online Traveling Repairman. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001, vol.\u00a02136, p. 487. Springer, Heidelberg (2001)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. In: IEEE International Conference on Tools with Artificial Intelligence, vol.\u00a013, pp. 160\u2013167 (2001)","DOI":"10.1109\/ICTAI.2001.974461"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Noda, I., Ohta, M., Shinoda, K., Kumada, Y., Nakashima, H.: Evaluation of usability of dial-a-ride systems by social simulation. In: Proc. of Fourth International Workshop on Multi-Agent-Based Simulation, July 2003, pp. 139\u2013152 (2003)","DOI":"10.1007\/978-3-540-24613-8_12"},{"issue":"12","key":"24_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0898-1221(97)00090-4","volume":"33","author":"K.S. Ruland","year":"1997","unstructured":"Ruland, K.S., Rodin, E.Y.: The pickup and delivery problem: faces and branch-and-cut algorithm. Computers Math. Applic.\u00a033(12), 1\u201313 (1997)","journal-title":"Computers Math. Applic."},{"key":"24_CR10","unstructured":"Silesia, Z.C.: Parallel simulated annealing for the set-partitioning problem. In: The 8th Euromicro Workshop on Parallel and Distributed Processing, pp. 343\u2013350 (2000)"},{"key":"24_CR11","unstructured":"Silesia, Z.C.: Parallel simulated annealing for the delivery problem. In: The 9th Euromicro Workshop on Parallel and Distributed Processing, pp. 219\u2013226 (2001)"},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"M.W.P. Savelsbergh","year":"1995","unstructured":"Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery program. Transportation Science\u00a029(1), 17\u201329 (1995)","journal-title":"Transportation Science"}],"container-title":["Lecture Notes in Computer Science","Massively Multi-Agent Systems I"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11512073_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:04:42Z","timestamp":1605643482000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11512073_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540269748","9783540318897"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11512073_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}