{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T14:48:22Z","timestamp":1770648502559,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"20","license":[{"start":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T00:00:00Z","timestamp":1587945600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T00:00:00Z","timestamp":1587945600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61806090"],"award-info":[{"award-number":["61806090"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672478"],"award-info":[{"award-number":["61672478"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2021,8]]},"DOI":"10.1007\/s11042-020-08894-7","type":"journal-article","created":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T05:02:20Z","timestamp":1587963740000},"page":"30775-30787","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A heuristic repair method for dial-a-ride problem in intracity logistic based on neighborhood shrinking"],"prefix":"10.1007","volume":"80","author":[{"given":"Minshi","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxun","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengcai","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,27]]},"reference":[{"key":"8894_CR1","first-page":"53","volume":"837","author":"G Acampora","year":"2020","unstructured":"Acampora G, Vitiello A (2020) A Study on Local Search Meta-heuristics for Ontology Alignment. Computational Intelligence for Semantic Knowledge Management - New Perspectives for Designing and Organizing Information Systems 837:53\u201370","journal-title":"Computational Intelligence for Semantic Knowledge Management - New Perspectives for Designing and Organizing Information Systems"},{"issue":"3","key":"8894_CR2","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1137\/S0097539702416402","volume":"33","author":"V Arya","year":"2004","unstructured":"Arya V, Garg N, Khandekar R, Meyerson A, Munagala K, Pandit V (2004) Local search heuristics for k-median and facility location problems. SIAM J Comput 33(3):544\u2013562","journal-title":"SIAM J Comput"},{"issue":"2","key":"8894_CR3","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/j.ejor.2018.06.042","volume":"272","author":"NF Bagger","year":"2019","unstructured":"Bagger NF, S\u00f8rensen M, Stidsen TR (2019) Dantzig-wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling. European Journal of Operational Research 272(2):430\u2013446","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"8894_CR4","first-page":"266","volume":"12","author":"RH Bartels","year":"1969","unstructured":"Bartels RH, Golub GH (1969) The simplex method of linear programming using LU decomposition. CommunA\u0307CM 12(5):266\u2013268","journal-title":"CommunA\u0307CM"},{"issue":"2","key":"8894_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.3390\/a12020039","volume":"12","author":"S Belhaiza","year":"2019","unstructured":"Belhaiza S (2019) A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem. Algorithms 12(2):39","journal-title":"Algorithms"},{"issue":"4","key":"8894_CR6","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0305-0548(99)00101-X","volume":"28","author":"AV Breedam","year":"2001","unstructured":"Breedam AV (2001) Comparing descent heuristics and metaheuristics for the vehicle routing problem. Computers & Operations Research 28(4):289\u2013315","journal-title":"Computers & Operations Research"},{"issue":"6","key":"8894_CR7","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/S0191-2615(02)00045-0","volume":"37","author":"JF Cordeau","year":"2003","unstructured":"Cordeau JF (2003) Laporte, g.: a tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B:, Methodological 37(6):579\u2013594","journal-title":"Transportation Research Part B:, Methodological"},{"issue":"3","key":"8894_CR8","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"JF Cordeau","year":"2006","unstructured":"Cordeau JF (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper Res 54(3):573\u2013586","journal-title":"Oper Res"},{"key":"8894_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"JF Cordeau","year":"2007","unstructured":"Cordeau JF, Laporte G (2007) The dial-a-ride problem (darp): Models and algorithms. Annals OR 153:29\u201346","journal-title":"Annals OR"},{"issue":"10","key":"8894_CR10","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1016\/j.cor.2010.12.014","volume":"38","author":"T Garaix","year":"2011","unstructured":"Garaix T, Artigues C, Feillet D, Josselin D (2011) Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation. Computers & Operations Research 38(10):1435\u20131442","journal-title":"Computers & Operations Research"},{"issue":"10","key":"8894_CR11","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 (1995) A new extension of local search applied to the dial-a-ride problem. Eur J Oper Res 83(10):83\u2013104","journal-title":"Eur J Oper Res"},{"key":"8894_CR12","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/s00291-009-0175-6","volume":"33","author":"S Ho","year":"2011","unstructured":"Ho S, Haugland D (2011) Local search heuristics for the probabilistic dial-a-ride problem. OR Spectrum 33:961\u2013988","journal-title":"OR Spectrum"},{"key":"8894_CR13","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.trb.2018.02.001","volume":"111","author":"SC Ho","year":"2018","unstructured":"Ho SC, Szeto W, Kuo YH, Leung JM, Petering M, Tou TW (2018) A survey of dial-a-ride problems: Literature review and recent developments. Transportation Research Part B:, Methodological 111:395\u2013421","journal-title":"Transportation Research Part B:, Methodological"},{"issue":"4","key":"8894_CR14","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler EL, Wood DE (1966) Branch-and-bound methods: a survey. Oper Res 14(4):699\u2013719","journal-title":"Oper Res"},{"issue":"6","key":"8894_CR15","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1016\/j.cor.2009.10.003","volume":"37","author":"SN Parragh","year":"2010","unstructured":"Parragh SN, Doerner KF (2010) Hartl, R.F.: Variable neighborhood search for the dial-a-ride problem. Computers & Operations Research 37(6):1129\u20131138","journal-title":"Computers & Operations Research"},{"issue":"2","key":"8894_CR16","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/trsc.14.2.130","volume":"14","author":"HN Psaraftis","year":"1980","unstructured":"Psaraftis HN (1980) A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transp Sci 14(2):130\u2013154","journal-title":"Transp Sci"},{"issue":"11","key":"8894_CR17","doi-asserted-by":"publisher","first-page":"3928","DOI":"10.1109\/TCYB.2016.2590558","volume":"47","author":"K Tang","year":"2017","unstructured":"Tang K, Wang J, Li X, Yao X (2017) A scalable approach to capacitated arc routing problems based on hierarchical decomposition. IEEE Trans. Cybernetics 47 (11):3928\u20133940","journal-title":"IEEE Trans. Cybernetics"},{"key":"8894_CR18","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.tcs.2018.06.006","volume":"745","author":"D Watel","year":"2018","unstructured":"Watel D, Faye A (2018) Taxi-sharing, Parameterized complexity and approximability of the dial-a-ride problem with money as an incentive. Theor. Comput. Sci. 745:202\u2013223","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"8894_CR19","doi-asserted-by":"publisher","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. Eur J Oper Res 174(2):1117\u20131139","journal-title":"Eur J Oper Res"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-020-08894-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-020-08894-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-020-08894-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,15]],"date-time":"2021-09-15T05:17:03Z","timestamp":1631683023000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-020-08894-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,27]]},"references-count":19,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2021,8]]}},"alternative-id":["8894"],"URL":"https:\/\/doi.org\/10.1007\/s11042-020-08894-7","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,27]]},"assertion":[{"value":"2 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}