{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T05:39:44Z","timestamp":1771911584090,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,2,26]],"date-time":"2020-02-26T00:00:00Z","timestamp":1582675200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,26]],"date-time":"2020-02-26T00:00:00Z","timestamp":1582675200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-14-CE22-0017"],"award-info":[{"award-number":["ANR-14-CE22-0017"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10479-020-03540-9","type":"journal-article","created":{"date-parts":[[2020,2,26]],"date-time":"2020-02-26T06:02:57Z","timestamp":1582696977000},"page":"281-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit"],"prefix":"10.1007","volume":"291","author":[{"given":"Racha","family":"El-Hajj","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3448-3912","authenticated-orcid":false,"given":"Rym Nesrine","family":"Guibadj","sequence":"additional","affiliation":[]},{"given":"Aziz","family":"Moukrim","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7694-601X","authenticated-orcid":false,"given":"Mehdi","family":"Serairi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,26]]},"reference":[{"issue":"1","key":"3540_CR1","doi-asserted-by":"crossref","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. Journal of Heuristics, 13(1), 49\u201376.","journal-title":"Journal of Heuristics"},{"key":"3540_CR2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.cie.2017.09.032","volume":"113","author":"M Avci","year":"2017","unstructured":"Avci, M., & Avci, M. G. (2017). A grasp with iterated local search for the traveling repairman problem with profits. Computers & Industrial Engineering, 113, 323\u2013332.","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"3540_CR3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/s10732-018-9395-8","volume":"25","author":"A Ben-Said","year":"2019","unstructured":"Ben-Said, A., El-Hajj, R., & Moukrim, A. (2019). A variable space search heuristic for the capacitated team orienteering problem. J Heuristics, 25(2), 273\u2013303.","journal-title":"J Heuristics"},{"issue":"1","key":"3540_CR4","first-page":"49","volume":"8","author":"H Bouly","year":"2010","unstructured":"Bouly, H., Dang, D. C., & Moukrim, A. (2010). A memetic algorithm for the team orienteering problem. A Quarterly Journal of Operations Research, 8(1), 49\u201370.","journal-title":"A Quarterly Journal of Operations Research"},{"issue":"3","key":"3540_CR5","first-page":"211","volume":"5","author":"S Boussier","year":"2007","unstructured":"Boussier, S., Feillet, D., & Gendreau, M. (2007). An exact algorithm for team orienteering problems. A Quarterly Journal of Operations Research, 5(3), 211\u2013230.","journal-title":"A Quarterly Journal of Operations Research"},{"key":"3540_CR6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0305-0548(94)90065-5","volume":"21","author":"SE Butt","year":"1994","unstructured":"Butt, S. E., & Cavalier, T. M. (1994). A heuristic for the multiple tour maximum collection problem. Computers & Operations Research, 21, 101\u2013111.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"3540_CR7","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/S0305-0548(98)00071-9","volume":"26","author":"SE Butt","year":"1999","unstructured":"Butt, S. E., & Ryan, D. M. (1999). An optimal solution procedure for the multiple tour maximum collection problem using column generation. Computers & Operations Research, 26(4), 427\u2013441.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"3540_CR8","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"IM Chao","year":"1996","unstructured":"Chao, I. M., Golden, B., & Wasil, E. (1996). The team orienteering problem. European Journal of Operational Research, 88(4), 464\u2013474.","journal-title":"European Journal of Operational Research"},{"key":"3540_CR9","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.tre.2018.01.012","volume":"111","author":"L Chena","year":"2018","unstructured":"Chena, L., Chiangb, W. C., Russellb, R., Chenc, J., & Sunc, D. (2018). The probabilistic vehicle routing problem with service guarantees. Transportation Research Part E: Logistics and Transportation Review, 111, 149\u2013164.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"6","key":"3540_CR10","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G. A. (1958). A method for solving traveling salesman problems. Operations Research, 6(6), 791\u2013812.","journal-title":"Operations Research"},{"key":"3540_CR11","doi-asserted-by":"crossref","unstructured":"Dang, D., Guibadj, R. N., & Moukrim, A. (2011). A pso-based memetic algorithm for the team orienteering problem, pp. 471\u2013480.","DOI":"10.1007\/978-3-642-20520-0_48"},{"key":"3540_CR12","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-642-38171-3_23","volume":"7874","author":"DC Dang","year":"2013","unstructured":"Dang, D. C., El-Hajj, R., & Moukrim, A. (2013a). A branch-and-cut algorithm for solving the team orienteering problem. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), 7874, 332\u2013339.","journal-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR)"},{"issue":"2","key":"3540_CR13","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.ejor.2013.02.049","volume":"229","author":"DC Dang","year":"2013","unstructured":"Dang, D. C., Guibadj, R. N., & Moukrim, A. (2013b). An effective PSO-inspired algorithm for the team orienteering problem. European Journal of Operational Research, 229(2), 332\u2013344.","journal-title":"European Journal of Operational Research"},{"key":"3540_CR14","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6, 80\u201391.","journal-title":"Management Science"},{"key":"3540_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.cor.2016.04.008","volume":"74","author":"R El-Hajj","year":"2016","unstructured":"El-Hajj, R., Dang, D. C., & Moukrim, A. (2016). Solving the team orienteering problem with cutting planes. Computers & Operations Research, 74, 21\u201330.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"3540_CR16","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet, D., Dejax, P., & Gendreau, M. (2005). Traveling salesman problems with profits. Transportation Science, 39(2), 188\u2013205.","journal-title":"Transportation Science"},{"key":"3540_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-0-387-77778-8_4","volume-title":"The vehicle routing problem: Latest advances and new challenges","author":"PM Francis","year":"2008","unstructured":"Francis, P. M., Smilowitz, R. K., & Tzur, M. (2008). The period vehicle routing problem and its extensions. In B. Golden, S. Raghavan, & E. Wasil (Eds.), The vehicle routing problem: Latest advances and new challenges (Vol. 43, pp. 73\u2013102). Boston, MA: Springer."},{"issue":"3","key":"3540_CR18","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., & Pantziou, K. M. G. (2014). A survey on algorithmic approaches for solving tourist trip design problems. Journal of Heuristics, 20(3), 291\u2013328.","journal-title":"Journal of Heuristics"},{"key":"3540_CR19","unstructured":"Golden, B. L., Wasil, E. A., Kelly, J. P., & Chao, I. M. (1998). The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results. In T. G. Crainic & G. Laporte (Eds.), Fleet management and logistics. Centre for research on transportation (pp. 33\u201356). Boston, MA: Springer."},{"key":"3540_CR20","unstructured":"Gro\u00ebr, C. (2008). Parallel and serial algorithms for vehicle routing problems. Ph.d. thesis, University of Maryland, College Park, MD."},{"key":"3540_CR21","doi-asserted-by":"crossref","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, F. T. (2016). Pareto mimic algorithm: An approach to the team orienteering problem. Omega, 61, 155\u2013166.","journal-title":"Omega"},{"key":"3540_CR22","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","volume":"4","author":"J Kennedy","year":"1995","unstructured":"Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. IEEE International Conference on Neural Networks Proceedings, 4, 1942\u20131948.","journal-title":"IEEE International Conference on Neural Networks Proceedings"},{"issue":"2","key":"3540_CR23","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1080\/00207543.2015.1058982","volume":"54","author":"M Keshtkarana","year":"2016","unstructured":"Keshtkarana, M., Ziaratia, K., Bettinellib, A., & Vigob, D. (2016). Enhanced exact solution methods for the team orienteering problem. International Journal of Production Research, 54(2), 591\u2013601.","journal-title":"International Journal of Production Research"},{"key":"3540_CR24","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/j.tre.2018.11.003","volume":"122","author":"I Koyuncu","year":"2019","unstructured":"Koyuncu, I., & Yavuz, M. (2019). Duplicating nodes or arcs in green vehicle routing: A computational comparison of two formulations. Transportation Research Part E: Logistics and Transportation Review, 122, 605\u2013623.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"3540_CR25","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ejor.2012.01.030","volume":"220","author":"N Labadie","year":"2012","unstructured":"Labadie, N., Mansini, R., Melechovsk\u00fd, J., & Calvo, R. W. (2012). The team orienteering problem with time windows: An lp-based granular variable neighborhood search. European Journal of Operational Research, 220, 15\u201327.","journal-title":"European Journal of Operational Research"},{"key":"3540_CR26","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.cor.2013.07.025","volume":"41","author":"J Michallet","year":"2014","unstructured":"Michallet, J., Prins, C., Amodeo, L., Yalaoui, F., & Vitry, G. (2014). Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services. Computers & Operations Research, 41, 196\u2013207.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"3540_CR27","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s12293-011-0071-x","volume":"3","author":"S Muthuswamy","year":"2011","unstructured":"Muthuswamy, S., & Lam, S. (2011). Discrete particle swarm optimization for the team orienteering problem. Memetic Computing, 3(4), 287\u2013303.","journal-title":"Memetic Computing"},{"key":"3540_CR28","doi-asserted-by":"crossref","unstructured":"Ngueveu, S. U., Prins, C., & Calvo, R. W. (2010a). A hybrid Tabu search for the m-peripatetic vehicle routing problem. In Matheuristics: Hybridizing metaheuristics and mathematical programming (Vol. 10, pp. 253\u2013266). Boston, MA: Springer.","DOI":"10.1007\/978-1-4419-1306-7_11"},{"issue":"4","key":"3540_CR29","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10288-010-0148-2","volume":"8","author":"SU Ngueveu","year":"2010","unstructured":"Ngueveu, S. U., Prins, C., & Wolfler Calvo, R. (2010b). Lower and upper bounds for the m-peripatetic vehicle routing problem. 4OR, 8(4), 387\u2013406.","journal-title":"4OR"},{"key":"3540_CR30","doi-asserted-by":"publisher","unstructured":"Orlis, C., Lagan\u00e1b, D., Dullaert, W., & Vigo, D. (2019). Distribution with quality of service considerations: The capacitated routing problem with profits and service level requirements. Omega. https:\/\/doi.org\/10.1016\/j.omega.2019.02.003.","DOI":"10.1016\/j.omega.2019.02.003"},{"key":"3540_CR31","unstructured":"Poggi de Arag\u00e3o, M., Viana, H., & Uchoa, E. (2010). The team orienteering problem: Formulations and branch-cut and price. In: 10th workshop on algorithmic approaches for transportation modelling, optimization, and systems (ATMOS 2010), pp. 142\u2013155."},{"key":"3540_CR32","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.cor.2015.01.003","volume":"59","author":"H Qin","year":"2015","unstructured":"Qin, H., Ming, W., Zhang, Z., Xie, Y., & Lim, A. (2015). A tabu search algorithm for the multi-period inspector scheduling problem. Computers & Operations Research, 59, 78\u201393.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"3540_CR33","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/ijoc.1120.0499","volume":"25","author":"R Sadykov","year":"2013","unstructured":"Sadykov, R., & Vanderbeck, F. (2013). Bin packing with conflicts: A generic branch-and-price algorithm. INFORMS Journal on Computing, 25(2), 244\u2013255.","journal-title":"INFORMS Journal on Computing"},{"key":"3540_CR34","first-page":"25","volume":"116","author":"L Shixin","year":"2018","unstructured":"Shixin, L., Shujin, Q., & Ruiyou, Z. (2018). A branch-and-price algorithm for the multi-trip multi-repairman problem with time windows. Transportation Research Part E: Logistics and Transportation Review, 116, 25\u201341.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"2","key":"3540_CR35","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254\u2013265.","journal-title":"Operations Research"},{"issue":"11","key":"3540_CR36","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., Vanden Berghe, G., & Van Oudheusden, D. (2010). A path relinking approach for the team orienteering problem. Computers & Operations Research, 37(11), 1853\u20131859.","journal-title":"Computers & Operations Research"},{"key":"3540_CR37","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.cor.2016.04.003","volume":"78","author":"L Talarico","year":"2017","unstructured":"Talarico, L., Springael, J., Sorensen, K., & Talarico, F. (2017). A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem. Computers & Operations Research, 78, 547\u2013556.","journal-title":"Computers & Operations Research"},{"key":"3540_CR38","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., & Oudheusden, D. V. (2011). The team orienteering problem: A survey. European Journal of Operational Reasearch, 209, 1\u201310.","journal-title":"European Journal of Operational Reasearch"},{"issue":"2","key":"3540_CR39","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1287\/trsc.2015.0584","volume":"50","author":"T Vidal","year":"2015","unstructured":"Vidal, T., Maculan, N., Ochi, L. S., & Vaz Penna, P. H. (2015). Large neighborhoods with implicit customer selection for vehicle routing problems with profits. Transportation Science, 50(2), 720\u2013734.","journal-title":"Transportation Science"},{"issue":"3","key":"3540_CR40","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1016\/j.ejor.2012.11.059","volume":"229","author":"Z Zhang","year":"2013","unstructured":"Zhang, Z., Che, O., Cheang, B., Lim, A., & Qin, H. (2013). A memetic algorithm for the multiperiod vehicle routing problem with profit. European Journal of Operational Research, 229(3), 573\u2013584.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03540-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-020-03540-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-020-03540-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T00:37:42Z","timestamp":1614213462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-020-03540-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,26]]},"references-count":40,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["3540"],"URL":"https:\/\/doi.org\/10.1007\/s10479-020-03540-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,26]]},"assertion":[{"value":"26 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}