{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T00:25:28Z","timestamp":1775175928872,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,8,26]],"date-time":"2011-08-26T00:00:00Z","timestamp":1314316800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10479-011-0948-6","type":"journal-article","created":{"date-parts":[[2011,8,25]],"date-time":"2011-08-25T13:23:36Z","timestamp":1314278616000},"page":"37-71","source":"Crossref","is-referenced-by-count":35,"title":["An optimization model and a solution algorithm for the many-to-many car pooling problem"],"prefix":"10.1007","volume":"191","author":[{"given":"Shangyao","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chun-Ying","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,8,26]]},"reference":[{"issue":"3","key":"948_CR1","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1287\/opre.1030.0106","volume":"52","author":"R. Baldacci","year":"2004","unstructured":"Baldacci, R., Maniezzo, V., & Mingozzi, A. (2004). An exact method for the car pooling problem based on Lagrangian column generation. Operations Research, 52(3), 422\u2013439.","journal-title":"Operations Research"},{"key":"948_CR2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1111\/1475-3995.00256","volume":"8","author":"A. Colorni","year":"2001","unstructured":"Colorni, A., & Righini, G. (2001). Modeling and optimizing dynamic dial-a-ride problems. International Transactions in Operational Research, 8, 155\u2013166.","journal-title":"International Transactions in Operational Research"},{"key":"948_CR3","unstructured":"Coppersmith, D., Nowicki, T. J., Paleologo, G. A., Tresser, C., & Wu, C. W. (2005). The optimality of the on-line greedy algorithm in carpool and chairman assignment problems (IBM Research Report). RC23721."},{"key":"948_CR4","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"J. F. Cordeau","year":"2006","unstructured":"Cordeau, J. F. (2006). A Branch-and-cut algorithm for the dial-a-ride problem. Operations Research, 54, 573\u2013586.","journal-title":"Operations Research"},{"key":"948_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. (2003a). A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research, Part B, 37, 579\u2013594.","journal-title":"Transportation Research, Part B"},{"key":"948_CR6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10288-002-0009-8","volume":"1","author":"J. F. Cordeau","year":"2003","unstructured":"Cordeau, J. F., & Laporte, G. (2003b). The dial-a-ride problem (DARP): variants, modeling issues and algorithms. 4OR, 1, 89\u2013101.","journal-title":"4OR"},{"key":"948_CR7","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. (2007). The dial-a-ride problem: models and algorithms. Annals of Operation Research, 153, 29\u201346.","journal-title":"Annals of Operation Research"},{"key":"948_CR8","doi-asserted-by":"crossref","first-page":"1605","DOI":"10.1016\/j.ejor.2005.02.038","volume":"175","author":"L. Coslovich","year":"2006","unstructured":"Coslovich, L., Pesenti, R., & Ukovich, W. (2006). A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. European Journal of Operational Research, 175, 1605\u20131615.","journal-title":"European Journal of Operational Research"},{"key":"948_CR9","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/j.trb.2003.07.001","volume":"38","author":"M. Diana","year":"2004","unstructured":"Diana, M., & Dessouky, M. M. (2004). A new regret insertion heuristic for solving large-scale dial-a-ride problems with time windows. Transportation Research, Part B, 38, 539\u2013557.","journal-title":"Transportation Research, Part B"},{"issue":"2","key":"948_CR10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1147\/rd.272.0133","volume":"27","author":"R. Fagin","year":"1983","unstructured":"Fagin, R., & Williams, J. H. (1983). A fair carpool scheduling algorithm. IBM Journal of Research & Development, 27(2), 133\u2013139.","journal-title":"IBM Journal of Research & Development"},{"key":"948_CR11","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1002\/atr.5670370302","volume":"37","author":"E. Ferrari","year":"2003","unstructured":"Ferrari, E., Manzini, R., Pareschi, A., Persona, A., & Regattieri, A. (2003). The car pooling problem: Heuristic algorithms based on savings functions. Journal of Advanced Transportation, 37, 243\u2013272.","journal-title":"Journal of Advanced Transportation"},{"key":"948_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M. L. Fisher","year":"1981","unstructured":"Fisher, M. L. (1981). The Lagrangian relaxation method for solving integer programming problem. Management Science, 27, 1\u201318.","journal-title":"Management Science"},{"key":"948_CR13","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. San Francisco: Freeman."},{"key":"948_CR14","unstructured":"Guo, Y. J. (2003). Trip cost urban transportation. Master\u2019s thesis, National Taiwan University, Taiwan, ROC."},{"key":"948_CR15","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1057\/palgrave.jors.2602287","volume":"58","author":"R. M. J\u00f8rgensen","year":"2007","unstructured":"J\u00f8rgensen, R. M., Larsen, J., & Bergvinsdottir, K. B. (2007). Solving the dial-a-ride problem using genetic algorithms. The Journal of the Operational Research Society, 58, 1321\u20131331.","journal-title":"The Journal of the Operational Research Society"},{"key":"948_CR16","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1016\/j.cor.2005.03.024","volume":"34","author":"E. Melachrinoudis","year":"2007","unstructured":"Melachrinoudis, E., Ilhan, A. B., & Min, H. (2007). A dial-a-ride problem for client transportation in a healthcare organization. Computers & Operations Research, 34, 742\u2013759.","journal-title":"Computers & Operations Research"},{"key":"948_CR17","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.jalgor.2004.05.001","volume":"55","author":"M. Naor","year":"2005","unstructured":"Naor, M. (2005). On fairness in the carpool problem. Journal of Algorithms, 55, 93\u201398.","journal-title":"Journal of Algorithms"},{"key":"948_CR18","volume-title":"Combinatorial optimization: algorithms and complexity","author":"C. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C., & Steiglitz, K. (1982). Combinatorial optimization: algorithms and complexity. Englewood Cliffs: Prentice-Hall."},{"key":"948_CR19","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/j.engappai.2005.12.013","volume":"19","author":"B. Rekiek","year":"2005","unstructured":"Rekiek, B., Delchambre, A., & Saleh, H. A. (2005). Handicapped person transportation: an application of the grouping genetic algorithm. Engineering Applications of Artificial Intelligence, 19, 511\u2013520.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"948_CR20","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1002\/net.20177","volume":"49","author":"S. Ropke","year":"2007","unstructured":"Ropke, S., Cordeau, J. F., & Laporte, G. (2007). Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks, 49, 258\u2013272.","journal-title":"Networks"},{"key":"948_CR21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0165-0114(99)00035-4","volume":"116","author":"D. Teodorovic","year":"2000","unstructured":"Teodorovic, D., & Radivojevic, G. (2000). A fuzzy logic approach to dynamic dial-a-ride problem. Fuzzy Sets and Systems, 116, 23\u201333.","journal-title":"Fuzzy Sets and Systems"},{"key":"948_CR22","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10288-006-0018-0","volume":"5","author":"R. Wolfler-Calvo","year":"2007","unstructured":"Wolfler-Calvo, R., & Colorni, A. (2007). An effective and fast heuristic for the dial-a-ride problem. 4OR, 5, 61\u201373.","journal-title":"4OR"},{"key":"948_CR23","doi-asserted-by":"crossref","first-page":"2263","DOI":"10.1016\/S0305-0548(03)00186-2","volume":"31","author":"R. Wolfler-Calvo","year":"2004","unstructured":"Wolfler-Calvo, R., Luigi, F. L., Haastrup, P., & Maniezzo, V. (2004). A distributed geographic information system for the daily car pooling problem. Computers & Operations Research, 31, 2263\u20132278.","journal-title":"Computers & Operations Research"},{"key":"948_CR24","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1111\/j.1475-3995.2006.00544.x","volume":"13","author":"K. I. Wong","year":"2006","unstructured":"Wong, K. I., & Bell, M. G. H. (2006). Solution of the dial-a-ride problem with multi-dimensional capacity constraints. International Transactions in Operational Research, 13, 195\u2013208.","journal-title":"International Transactions in Operational Research"},{"key":"948_CR25","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1016\/j.ejor.2004.09.060","volume":"174","author":"Z. Xiang","year":"2006","unstructured":"Xiang, Z., Chu, C., & Chen, H. (2006). A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. European Journal of Operational Research, 174, 1117\u20131139.","journal-title":"European Journal of Operational Research"},{"key":"948_CR26","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1002\/(SICI)1097-0037(199607)27:4<267::AID-NET2>3.0.CO;2-E","volume":"27","author":"S. Yan","year":"1996","unstructured":"Yan, S. (1996). Approximating reduced costs under degeneracy in a network flow problem with side constraints. Networks, 27, 267\u2013278.","journal-title":"Networks"},{"issue":"6","key":"948_CR27","doi-asserted-by":"crossref","first-page":"2049","DOI":"10.1016\/j.cor.2008.07.002","volume":"36","author":"S. Yan","year":"2009","unstructured":"Yan, S., & Shih, Y. L. (2009). Optimal scheduling of emergency roadway repair and subsequent relief distribution. Computers & Operations Research, 36(6), 2049\u20132065.","journal-title":"Computers & Operations Research"},{"issue":"6","key":"948_CR28","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/0191-2615(96)00013-6","volume":"30","author":"S. Yan","year":"1996","unstructured":"Yan, S., & Yang, D.H. (1996). A decision support framework for handling schedule perturbation. Transportation Research, Part B, 30(6), 405\u2013419.","journal-title":"Transportation Research, Part B"},{"issue":"5","key":"948_CR29","first-page":"379","volume":"30","author":"S. Yan","year":"1996","unstructured":"Yan, S., & Young, H. F. (1996). A decision support framework for multi-fleet routing and multi-stop flight scheduling. Transportation Research, Part A, 30(5), 379\u2013398.","journal-title":"Transportation Research, Part A"},{"issue":"5","key":"948_CR30","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.tre.2005.02.002","volume":"42","author":"S. Yan","year":"2006","unstructured":"Yan, S., Chen, S. C., & Chen, C. H. (2006b). Air cargo fleet routing and timetable setting with multiple on-time demands. Transportation Research, Part E, 42(5), 409\u2013430.","journal-title":"Transportation Research, Part E"},{"issue":"6","key":"948_CR31","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1080\/03081060601075674","volume":"29","author":"S. Yan","year":"2006","unstructured":"Yan, S., Lo, C. T., & Shih, Y. L. (2006a). A cargo container loading plan model and solution algorithm for international air express carriers. Transportation Planning and Technology, 29(6), 445\u2013470.","journal-title":"Transportation Planning and Technology"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0948-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0948-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0948-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:08:08Z","timestamp":1559153288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0948-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,26]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["948"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0948-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,26]]}}}