{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T06:05:33Z","timestamp":1774764333458,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2019,10,19]],"date-time":"2019-10-19T00:00:00Z","timestamp":1571443200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,19]],"date-time":"2019-10-19T00:00:00Z","timestamp":1571443200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00500-019-04438-w","type":"journal-article","created":{"date-parts":[[2019,10,19]],"date-time":"2019-10-19T16:14:56Z","timestamp":1571501696000},"page":"9071-9089","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Distance related: a procedure for applying directly Artificial Bee Colony algorithm in routing problems"],"prefix":"10.1007","volume":"24","author":[{"given":"Dimitra","family":"Trachanatzi","sequence":"first","affiliation":[]},{"given":"Manousos","family":"Rigakis","sequence":"additional","affiliation":[]},{"given":"Magdalene","family":"Marinaki","sequence":"additional","affiliation":[]},{"given":"Yannis","family":"Marinakis","sequence":"additional","affiliation":[]},{"given":"Nikolaos","family":"Matsatsinis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,19]]},"reference":[{"issue":"1","key":"4438_CR1","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1186\/s40064-016-2940-8","volume":"5","author":"M Alzaqebah","year":"2016","unstructured":"Alzaqebah M, Abdullah S, Jawarneh S (2016) Modified artificial bee colony for the vehicle routing problems with time windows. SpringerPlus 5(1):1298","journal-title":"SpringerPlus"},{"key":"4438_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10732-006-9004-0","volume":"13","author":"C Archetti","year":"2007","unstructured":"Archetti C, Hertz A, Speranza M (2007) Metaheuristics for the team orienteering problem. J Heuristics 13:49\u201376","journal-title":"J Heuristics"},{"key":"4438_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/1.9781611973594.ch10","volume-title":"Vehicle routing: problems, methods, and applications. MOS-SIAM series on optimization","author":"C Archetti","year":"2014","unstructured":"Archetti C, Speranza MG, Vigo D (2014) Vehicle routing problems with profits. In: Toth P, Vigo D (eds) Vehicle routing: problems, methods, and applications. MOS-SIAM series on optimization. SIAM, Philadelphia, pp 273\u2013298"},{"issue":"1","key":"4438_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10288-008-0094-4","volume":"8","author":"H Bouly","year":"2010","unstructured":"Bouly H, Dang DC, Moukrim A (2010) A memetic algorithm for the team orienteering problem. 4OR 8(1):49\u201370","journal-title":"4OR"},{"key":"4438_CR5","unstructured":"Brajevic I (2011) Artificial bee colony algorithm for the capacitated vehicle routing problem. In: Proceedings of the European computing conference, pp 239\u2013244"},{"key":"4438_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0305-0548(94)90065-5","volume":"21","author":"S Butt","year":"1994","unstructured":"Butt S, Cavalier T (1994) A heuristic for the multiple tour maximum collection problem. Comput Oper Res 21:101\u2013111","journal-title":"Comput Oper Res"},{"issue":"7","key":"4438_CR7","doi-asserted-by":"publisher","first-page":"3569","DOI":"10.1016\/j.eswa.2013.11.004","volume":"41","author":"E Cao","year":"2014","unstructured":"Cao E, Lai M, Yang H (2014) Open vehicle routing problem with demand uncertainty and its robust strategies. Expert Syst Appl 41(7):3569\u20133575","journal-title":"Expert Syst Appl"},{"issue":"3","key":"4438_CR8","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"IM Chao","year":"1996","unstructured":"Chao IM, Golden BL, Wasil EA (1996a) The team orienteering problem. Eur J Oper Res 88(3):464\u2013474","journal-title":"Eur J Oper Res"},{"issue":"3","key":"4438_CR9","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/0377-2217(95)00035-6","volume":"88","author":"IM Chao","year":"1996","unstructured":"Chao IM, Golden BL, Wasil EA (1996b) A fast and effective heuristic for the orienteering problem. Eur J Oper Res 88(3):475\u2013489","journal-title":"Eur J Oper Res"},{"key":"4438_CR10","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.cie.2014.06.004","volume":"74","author":"T Cura","year":"2014","unstructured":"Cura T (2014) An artificial bee colony algorithm approach for the team orienteering problem with time windows. Comput Ind Eng 74:270\u2013290","journal-title":"Comput Ind Eng"},{"key":"4438_CR11","doi-asserted-by":"crossref","unstructured":"Dang DC, Guibadj RN, Moukrim A (2011) A PSO-based memetic algorithm for the team orienteering problem. In: European conference on the applications of evolutionary computation. Springer, Berlin, pp 471\u2013480","DOI":"10.1007\/978-3-642-20520-0_48"},{"issue":"2","key":"4438_CR12","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.ejor.2013.02.049","volume":"229","author":"DC Dang","year":"2013","unstructured":"Dang DC, Guibadj RN, Moukrim A (2013) An effective PSO-inspired algorithm for the team orienteering problem. Eur J Oper Res 229(2):332\u2013344","journal-title":"Eur J Oper Res"},{"key":"4438_CR13","first-page":"365","volume-title":"Soft computing in industrial applications. Advances in intelligent systems and computing","author":"J Ferreira","year":"2014","unstructured":"Ferreira J, Quintas A, Oliveira JA (2014) Solving the team orienteering problem: developing a solution tool using a genetic algorithm approach. In: Kromer P, Koppen M, Schaefer G (eds) Soft computing in industrial applications. Advances in intelligent systems and computing, vol 223. Springer, Berlin, pp 365\u2013375"},{"issue":"3","key":"4438_CR14","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10732-014-9242-5","volume":"20","author":"D Gavalas","year":"2014","unstructured":"Gavalas D, Konstantopoulos C, Mastakas K, Pantziou G (2014) A survey on algorithmic approaches for solving tourist trip design problems. J Heuristics 20(3):291\u2013328","journal-title":"J Heuristics"},{"issue":"3","key":"4438_CR15","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"BL Golden","year":"1987","unstructured":"Golden BL, Levy L, Vohra R (1987) The orienteering problem. Naval Res Logist 34(3):307\u2013318","journal-title":"Naval Res Logist"},{"key":"4438_CR16","doi-asserted-by":"crossref","unstructured":"Gomez A, Salhi S (2014) Solving capacitated vehicle routing problem by artificial bee colony algorithm. In: IEEE symposium on computational intelligence in production and logistics systems (CIPLS). IEEE, pp 48\u201352","DOI":"10.1109\/CIPLS.2014.7007160"},{"issue":"2","key":"4438_CR17","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","volume":"255","author":"A Gunawan","year":"2016","unstructured":"Gunawan A, Lau HC, Vansteenwegen P (2016) Orienteering problem: a survey of recent variants, solution approaches and applications. Eur J Oper Res 255(2):315\u2013332","journal-title":"Eur J Oper Res"},{"key":"4438_CR18","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.swevo.2015.06.001","volume":"24","author":"S Iqbal","year":"2015","unstructured":"Iqbal S, Kaykobad M, Rahman MS (2015) Solving the multi-objective vehicle routing problem with soft time windows with the help of bees. Swarm Evolut Comput 24:50\u201364","journal-title":"Swarm Evolut Comput"},{"key":"4438_CR19","unstructured":"Ji P, Wu Y (2011) An improved artificial bee colony algorithm for the capacitated vehicle routing problem with time-dependent travel times. In: Tenth international symposium on operations research and its applications, pp 75\u201382"},{"key":"4438_CR20","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical report-tr06, Erciyes University, Engineering Faculty. Computer Engineering Department 200"},{"key":"4438_CR21","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. J Global Optim 39:459\u2013471","journal-title":"J Global Optim"},{"key":"4438_CR22","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga D, Basturk B (2008) On the performance of artificial bee colony (abc) algorithm. Appl Soft Comput 8:687\u2013697","journal-title":"Appl Soft Comput"},{"key":"4438_CR23","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1016\/j.cie.2007.10.001","volume":"54","author":"L Ke","year":"2008","unstructured":"Ke L, Archetti C, Feng Z (2008) Ants can solve the team orienteering problem. Comput Ind Eng 54:648\u2013665","journal-title":"Comput Ind Eng"},{"key":"4438_CR24","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.omega.2015.08.003","volume":"61","author":"L Ke","year":"2016","unstructured":"Ke L, Zhai L, Li J, Chan FT (2016) Pareto mimic algorithm: an approach to the team orienteering problem. Omega 61:155\u2013166","journal-title":"Omega"},{"issue":"8","key":"4438_CR25","doi-asserted-by":"publisher","first-page":"3065","DOI":"10.1016\/j.eswa.2012.12.022","volume":"40","author":"BI Kim","year":"2013","unstructured":"Kim BI, Li H, Johnson AL (2013) An augmented large neighbourhood search method for solving the team orienteering problem. Expert Syst Appl 40(8):3065\u20133072","journal-title":"Expert Syst Appl"},{"issue":"2","key":"4438_CR26","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1016\/j.asoc.2012.09.022","volume":"13","author":"SW Lin","year":"2013","unstructured":"Lin SW (2013) Solving the team orienteering problem using effective multi-start simulated annealing. Appl Soft Comput 13(2):1064\u20131073","journal-title":"Appl Soft Comput"},{"key":"4438_CR27","doi-asserted-by":"crossref","unstructured":"Mao S, Zheng M, Zhao X, Xie W, Wang Z (2016) The uncertain time dependent vehicle routing problem with soft time windows. In: IEEE International conference on fuzzy systems (FUZZ-IEEE). IEEE, pp 38\u201345","DOI":"10.1109\/FUZZ-IEEE.2016.7737665"},{"key":"4438_CR28","first-page":"1","volume-title":"Handbook of heuristics","author":"Y Marinakis","year":"2017","unstructured":"Marinakis Y, Marinaki M, Migdalas A (2017) Particle swarm optimization for the vehicle routing problem: a survey and a comparative analysis. In: Mart\u00ed Rafael, Panos Pardalos, Resende Mauricio (eds) Handbook of heuristics. Springer, Berlin, pp 1\u201334"},{"issue":"4","key":"4438_CR29","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s12293-011-0071-x","volume":"3","author":"S Muthuswamy","year":"2011","unstructured":"Muthuswamy S, Lam SS (2011) Discrete particle swarm optimization for the team orienteering problem. Memet Comput 3(4):287\u2013303","journal-title":"Memet Comput"},{"issue":"1","key":"4438_CR30","first-page":"41","volume":"3","author":"OE Nahum","year":"2014","unstructured":"Nahum OE, Hadas Y, Spiegel U (2014) Multi-objective vehicle routing problems with time windows: a vector evaluated artificial bee colony approach. Int J Comput Inf Technol 3(1):41\u201347","journal-title":"Int J Comput Inf Technol"},{"issue":"3","key":"4438_CR31","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"DJ Rosenkrantz","year":"1977","unstructured":"Rosenkrantz DJ, Stearns RE, Lewis PM II (1977) An analysis of several heuristics for the travelling salesman problem. SIAM J Comput 6(3):563\u2013581","journal-title":"SIAM J Comput"},{"issue":"1","key":"4438_CR32","first-page":"133","volume":"4","author":"H Seidgar","year":"2016","unstructured":"Seidgar H, Kiani M, Fazlollahtabar H (2016) Genetic and artificial bee colony algorithms for scheduling of multi-skilled manpower in combined manpower-vehicle routing problem. Prod Manuf Res 4(1):133\u2013151","journal-title":"Prod Manuf Res"},{"issue":"10","key":"4438_CR33","doi-asserted-by":"publisher","first-page":"1490","DOI":"10.3923\/itj.2012.1490.1495","volume":"11","author":"YJ Shi","year":"2012","unstructured":"Shi YJ, Meng FW, Shen GJ (2012) A modified artificial bee colony algorithm for vehicle routing problems with time windows. Inf Technol J 11(10):1490","journal-title":"Inf Technol J"},{"issue":"11","key":"4438_CR34","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1016\/j.cor.2009.05.002","volume":"37","author":"W Souffriau","year":"2010","unstructured":"Souffriau W, Vansteenwegen P, Berghe GV, Van Oudheusden D (2010) A path relinking approach for the team orienteering problem. Comput Oper Res 37(11):1853\u20131859","journal-title":"Comput Oper Res"},{"issue":"1","key":"4438_CR35","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ejor.2011.06.006","volume":"215","author":"WY Szeto","year":"2011","unstructured":"Szeto WY, Ho SC (2011) An artificial bee colony algorithm for the capacitated vehicle routing problem. Eur J Oper Res 215(1):126\u2013135","journal-title":"Eur J Oper Res"},{"key":"4438_CR36","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1016\/j.cor.2003.11.008","volume":"32","author":"H Tang","year":"2005","unstructured":"Tang H, Miller-Hooks E (2005) A tabu search heuristic for the team orienteering problem. Comput Oper Res 32:1379\u20131407","journal-title":"Comput Oper Res"},{"key":"4438_CR37","first-page":"404","volume":"43","author":"N Tuntitippawan","year":"2016","unstructured":"Tuntitippawan N, Asawarungsaengkul K (2016) An artificial bee colony algorithm with local search for vehicle routing problem with backhauls and time windows. KKU Eng J 43:404\u2013408","journal-title":"KKU Eng J"},{"issue":"1","key":"4438_CR38","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.ejor.2008.02.037","volume":"196","author":"P Vansteenwegen","year":"2009","unstructured":"Vansteenwegen P, Souffriau W, Van Berghe G, Van den Oudheusden D (2009) A guided local search metaheuristic for the team orienteering problem. Eur J Oper Res 196(1):118\u2013127","journal-title":"Eur J Oper Res"},{"key":"4438_CR39","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-00939-6_2","volume-title":"Metaheuristics in the service industry. Lecture notes in economics and mathematical systems","author":"P Vansteenwegen","year":"2009","unstructured":"Vansteenwegen P, Souffriau P, Vanden Berghe G, Van Oudheusden D (2009) Metaheuristics for tourist trip planning. In: Geiger M, Habenicht W, Sevaux M, S\u00f6rensen K (eds) Metaheuristics in the service industry. Lecture notes in economics and mathematical systems, vol 624. Springer, Berlin, pp 15\u201331"},{"issue":"1","key":"4438_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen P, Souffriau W, Van Oudheusden D (2011) The orienteering problem: a survey. Eur J Oper Res 209(1):1\u201310","journal-title":"Eur J Oper Res"},{"key":"4438_CR41","first-page":"815","volume-title":"Artificial bee colony algorithm for three-dimensional loading capacitated vehicle routing problem, in Proceedings of 20th International Conference on Industrial Engineering and Engineering Management","author":"B Wu","year":"2013","unstructured":"Wu B, Lin JG, Dong M (2013a) Artificial bee colony algorithm for three-dimensional loading capacitated vehicle routing problem, in Proceedings of 20th International Conference on Industrial Engineering and Engineering Management. Springer, Berlin, pp 815\u2013825"},{"key":"4438_CR42","unstructured":"Wu B, Cai H, Cui Z (2013b) Artificial bee colony algorithm for two-dimensional loading capacitated vehicle routing problem. In: International conference on management science and engineering (ICMSE). IEEE, pp 406\u2013412"},{"issue":"6","key":"4438_CR43","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1177\/0037549713481503","volume":"89","author":"B Yao","year":"2013","unstructured":"Yao B, Hu P, Zhang M, Wang S (2013) Artificial bee colony algorithm with scanning strategy for the periodic vehicle routing problem. Simulation 89(6):762\u2013770","journal-title":"Simulation"},{"issue":"21","key":"4438_CR44","doi-asserted-by":"publisher","first-page":"9302","DOI":"10.1016\/j.apm.2016.06.013","volume":"40","author":"PY Yin","year":"2016","unstructured":"Yin PY, Chuang YL (2016) Adaptive memory artificial bee colony algorithm for green vehicle routing with cross-docking. Appl Math Model 40(21):9302\u20139315","journal-title":"Appl Math Model"},{"issue":"8","key":"4438_CR45","first-page":"1","volume":"8","author":"S Yu","year":"2016","unstructured":"Yu S, Tai C, Liu Y, Gao L (2016) An improved artificial bee colony algorithm for vehicle routing problem with time windows: a real case in Dalian. Adv Mech Eng 8(8):1\u20139","journal-title":"Adv Mech Eng"},{"key":"4438_CR46","doi-asserted-by":"crossref","unstructured":"Zettam M, Elbenani B (2016) A novel randomized heuristic for the team orienteering problem. In: 3rd International conferenceon logistics operations management (GOL). IEEE","DOI":"10.1109\/GOL.2016.7731671"},{"key":"4438_CR47","unstructured":"Zhang SZ, Lee CKM (2015) An improved artificial bee colony algorithm for the capacitated vehicle routing problem. In: 2015 IEEE international conference on systems, man, and cybernetics (SMC). IEEE, pp 2124\u20132128"},{"key":"4438_CR48","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.trd.2014.05.015","volume":"31","author":"S Zhang","year":"2014","unstructured":"Zhang S, Lee CKM, Choy KL, Ho W, Ip WH (2014) Design and development of a hybrid artificial bee colony algorithm for the environmental vehicle routing problem. Transp Res D Transp Environ 31:85\u201399","journal-title":"Transp Res D Transp Environ"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04438-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04438-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04438-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,17]],"date-time":"2020-10-17T23:37:57Z","timestamp":1602977877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04438-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,19]]},"references-count":48,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["4438"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04438-w","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,19]]},"assertion":[{"value":"19 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"All authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}