{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T01:13:04Z","timestamp":1775092384085,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,4,6]],"date-time":"2012-04-06T00:00:00Z","timestamp":1333670400000},"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":[[2013,3]]},"DOI":"10.1007\/s10479-012-1118-1","type":"journal-article","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T10:35:21Z","timestamp":1333622121000},"page":"351-370","source":"Crossref","is-referenced-by-count":19,"title":["Data mining-based dispatching system for solving the local pickup and delivery problem"],"prefix":"10.1007","volume":"203","author":[{"given":"Weiwei","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leyuan","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Pi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,6]]},"reference":[{"issue":"1","key":"1118_CR1","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O. Br\u00e4sy","year":"2005","unstructured":"Br\u00e4sy, O., & Gendreau, M. (2005a). Vehicle routing problem with time windows, part\u00a0I: route construction and local search algorithms. Transportation Science, 39(1), 104\u2013118.","journal-title":"Transportation Science"},{"issue":"1","key":"1118_CR2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O. Br\u00e4sy","year":"2005","unstructured":"Br\u00e4sy, O., & Gendreau, M. (2005b). Vehicle routing problem with time windows, part\u00a0II: metaheuristics. Transportation Science, 39(1), 119\u2013139.","journal-title":"Transportation Science"},{"key":"1118_CR3","volume-title":"Classification and regression trees","author":"L. Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J., Stone, C. J., & Olshen, R. (1984). Classification and regression trees. Belmont: Wadsworth."},{"issue":"3","key":"1118_CR4","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1287\/trsc.1030.0046","volume":"38","author":"A. M. Campbell","year":"2004","unstructured":"Campbell, A. M., & Savelsbergh, M. (2004). Efficient insertion heuristics for vehicle routing and scheduling problems. Transportation Science, 38(3), 369\u2013378.","journal-title":"Transportation Science"},{"issue":"4","key":"1118_CR5","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1198\/106186004X13064","volume":"13","author":"K. Y. Chan","year":"2004","unstructured":"Chan, K. Y., & Loh, W. Y. (2004). Lotus: an algorithm for building accurate and comprehensible logistic regression trees. Journal of Computational and Graphical Statistics, 13(4), 826\u2013852.","journal-title":"Journal of Computational and Graphical Statistics"},{"issue":"2","key":"1118_CR6","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(86)90243-2","volume":"23","author":"J. Desrosiers","year":"1986","unstructured":"Desrosiers, J., Soumis, F., Desrochers, M., & Sauv\u00e9Gerad, M. (1986). Methods for routing with time windows. European Journal of Operational Research, 23(2), 236\u2013245.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1118_CR7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","volume":"54","author":"Y. Dumas","year":"1991","unstructured":"Dumas, Y., Desrosiers, J., & Soumis, F. (1991). The pickup and delivery problem with time windows. European Journal of Operational Research, 54(1), 7\u201322.","journal-title":"European Journal of Operational Research"},{"key":"1118_CR8","doi-asserted-by":"crossref","first-page":"1409","DOI":"10.1016\/j.addr.2006.09.005","volume":"58","author":"S. Ekins","year":"2006","unstructured":"Ekins, S., Shimada, J., & Chang, C. (2006). Application of data mining approaches to drug delivery. Advanced Drug Delivery Reviews, 58, 1409\u20131430.","journal-title":"Advanced Drug Delivery Reviews"},{"issue":"3","key":"1118_CR9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1111\/j.1475-3995.2000.tb00196.x","volume":"7","author":"K. Fagerholt","year":"2000","unstructured":"Fagerholt, K., & Christiansen, M. (2000). A travelling salesman problem with allocation, time window and precedence constraints\u2014an application to ship scheduling. International Transactions in Operational Research, 7(3), 231\u2013244.","journal-title":"International Transactions in Operational Research"},{"issue":"4","key":"1118_CR10","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10732-005-1997-2","volume":"11","author":"B. Funke","year":"2005","unstructured":"Funke, B., Grunert, T., & Irnich, S. (2005). Local search for vehicle routing and scheduling problems: review and conceptual integration. Journal of Heuristics, 11(4), 267\u2013306.","journal-title":"Journal of Heuristics"},{"key":"1118_CR11","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1018955328719","volume":"75","author":"C. W. Holsapple","year":"1997","unstructured":"Holsapple, C. W., Lee, A., & Otto, J. (1997). A machine learning method for multi-expert decision support. Annals of Operations Research, 75, 171\u2013188.","journal-title":"Annals of Operations Research"},{"key":"1118_CR12","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s10951-005-4781-0","volume":"8","author":"X. Li","year":"2005","unstructured":"Li, X., & \u00d3lafsson, S. (2005). Discovering dispatching rules using data mining. Journal of Scheduling, 8, 515\u2013527.","journal-title":"Journal of Scheduling"},{"issue":"4","key":"1118_CR13","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1109\/TASE.2005.853472","volume":"2","author":"A. Lim","year":"2005","unstructured":"Lim, A., & Wang, F. (2005). Multi-depot vehicle routing problem: a one-stage approach. IEEE Transactions on Automation Science and Engineering, 2(4), 397\u2013402.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"1","key":"1118_CR14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/trsc.1050.0123","volume":"40","author":"A. Lim","year":"2006","unstructured":"Lim, A., Wang, F., & Xu, Z. (2006). A transportation problem with minimum quantity commitment. Transportation Science, 40(1), 117\u2013129.","journal-title":"Transportation Science"},{"key":"1118_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5725-8","volume-title":"Feature extraction, construction and selection: a data mining perspective","author":"H. Liu","year":"1998","unstructured":"Liu, H., & Motoda, H. (1998). Feature extraction, construction and selection: a data mining perspective. Norwell: Kluwer Academic."},{"key":"1118_CR16","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1006\/cbmr.1993.1005","volume":"26","author":"W. J. Long","year":"1993","unstructured":"Long, W. J., Griffith, J. L., & Selker, H. P. (1993). A comparison of logistic regression to decision-tree induction in a medical domain. Computers and Biomedical Research, 26, 74\u201397.","journal-title":"Computers and Biomedical Research"},{"issue":"1","key":"1118_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S1469026803000835","volume":"3","author":"G. Mourkousis","year":"2003","unstructured":"Mourkousis, G., Protonotarios, M., & Varvarigou, T. (2003). Application of genetic algorithms to a large-scale multiple-constraint vehicle routing problem. International Journal of Computational Intelligence and Applications, 3(1), 1\u201321.","journal-title":"International Journal of Computational Intelligence and Applications"},{"issue":"2","key":"1118_CR18","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","volume":"34","author":"W. P. Nanry","year":"2000","unstructured":"Nanry, W. P., & Barnes, J. W. (2000). Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research. Part B, 34(2), 107\u2013121.","journal-title":"Transportation Research. Part B"},{"issue":"4","key":"1118_CR19","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1109\/TASE.2008.916761","volume":"5","author":"L. Pi","year":"2008","unstructured":"Pi, L., Pan, Y., & Shi, L. (2008). Hybrid nested partitions and mathematical programming approach and its applications. IEEE Transactions on Automation Science and Engineering, 5(4), 573\u2013586.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"1118_CR20","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1023\/A:1018902200919","volume":"78","author":"S. Piramuthu","year":"1998","unstructured":"Piramuthu, S., Raman, N., & Shaw, M. J. (1998). Decision support system for scheduling a flexible flow system: incorporation of feature construction. Annals of Operations Research, 78, 219\u2013234.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"1118_CR21","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1287\/trsc.32.2.90","volume":"32","author":"W. B. Powell","year":"1998","unstructured":"Powell, W. B., & Carvalho, T. (1998). Dynamic control of logistics queueing networks for large scale fleet management. Transportation Science, 32(2), 90\u2013109.","journal-title":"Transportation Science"},{"issue":"2","key":"1118_CR22","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1287\/trsc.36.2.231.561","volume":"36","author":"W. B. Powell","year":"2002","unstructured":"Powell, W. B., Shapiro, J., & Simao, H. P. (2002). An adaptive, dynamic programming algorithm for the heterogeneous resource allocation problem. Transportation Science, 36(2), 231\u2013249.","journal-title":"Transportation Science"},{"issue":"1","key":"1118_CR23","first-page":"81","volume":"1","author":"J. R. Quinlan","year":"1986","unstructured":"Quinlan, J. R. (1986). Induction of decision tree. Machine Learning, 1(1), 81\u2013106.","journal-title":"Machine Learning"},{"issue":"2","key":"1118_CR24","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1080\/07408179208964213","volume":"24","author":"M. J. Shaw","year":"1992","unstructured":"Shaw, M. J., Park, S. C., & Raman, N. (1992). Intelligent scheduling with machine learning capabilities: the induction of scheduling knowledge. IIE Transactions, 24(2), 156\u2013168.","journal-title":"IIE Transactions"},{"issue":"3","key":"1118_CR25","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1287\/opre.48.3.390.12436","volume":"48","author":"L. Shi","year":"2000","unstructured":"Shi, L., & \u00d3lafsson, S. (2000). Nested partitions method for global optimization. Operations Research, 48(3), 390\u2013407.","journal-title":"Operations Research"},{"key":"1118_CR26","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/S0965-8564(00)00037-9","volume":"36","author":"X. Wang","year":"2002","unstructured":"Wang, X., & Regan, A. C. (2002). Local truckload pickup and delivery with hard time window constraints. Transportation Research. Part B, 36, 78\u201394.","journal-title":"Transportation Research. Part B"},{"key":"1118_CR27","volume-title":"Data mining: practical machine learning tools and techniques","author":"I. H. Witten","year":"2005","unstructured":"Witten, I. H., & Frank, E. (2005). Data mining: practical machine learning tools and techniques (second ed.). San Mateo: Morgan Kaufmann.","edition":"2"},{"issue":"3","key":"1118_CR28","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/trsc.37.3.347.16044","volume":"37","author":"H. Xu","year":"2001","unstructured":"Xu, H., Chen, Z. L., Rajagopal, S., & Arunapuram, S. (2001). Solving a practical pickup and delivery problem. Transportation Science, 37(3), 347\u2013364.","journal-title":"Transportation Science"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1118-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1118-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1118-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:34Z","timestamp":1559153374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1118-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,6]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["1118"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1118-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,6]]}}}