{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:45:56Z","timestamp":1761648356227,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,4,4]],"date-time":"2016-04-04T00:00:00Z","timestamp":1459728000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["61272003"],"award-info":[{"award-number":["61272003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10878-016-0015-y","type":"journal-article","created":{"date-parts":[[2016,4,4]],"date-time":"2016-04-04T08:20:20Z","timestamp":1459758020000},"page":"492-512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Tabu search for the real-world carpooling problem"],"prefix":"10.1007","volume":"32","author":[{"given":"Can","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Defu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yain-Whar","family":"Si","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen C. H.","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,4]]},"reference":[{"issue":"5","key":"15_CR1","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1016\/j.cor.2004.09.035","volume":"33","author":"F Aykut \u00d6zsoy","year":"2006","unstructured":"Aykut \u00d6zsoy F, Pinar M (2006) An exact algorithm for the capacitated vertex p-center problem. Comput Oper Res 33(5):1420\u20131436","journal-title":"Comput Oper Res"},{"issue":"3","key":"15_CR2","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 Lagrangean column generation. Oper Res 52(3):422\u2013439","journal-title":"Oper Res"},{"issue":"3","key":"15_CR3","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MVT.2008.927485","volume":"3","author":"R Barrero","year":"2008","unstructured":"Barrero R, Van Mierlo J, Tackoen X (2008) Energy savings in public transport. Veh Technol Mag IEEE 3(3):26\u201336","journal-title":"Veh Technol Mag IEEE"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Boukhater CM, Dakroub O, Lahoud F, Awad M (2014) An intelligent and fair GA carpooling scheduler as a social solution for greener transportation. 17th IEEE Mediterranean Electrotechnical Conference (MELECON), IEEE 2014:182\u2013186","DOI":"10.1109\/MELCON.2014.6820528"},{"issue":"2","key":"15_CR5","first-page":"89","volume":"1","author":"JF Cordeau","year":"2003","unstructured":"Cordeau JF, Laporte G (2003) The dial-a-ride problem (DARP): variants, modeling issues and algorithms. Q J Belg Fr Ital Oper Res Soc 1(2):89\u2013101","journal-title":"Q J Belg Fr Ital Oper Res Soc"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Dakroub O, Boukhater CM, Lahoud F, Awad M (2013) An intelligent carpooling app for a green social solution to traffic and parking congestions. 2013 16th international IEEE conference on intelligent transportation systems\u2014(ITSC), Date\u00a06\u20139","DOI":"10.1109\/ITSC.2013.6728586"},{"key":"15_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10732-014-9247-0","volume":"20","author":"JW Escobar","year":"2014","unstructured":"Escobar JW, Linfati R, Toth P, Baldoquin MG (2014) A hybrid granular Tabu search algorithm for the multi-depot vehicle routing problem. J Heuristics 20:1\u201327","journal-title":"J Heuristics"},{"issue":"2","key":"15_CR8","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1147\/rd.272.0133","volume":"27","author":"R Fagin","year":"1983","unstructured":"Fagin R, Williams JH (1983) A fair carpool scheduling algorithm. IBM J Res Dev 27(2):133\u2013139","journal-title":"IBM J Res Dev"},{"issue":"2","key":"15_CR9","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.ejor.2012.10.022","volume":"225","author":"Z Fu","year":"2013","unstructured":"Fu Z, Huang W, L\u00fc Z (2013) Iterated tabu search for the circular open dimension problem. Eur J Oper Res 225(2):236\u2013243","journal-title":"Eur J Oper Res"},{"issue":"2","key":"15_CR10","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S0377-2217(97)00289-0","volume":"106","author":"M Gendreau","year":"1998","unstructured":"Gendreau M, Laporte G, Semet F (1998) A tabu search heuristic for the undirected selective travelling salesman problem. Eur J Oper Res 106(2):539\u2013545","journal-title":"Eur J Oper Res"},{"issue":"1","key":"15_CR11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10852-012-9175-7","volume":"12","author":"Y Guo","year":"2013","unstructured":"Guo Y, Goncalves G, Hsu T (2013a) A multi-agent based self-adaptive genetic algorithm for the long-term car pooling problem. J Math Model Algorithm Oper Res 12(1):45\u201366","journal-title":"J Math Model Algorithm Oper Res"},{"issue":"04","key":"15_CR12","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1051\/ro\/2013049","volume":"47","author":"Y Guo","year":"2013","unstructured":"Guo Y, Goncalves G, Hsu T (2013b) A multi-destination daily carpooling problem and an ant colony based resolution method. RAIRO-Oper Res 47(04):399\u2013428","journal-title":"RAIRO-Oper Res"},{"key":"15_CR13","unstructured":"Hartwig S, Buchmann M (2006) Empty seats traveling: next-generation ridesharing and its potential to mitigate traffic-and emission problems in the 21st century"},{"key":"15_CR14","volume-title":"Empty Seats Traveling","author":"S Hartwig","year":"2007","unstructured":"Hartwig S, Buchmann M (2007) Empty Seats Traveling. Nokia Research Center, Bochum"},{"issue":"1","key":"15_CR15","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1109\/TITS.2014.2334597","volume":"16","author":"SC Huang","year":"2015","unstructured":"Huang SC, Jiau MK, Lin CH (2015) A genetic-algorithm-based approach to solve carpool service problems in cloud computing. IEEE Trans Intell Transp Syst 16(1):352\u2013364","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"5","key":"15_CR16","doi-asserted-by":"crossref","first-page":"1698","DOI":"10.1109\/TFUZZ.2014.2374194","volume":"23","author":"SC Huang","year":"2014","unstructured":"Huang SC, Jiau MK, Lin CH (2014) Optimization of the carpool service problem via a fuzzy controlled genetic algorithm. IEEE Trans Fuzzy Syst 23(5):1698\u20131712","journal-title":"IEEE Trans Fuzzy Syst"},{"issue":"3","key":"15_CR17","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/BF02947312","volume":"17","author":"W Huang","year":"2002","unstructured":"Huang W, Zhang D, Wang H (2002) An algorithm based on tabu search for satisfiability problem. J Comput Sci Technol 17(3):340\u2013346","journal-title":"J Comput Sci Technol"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Hartman IB, Keren D, Dbai AA, Cohen E, Knapen L, Yasar A, Janssens D (2014) Theory and practice in large carpooling problems. The 5th international conference on ambient systems, networks and technologies (ANT-2014). Procedia Computer Science 32:339\u2013347","DOI":"10.1016\/j.procs.2014.05.433"},{"key":"15_CR19","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1016\/j.jcss.2014.11.010","volume":"81","author":"L Knapen","year":"2015","unstructured":"Knapen L, Hartman IB, Keren D, Yasar A, Cho S, Bellemans T, Janssens D, Wets G (2015) Scalability issues in optimal assignment for carpooling. J Comput Syst Sci 81:568\u2013584","journal-title":"J Comput Syst Sci"},{"key":"15_CR20","volume-title":"An ANTS heuristic for the long-term car pooling problem\/\/new optimization techniques in engineering","author":"V Maniezzo","year":"2004","unstructured":"Maniezzo V, Carbonaro A, Hildmann H (2004) An ANTS heuristic for the long-term car pooling problem\/\/new optimization techniques in engineering. Springer, Berlin"},{"key":"15_CR21","unstructured":"Mingozzi A, Baldacci R, Maniezzo V (2000) Lagrangean column generation for the car pooling problem. Technical Report WP-CO0002, University of Bologna, S.I., Cesena, Italy"},{"issue":"4","key":"15_CR22","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1109\/TITS.2012.2208222","volume":"13","author":"BT Morris","year":"2012","unstructured":"Morris BT, Tran C, Scora G, Trivedi MM (2012) Real-time video-based traffic measurement and visualization system for energy\/emissions. IEEE Trans Intell Transp Syst 13(4):1667\u20131678","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"15_CR23","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 JF, Laporte G, Marta MB, Pascoal MB (2013) Combining multicriteria analysis and tabu search for dial-a-ride problems. Transp Res Part B 52:1\u201316","journal-title":"Transp Res Part B"},{"issue":"1","key":"15_CR24","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/j.cor.2012.08.004","volume":"40","author":"SN Parragh","year":"2013","unstructured":"Parragh SN, Schmid V (2013) Hybrid column generation and large neighborhood search for the dial-a-ride problem. Comput Oper Res 40(1):490\u2013497","journal-title":"Comput Oper Res"},{"key":"15_CR25","first-page":"1","volume":"5","author":"U Ritzinger","year":"2014","unstructured":"Ritzinger U, Puchinger J, Hartl RF (2014) Dynamic programming based metaheuristics for the dial-a-ride problem. Ann Oper Res 5:1\u201318","journal-title":"Ann Oper Res"},{"key":"15_CR26","unstructured":"Sghaier M, Zgaya H, Hammadi S, Tahon C (2010) A distributed dijkstra\u2019s algorithm for the implementation of a Real Time Carpooling Service with an optimized aspect on siblings\/\/Intelligent Transportation Systems (ITSC), 2010 13th international IEEE conference on. IEEE, 795\u2013800"},{"issue":"2","key":"15_CR27","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265","journal-title":"Oper Res"},{"key":"15_CR28","unstructured":"Son TA, Le THA, Arnould G, Khadraoui D, Tao PD (2011) Solving car pooling problem using DCA. Global information infrastructure symposium (GIIS), IEEE, 1\u20136"},{"key":"15_CR29","unstructured":"Son TA, Tao PD, Khadraoui D (2012) A distributed algorithm solving multiobjective dynamic carpooling problem. 2012 International conference on computer & information science (ICCIS), IEEE, 1:231\u2013236"},{"issue":"2","key":"15_CR30","doi-asserted-by":"crossref","first-page":"914","DOI":"10.1109\/TITS.2012.2186127","volume":"13","author":"F Terroso-Saenz","year":"2012","unstructured":"Terroso-Saenz F, Valdes-Vela M, Sotomayor-Martinez C, Toledo-Moreo R, G\u00f3mez-Skarmeta AF (2012) A cooperative approach to traffic congestion detection with complex event processing and VANET. IEEE Trans Intell Transp Syst 13(2):914\u2013929","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"6","key":"15_CR31","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MIS.2003.1249163","volume":"18","author":"FY Wang","year":"2003","unstructured":"Wang FY, Tang S, Sui Y, Wang X (2003) Toward intelligent transportation systems for the 2008 Olympics. IEEE Intell Syst 18(6):8\u201311","journal-title":"IEEE Intell Syst"},{"issue":"4","key":"15_CR32","doi-asserted-by":"crossref","first-page":"1362","DOI":"10.1109\/TITS.2011.2158209","volume":"12","author":"S Yan","year":"2011","unstructured":"Yan S, Chen CY, Lin YF (2011) A model with a heuristic algorithm for solving the long-term many-to-many carpooling problem. IEEE Trans Intell Transp Syst 12(4):1362\u20131373","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"3","key":"15_CR33","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1016\/j.ejor.2007.05.058","volume":"195","author":"EE Zachariadis","year":"2009","unstructured":"Zachariadis EE, Tarantilis CD, Kiranoudis CT (2009) A guided tabu search for the vehicle routing problem with two-dimensional oading constraints. Eur J Oper Res 195(3):729\u2013743","journal-title":"Eur J Oper Res"},{"issue":"2","key":"15_CR34","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.ejor.2013.02.056","volume":"229","author":"EE Zachariadis","year":"2013","unstructured":"Zachariadis EE, Tarantilis CD, Kiranoudis CT (2013) Designing vehicle routes for a mix of different request types, under time windows and loading constraints. Eur J Oper Res 229(2):303\u2013317","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0015-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0015-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0015-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T03:12:41Z","timestamp":1567739561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0015-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,4]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["15"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0015-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2016,4,4]]}}}