{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:14:59Z","timestamp":1768522499147,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,6,7]],"date-time":"2021-06-07T00:00:00Z","timestamp":1623024000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,7]],"date-time":"2021-06-07T00:00:00Z","timestamp":1623024000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ftirma Kurumu","doi-asserted-by":"publisher","award":["1001-213M438"],"award-info":[{"award-number":["1001-213M438"]}],"id":[{"id":"10.13039\/501100004410","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":[[2021,12]]},"DOI":"10.1007\/s10479-021-04137-6","type":"journal-article","created":{"date-parts":[[2021,6,7]],"date-time":"2021-06-07T07:04:57Z","timestamp":1623049497000},"page":"277-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["The multi-depot heterogeneous VRP with backhauls: formulation and a hybrid VNS with GRAMPS meta-heuristic approach"],"prefix":"10.1007","volume":"307","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7387-9907","authenticated-orcid":false,"given":"Fatih","family":"Kocat\u00fcrk","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9363-6141","authenticated-orcid":false,"given":"G. Yazg\u0131","family":"T\u00fct\u00fcnc\u00fc","sequence":"additional","affiliation":[]},{"given":"Said","family":"Salhi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,7]]},"reference":[{"issue":"1","key":"4137_CR1","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.ejor.2003.08.066","volume":"162","author":"S Ahmadi","year":"2005","unstructured":"Ahmadi, S., & Osman, I. H. (2005). Greedy random adaptive memory programming search for the capacitated clustering problem. European Journal of Operational Research, 162(1), 30\u201344. https:\/\/doi.org\/10.1016\/j.ejor.2003.08.066.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"4137_CR2","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1057\/jors.1992.152","volume":"43","author":"BM Baker","year":"1992","unstructured":"Baker, B. M. (1992). Further inprovements to vehicle routeing heuristics. Journal of the Operational Research Society, 43(10), 1009\u20131012. https:\/\/doi.org\/10.1057\/jors.1992.152.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"4137_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"15","author":"G Berbeglia","year":"2007","unstructured":"Berbeglia, G., Cordeau, J. F., Gribkovskaia, I., & Laporte, G. (2007). Static pickup and delivery problems: A classification scheme and survey. TOP, 15(1), 1\u201331. https:\/\/doi.org\/10.1007\/s11750-007-0009-0.","journal-title":"TOP"},{"key":"4137_CR4","doi-asserted-by":"crossref","unstructured":"Cordeau, J. F., Gendreau, M., & Laporte, G. (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30(2), 105\u2013119. 10.1002\/(SICI)1097-0037(199709)30:2<3c105::AID-NET5>3e3.0.CO;2-G.","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G"},{"key":"4137_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.eswa.2015.08.030","volume":"43","author":"FB de Oliveira","year":"2016","unstructured":"de Oliveira, F. B., Enayatifar, R., Sadaei, H. J., Guimar\u00e3es, F. G., & Potvin, J. Y. (2016). A cooperative coevolutionary algorithm for the multi-depot vehicle routing problem. Expert Systems with Applications, 43, 117\u2013130. https:\/\/doi.org\/10.1016\/j.eswa.2015.08.030.","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"4137_CR6","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0305-0548(84)90007-8","volume":"11","author":"B Golden","year":"1984","unstructured":"Golden, B., Assad, A., Levy, L., & Gheysens, F. (1984). The fleet size and mix vehicle routing problem. Computers & Operations Research, 11(1), 49\u201366. https:\/\/doi.org\/10.1016\/0305-0548(84)90007-8.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"4137_CR7","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/S0377-2217(99)00235-0","volume":"122","author":"S Irnich","year":"2000","unstructured":"Irnich, S. (2000). A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles. European Journal of Operational Research, 122(2), 310\u2013328. https:\/\/doi.org\/10.1016\/S0377-2217(99)00235-0.","journal-title":"European Journal of Operational Research"},{"key":"4137_CR8","unstructured":"Kocat\u00fcrk, F., T\u00fct\u00fcnc\u00fc, G. Y., & Salhi, S. (2020). Supplementary material for the multi-depot heterogeneous VRP with backhauls: Formulation and a hybrid VNS with GRAMPS meta-heuristic approach. Retrieved September 22, 2020, from https:\/\/drive.google.com\/file\/d\/1NQEoSYvzyzSLfVMyQLree9Bzwv1Jv0ZL\/view."},{"key":"4137_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.cor.2017.11.003","volume":"91","author":"C Ko\u00e7","year":"2018","unstructured":"Ko\u00e7, C., & Laporte, G. (2018). Vehicle routing with backhauls: Review and research perspectives. Computers & Operations Research, 91, 79\u201391. https:\/\/doi.org\/10.1016\/j.cor.2017.11.003.","journal-title":"Computers & Operations Research"},{"key":"4137_CR10","doi-asserted-by":"publisher","first-page":"104987","DOI":"10.1016\/j.cor.2020.104987","volume":"122","author":"C Ko\u00e7","year":"2020","unstructured":"Ko\u00e7, C., Laporte, G., & T\u00fckenmez, I. (2020). A review of vehicle routing with simultaneous pickup and delivery. Computers & Operations Research, 122, 104987. https:\/\/doi.org\/10.1016\/j.cor.2020.104987.","journal-title":"Computers & Operations Research"},{"issue":"7","key":"4137_CR11","doi-asserted-by":"publisher","first-page":"3551","DOI":"10.1016\/j.eswa.2014.12.004","volume":"42","author":"J Li","year":"2015","unstructured":"Li, J., Pardalos, P. M., Sun, H., Pei, J., & Zhang, Y. (2015). Iterated local search embedded adaptive neighborhood selection approach for the multi-depot vehicle routing problem with simultaneous deliveries and pickups. Expert Systems with Applications, 42(7), 3551\u20133561. https:\/\/doi.org\/10.1016\/j.eswa.2014.12.004.","journal-title":"Expert Systems with Applications"},{"issue":"11","key":"4137_CR12","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11), 1097\u20131100. https:\/\/doi.org\/10.1016\/S0305-0548(97)00031-2.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"4137_CR13","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ejor.2002.11.003","volume":"162","author":"G Nagy","year":"2005","unstructured":"Nagy, G., & Salhi, S. (2005). Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. European Journal of Operational Research, 162(1), 126\u2013141. https:\/\/doi.org\/10.1016\/j.ejor.2002.11.003.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"4137_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10479-017-2642-9","volume":"273","author":"PHV Penna","year":"2019","unstructured":"Penna, P. H. V., Subramanian, A., Ochi, L. S., Vidal, T., & Prins, C. (2019). A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet. Annals of Operations Research, 273(1), 5\u201374. https:\/\/doi.org\/10.1007\/s10479-017-2642-9.","journal-title":"Annals of Operations Research"},{"key":"4137_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49355-8","author":"S Salhi","year":"2017","unstructured":"Salhi, S. (2017). Heuristic search: The emerging science of problem solving. Palgrave Macmillan,. https:\/\/doi.org\/10.1007\/978-3-319-49355-8.","journal-title":"Palgrave Macmillan"},{"issue":"10","key":"4137_CR16","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1057\/palgrave.jors.2600808","volume":"50","author":"S Salhi","year":"1999","unstructured":"Salhi, S., & Nagy, G. (1999). A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. The Journal of the Operational Research Society, 50(10), 1034\u20131042.","journal-title":"The Journal of the Operational Research Society"},{"issue":"1","key":"4137_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0377-2217(96)00253-6","volume":"103","author":"S Salhi","year":"1997","unstructured":"Salhi, S., & Sari, M. (1997). A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. European Journal of Operational Research, 103(1), 95\u2013112. https:\/\/doi.org\/10.1016\/S0377-2217(96)00253-6.","journal-title":"European Journal of Operational Research"},{"key":"4137_CR18","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tre.2013.05.005","volume":"56","author":"S Salhi","year":"2013","unstructured":"Salhi, S., Wassan, N., & Hajarat, M. (2013). The fleet size and mix vehicle routing problem with backhauls: Formulation and set partitioning-based heuristics. Transportation Research Part E: Logistics and Transportation Review, 56, 22\u201335. https:\/\/doi.org\/10.1016\/j.tre.2013.05.005.","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"Part B","key":"4137_CR19","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.cor.2013.05.011","volume":"52","author":"S Salhi","year":"2014","unstructured":"Salhi, S., Imran, A., & Wassan, N. A. (2014). The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation. Computers & Operations Research, 52(Part B), 315\u2013325. https:\/\/doi.org\/10.1016\/j.cor.2013.05.011.","journal-title":"Computers & Operations Research"},{"key":"4137_CR20","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.eswa.2016.08.060","volume":"65","author":"JF Sze","year":"2016","unstructured":"Sze, J. F., Salhi, S., & Wassan, N. (2016). A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem. Expert Systems with Applications, 65, 383\u2013397. https:\/\/doi.org\/10.1016\/j.eswa.2016.08.060.","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"4137_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ro:1999101","volume":"33","author":"ED Taillard","year":"1999","unstructured":"Taillard, E. D. (1999). A heuristic column generation method for the heterogeneous fleet VRP. RAIRO\u2014Operations Research, 33(1), 1\u201314. https:\/\/doi.org\/10.1051\/ro:1999101.","journal-title":"RAIRO\u2014Operations Research"},{"issue":"4","key":"4137_CR22","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1287\/trsc.31.4.372","volume":"31","author":"P Toth","year":"1997","unstructured":"Toth, P., & Vigo, D. (1997). An exact algorithm for the vehicle routing problem with backhauls. Transportation Science, 31(4), 372\u2013385. https:\/\/doi.org\/10.1287\/trsc.31.4.372.","journal-title":"Transportation Science"},{"issue":"2","key":"4137_CR23","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/j.ejor.2009.03.044","volume":"201","author":"GY T\u00fct\u00fcnc\u00fc","year":"2010","unstructured":"T\u00fct\u00fcnc\u00fc, G. Y. (2010). An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls. European Journal of Operational Research, 201(2), 593\u2013600. https:\/\/doi.org\/10.1016\/j.ejor.2009.03.044.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"4137_CR24","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.omega.2006.11.001","volume":"37","author":"GY T\u00fct\u00fcnc\u00fc","year":"2009","unstructured":"T\u00fct\u00fcnc\u00fc, G. Y., Carreto, C. A., & Baker, B. M. (2009). A visual interactive approach to classical and mixed vehicle routing problems with backhauls. Omega, 37(1), 138\u2013154. https:\/\/doi.org\/10.1016\/j.omega.2006.11.001.","journal-title":"Omega"},{"issue":"1","key":"4137_CR25","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejor.2013.12.044","volume":"237","author":"T Vidal","year":"2014","unstructured":"Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2014). Implicit depot assignments and rotations in vehicle routing heuristics. European Journal of Operational Research, 237(1), 15\u201328. https:\/\/doi.org\/10.1016\/j.ejor.2013.12.044.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04137-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-021-04137-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-021-04137-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,15]],"date-time":"2021-11-15T16:27:34Z","timestamp":1636993654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-021-04137-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,7]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["4137"],"URL":"https:\/\/doi.org\/10.1007\/s10479-021-04137-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,7]]},"assertion":[{"value":"26 May 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2021","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"}}]}}