{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T02:56:23Z","timestamp":1768532183468,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T00:00:00Z","timestamp":1666828800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T00:00:00Z","timestamp":1666828800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s00500-022-07577-9","type":"journal-article","created":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T17:06:42Z","timestamp":1666890402000},"page":"2853-2872","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An enhanced heuristic for the team orienteering problem with time windows considering multiple deliverymen"],"prefix":"10.1007","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0255-1805","authenticated-orcid":false,"given":"Xinxin","family":"Su","sequence":"first","affiliation":[]},{"given":"Huang","family":"Nan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,27]]},"reference":[{"key":"7577_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.02.001","volume":"83","author":"A Alvarez","year":"2017","unstructured":"Alvarez A, Munari P (2017) An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen. Comput Oper Res 83:1\u201312. https:\/\/doi.org\/10.1016\/j.cor.2017.02.001","journal-title":"Comput Oper Res"},{"key":"7577_CR2","doi-asserted-by":"publisher","first-page":"1785","DOI":"10.1111\/itor.12547","volume":"25","author":"A Alvarez","year":"2018","unstructured":"Alvarez A, Munari P, Morabito R (2018) Iterated local search and simulated annealing algorithms for the inventory routing problem. Int Trans Oper Res 25:1785\u20131809. https:\/\/doi.org\/10.1111\/itor.12547","journal-title":"Int Trans Oper Res"},{"key":"7577_CR3","doi-asserted-by":"publisher","first-page":"e0201868","DOI":"10.1371\/journal.pone.0201868","volume":"13","author":"GE Anaya Fuentes","year":"2018","unstructured":"Anaya Fuentes GE, Hern\u00e1ndez Gress ES, Mora Seck Tuoh JC, Medina Mar\u00edn J (2018) Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic. PLoS ONE 13:e0201868","journal-title":"PLoS ONE"},{"key":"7577_CR4","doi-asserted-by":"crossref","unstructured":"Aringhieri R, Bigharaz S, Duma D, Guastalla A (2022) Novel applications of the team orienteering problem in health care logistics. In: Optimization in artificial intelligence and data sciences. Springer, pp 235\u2013245","DOI":"10.1007\/978-3-030-95380-5_21"},{"key":"7577_CR5","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.ejor.2020.01.008","volume":"284","author":"J Brand\u00e3o","year":"2020","unstructured":"Brand\u00e3o J (2020) A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem. Eur J Oper Res 284:559\u2013571. https:\/\/doi.org\/10.1016\/j.ejor.2020.01.008","journal-title":"Eur J Oper Res"},{"key":"7577_CR6","first-page":"1168","volume":"21","author":"GS de Grancy","year":"2015","unstructured":"de Grancy GS (2015) An adaptive metaheuristic for vehicle routing problems with time windows and multiple service workers. J UCS 21:1168\u20131192","journal-title":"J UCS"},{"issue":"105062","key":"7577_CR7","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.cor.2020.105062","volume":"124","author":"J De La Vega","year":"2020","unstructured":"De La Vega J, Munari P, Morabito R (2020) Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen. Comput Oper Res 124(105062):20. https:\/\/doi.org\/10.1016\/j.cor.2020.105062","journal-title":"Comput Oper Res"},{"key":"7577_CR8","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover F (1977) Heuristics for integer programming using surrogate constraints. Decis Sci 8:156\u2013166","journal-title":"Decis Sci"},{"key":"7577_CR9","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/j.ejor.2019.05.010","volume":"278","author":"D Goeke","year":"2019","unstructured":"Goeke D (2019) Granular tabu search for the pickup and delivery problem with time windows and electric vehicles. Eur J Oper Res 278:821\u2013836. https:\/\/doi.org\/10.1016\/j.ejor.2019.05.010","journal-title":"Eur J Oper Res"},{"key":"7577_CR10","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.asoc.2018.08.035","volume":"73","author":"J Guan","year":"2018","unstructured":"Guan J, Lin G, Feng HB (2018) A multi-start iterated local search algorithm for the uncapacitated single allocation hub location problem. Appl Soft Comput 73:230\u2013241","journal-title":"Appl Soft Comput"},{"key":"7577_CR11","doi-asserted-by":"publisher","first-page":"1148","DOI":"10.1080\/0305215X.2017.1417398","volume":"50","author":"A Gunawan","year":"2018","unstructured":"Gunawan A, Ng KM, Kendall G, Lai J (2018) An iterated local search algorithm for the team orienteering problem with variable profits. Eng Optim 50:1148\u20131163. https:\/\/doi.org\/10.1080\/0305215X.2017.1417398","journal-title":"Eng Optim"},{"key":"7577_CR12","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.ejor.2013.06.011","volume":"232","author":"Q Hu","year":"2014","unstructured":"Hu Q, Lim A (2014) An iterative three-component heuristic for the team orienteering problem with time windows. Eur J Oper Res 232:276\u2013286","journal-title":"Eur J Oper Res"},{"key":"7577_CR13","doi-asserted-by":"crossref","unstructured":"Jackson J, Mei Y (2020) Genetic programming hyper-heuristic with cluster awareness for stochastic team orienteering problem with time windows. In: 2020 IEEE congress on evolutionary computation (CEC). IEEE, pp 1\u20138","DOI":"10.1109\/CEC48606.2020.9185911"},{"key":"7577_CR14","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.ejor.2021.12.019","volume":"302","author":"M Li","year":"2022","unstructured":"Li M, Hao JK, Wu Q (2022) Learning-driven feasible and infeasible tabu search for airport gate assignment. Eur J Oper Res 302:172\u2013186. https:\/\/doi.org\/10.1016\/j.ejor.2021.12.019","journal-title":"Eur J Oper Res"},{"key":"7577_CR15","doi-asserted-by":"publisher","first-page":"1108","DOI":"10.1016\/j.ejor.2021.02.024","volume":"294","author":"VR M\u00e1ximo","year":"2021","unstructured":"M\u00e1ximo VR, Nascimento MCV (2021) A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem. Eur J Oper Res 294:1108\u20131119. https:\/\/doi.org\/10.1016\/j.ejor.2021.02.024","journal-title":"Eur J Oper Res"},{"key":"7577_CR16","doi-asserted-by":"crossref","unstructured":"Munari P, Morabito R (2018) A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen. Top 26:437\u2013464","DOI":"10.1007\/s11750-018-0481-8"},{"key":"7577_CR17","doi-asserted-by":"publisher","unstructured":"Pureza V, Morabito R, Reimann M (2012) Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW. Eur J Oper Res 218:636\u2013647. https:\/\/doi.org\/10.1016\/j.ejor.2011.12.005","DOI":"10.1016\/j.ejor.2011.12.005"},{"key":"7577_CR18","doi-asserted-by":"publisher","first-page":"107776","DOI":"10.1016\/j.cie.2021.107776","volume":"162","author":"J Ruiz-Meza","year":"2021","unstructured":"Ruiz-Meza J, Brito J, Montoya-Torres JR (2021) A grasp to solve the multi-constraints multi-modal team orienteering problem with time windows for groups with heterogeneous preferences. Comput Ind Eng 162:107776","journal-title":"Comput Ind Eng"},{"key":"7577_CR19","doi-asserted-by":"publisher","first-page":"106700","DOI":"10.1016\/j.asoc.2020.106700","volume":"96","author":"S Saeedvand","year":"2020","unstructured":"Saeedvand S, Aghdasi HS, Baltes J (2020) Novel hybrid algorithm for team orienteering problem with time windows for rescue applications. Appl Soft Comput 96:106700","journal-title":"Appl Soft Comput"},{"key":"7577_CR20","unstructured":"Sluijk N, Visser TR, Spliet R, (2016) Implementation of the iterative three-component heuristic for the team orienteering problem with time windows"},{"key":"7577_CR21","doi-asserted-by":"publisher","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:254\u2013265. https:\/\/doi.org\/10.1287\/opre.35.2.254","journal-title":"Oper Res"},{"key":"7577_CR22","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.cor.2021.105229","volume":"129","author":"MM Sousa","year":"2021","unstructured":"Sousa MM, Gonz\u00e1lez PH, Ochi LS, Martins SdL (2021) A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection. Comput Oper Res 129:16. https:\/\/doi.org\/10.1016\/j.cor.2021.105229","journal-title":"Comput Oper Res"},{"key":"7577_CR23","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.ins.2018.07.037","volume":"466","author":"W Sun","year":"2018","unstructured":"Sun W, Hao JK, Lai X, Wu Q (2018) Adaptive feasible and infeasible tabu search for weighted vertex coloring. Inform Sci 466:203\u2013219. https:\/\/doi.org\/10.1016\/j.ins.2018.07.037","journal-title":"Inform Sci"},{"key":"7577_CR24","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.cie.2018.11.044","volume":"127","author":"FY Vincent","year":"2019","unstructured":"Vincent FY, Jewpanya P, Lin SW, Redi AP (2019) Team orienteering problem with time windows and time-dependent scores. Comput Ind Eng 127:213\u2013224","journal-title":"Comput Ind Eng"},{"key":"7577_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2018.01.012","volume":"71","author":"W Wang","year":"2018","unstructured":"Wang W, Hao JK, Wu Q (2018) Tabu search with feasible and infeasible searches for equitable coloring. Eng Appl Artif Intell 71:1\u201314","journal-title":"Eng Appl Artif Intell"},{"key":"7577_CR26","doi-asserted-by":"publisher","first-page":"63403","DOI":"10.1109\/ACCESS.2019.2917089","volume":"7","author":"J Wang","year":"2019","unstructured":"Wang J, Guo J, Chen J, Tian S, Gu T (2019) Uncertain team orienteering problem with time windows based on uncertainty theory. IEEE Access 7:63403\u201363414","journal-title":"IEEE Access"},{"key":"7577_CR27","doi-asserted-by":"publisher","first-page":"e0195457","DOI":"10.1371\/journal.pone.0195457","volume":"13","author":"Y Xia","year":"2018","unstructured":"Xia Y, Fu Z, Pan L, Duan F (2018) Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order. PLoS ONE 13:e0195457","journal-title":"PLoS ONE"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07577-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07577-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07577-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,25]],"date-time":"2023-02-25T13:15:30Z","timestamp":1677330930000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07577-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,27]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["7577"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07577-9","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,27]]},"assertion":[{"value":"1 October 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}