{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:07:28Z","timestamp":1759666048727},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319669380"},{"type":"electronic","value":"9783319669397"}],"license":[{"start":{"date-parts":[[2017,9,5]],"date-time":"2017-09-05T00:00:00Z","timestamp":1504569600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-66939-7_28","type":"book-chapter","created":{"date-parts":[[2017,9,4]],"date-time":"2017-09-04T15:10:54Z","timestamp":1504537854000},"page":"325-336","source":"Crossref","is-referenced-by-count":4,"title":["Solving Dial-A-Ride Problems Using Multiple Ant Colony System with Fleet Size Minimisation"],"prefix":"10.1007","author":[{"given":"Twinkle","family":"Tripathy","sequence":"first","affiliation":[]},{"given":"Sarat Chandra","family":"Nagavarapu","sequence":"additional","affiliation":[]},{"given":"Kaveh","family":"Azizian","sequence":"additional","affiliation":[]},{"given":"Ramesh","family":"Ramasamy Pandi","sequence":"additional","affiliation":[]},{"given":"Justin","family":"Dauwels","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,5]]},"reference":[{"key":"28_CR1","unstructured":"Wilson, N.H., Sussman, J.M., Wong, H.K., Higonnet, T.: Scheduling algorithms for a dial-a-ride system. Massachusetts Institute of Technology, Urban Systems Laboratory (1971)"},{"issue":"3","key":"28_CR2","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/trsc.17.3.351","volume":"17","author":"HN Psaraftis","year":"1983","unstructured":"Psaraftis, H.N.: An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transp. Sci. 17(3), 351\u2013357 (1983)","journal-title":"Transp. Sci."},{"issue":"1","key":"28_CR3","doi-asserted-by":"crossref","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. Eur. J. Oper. Res. 83(1), 83\u2013104 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"28_CR4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"J-F Cordeau","year":"2007","unstructured":"Cordeau, J.-F., Laporte, G.: The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153(1), 29\u201346 (2007)","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"28_CR5","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"J-F Cordeau","year":"2003","unstructured":"Cordeau, J.-F., Laporte, G.: A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transp. Res. Part B: Methodol. 37(6), 579\u2013594 (2003)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"3","key":"28_CR6","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.parco.2003.12.001","volume":"30","author":"A Attanasio","year":"2004","unstructured":"Attanasio, A., Cordeau, J.-F., Ghiani, G., Laporte, G.: Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput. 30(3), 377\u2013387 (2004)","journal-title":"Parallel Comput."},{"issue":"2","key":"28_CR7","first-page":"89","volume":"1","author":"J-F Cordeau","year":"2003","unstructured":"Cordeau, J.-F., Laporte, G.: The dial-a-ride problem (DARP): variants, modeling issues and algorithms. 4OR: A Q. J. Oper. Res. 1(2), 89\u2013101 (2003)","journal-title":"4OR: A Q. J. Oper. Res."},{"issue":"5","key":"28_CR8","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/j.engappai.2005.12.013","volume":"19","author":"B Rekiek","year":"2006","unstructured":"Rekiek, B., Delchambre, A., Saleh, H.A.: Handicapped person transportation: an application of the grouping genetic algorithm. Eng. Appl. Artif. Intell. 19(5), 511\u2013520 (2006)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"8","key":"28_CR9","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403\u20132435 (2007)","journal-title":"Comput. Oper. Res."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Stutzle, T.: Ant Colony Optimization. The MIT Press (2004)","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"28_CR11","unstructured":"Dorigo, M.: Optimization, learning and natural algorithms, Ph.D. thesis, Politecnico di Milano, Italy (1992)"},{"issue":"1","key":"28_CR12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"28_CR13","unstructured":"Gambardella, L.M., Taillard, E., Agazzi, G.: MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. Istituto Dalle Molle Di Studi Sull Intelligenza Artificiale (1999)"},{"key":"28_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trb.2013.02.007","volume":"52","author":"J Paquette","year":"2013","unstructured":"Paquette, J., Cordeau, J.-F., Laporte, G., Pascoal, M.M.B.: Combining multicriteria analysis and tabu search for dial-a-ride problems. Transp. Res. Part B: Methodol. 52, 1\u201316 (2013)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"4","key":"28_CR15","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.plrev.2005.10.001","volume":"2","author":"C Blum","year":"2005","unstructured":"Blum, C.: Ant colony optimization: introduction and recent trends. Phys. Life Rev. 2(4), 353\u2013373 (2005)","journal-title":"Phys. Life Rev."},{"issue":"6","key":"28_CR16","doi-asserted-by":"crossref","first-page":"846","DOI":"10.3844\/jcssp.2012.846.852","volume":"8","author":"WF Tan","year":"2012","unstructured":"Tan, W.F., Lee, L.S., Majid, Z.A., Seow, H.V.: Ant colony optimization for capacitated vehicle routing problem. J. Comput. Sci. 8(6), 846\u2013852 (2012)","journal-title":"J. Comput. Sci."},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"Bullnheimer, B., Hartl, R.F., Strauss, C.: Applying the ant system to the vehicle routing problem. In: Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 285\u2013296. Kluwer Academic Publishers, Dordrecht (1999)","DOI":"10.1007\/978-1-4615-5775-3_20"},{"key":"28_CR18","unstructured":"http:\/\/alpha.uhasselt.be\/kris.braekers\/"}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Computational Intelligence Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66939-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T03:47:23Z","timestamp":1570074443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66939-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,5]]},"ISBN":["9783319669380","9783319669397"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66939-7_28","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017,9,5]]}}}