{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T16:25:42Z","timestamp":1758126342552,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030003524"},{"type":"electronic","value":"9783030003531"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00353-1_10","type":"book-chapter","created":{"date-parts":[[2018,9,12]],"date-time":"2018-09-12T14:13:10Z","timestamp":1536761590000},"page":"108-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Mixed-Integer Linear Programming Model for a Selective Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Posada","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2160-3180","authenticated-orcid":false,"given":"Juan Carlos","family":"Rivera","sequence":"additional","affiliation":[]},{"given":"Juan D.","family":"Palacio","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,13]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.endm.2013.05.104","volume":"41","author":"HM Afsar","year":"2013","unstructured":"Afsar, H.M., Labadie, N.: Team orienteering problem with decreasing profits. Electron. Notes Discret. Math. 41, 285\u2013293 (2013)","journal-title":"Electron. Notes Discret. Math."},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1111\/itor.12041","volume":"21","author":"HM Afsar","year":"2014","unstructured":"Afsar, H.M., Prins, C., Santos, A.C.: Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size. Int. Trans. Oper. Res. 21(1), 153\u2013175 (2014)","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ejor.2015.03.007","volume":"245","author":"FG \u015eahinyazan","year":"2015","unstructured":"\u015eahinyazan, F.G., Kara, B.Y., Taner, M.R.: Selective vehicle routing for a mobile blood donation system. Eur. J. Oper. Res. 245(1), 22\u201334 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.tre.2013.12.004","volume":"62","author":"M Allahviranloo","year":"2014","unstructured":"Allahviranloo, M., Chow, J.Y., Recker, W.W.: Selective vehicle routing problems under uncertainty without recourse. Transp. Res. Part E: Logist. Transp. Rev. 62, 68\u201388 (2014)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"4\u20135","key":"10_CR5","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.dam.2011.12.021","volume":"161","author":"C Archetti","year":"2013","unstructured":"Archetti, C., Bianchessi, N., Speranza, M.G.: Optimal solutions for routing problems with profits. Discret. Appl. Math. 161(4\u20135), 547\u2013557 (2013)","journal-title":"Discret. Appl. Math."},{"issue":"7","key":"10_CR6","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1057\/jors.2009.51","volume":"61","author":"R Baldacci","year":"2010","unstructured":"Baldacci, R., Bartolini, E., Laporte, G.: Some applications of the generalized vehicle routing problem. J. Oper. Res. Soc. 61(7), 1072\u20131077 (2010)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/opre.2013.1227","volume":"62","author":"M Battarra","year":"2014","unstructured":"Battarra, M., Erdo\u011fan, G., Vigo, D.: Exact algorithms for the clustered vehicle routing problem. Oper. Res. 62(1), 58\u201371 (2014)","journal-title":"Oper. Res."},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1287\/trsc.1100.0352","volume":"45","author":"T Bekta\u015f","year":"2011","unstructured":"Bekta\u015f, T., Erdo\u011fan, G., R\u00f8pke, S.: Formulations and branch-and-cut algorithms for the generalized vehicle routing problem. Transp. Sci. 45(3), 299\u2013316 (2011)","journal-title":"Transp. Sci."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.cor.2016.09.003","volume":"78","author":"F Carrabs","year":"2017","unstructured":"Carrabs, F., Cerrone, C., Cerulli, R., Gaudioso, M.: A novel discretization scheme for the close enough traveling salesman problem. Comput. Oper. Res. 78, 163\u2013171 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"10_CR10","doi-asserted-by":"publisher","first-page":"3034","DOI":"10.1016\/j.cor.2007.02.012","volume":"35","author":"KF Doerner","year":"2008","unstructured":"Doerner, K.F., Gronalt, M., Hartl, R.F., Kiechle, G., Reimann, M.: Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows. Comput. Oper. Res. 35(9), 3034\u20133048 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0377-2217(99)00073-9","volume":"122","author":"G Ghiani","year":"2000","unstructured":"Ghiani, G., Improta, G.: An efficient transformation of the generalized vehicle routing problem. Eur. J. Oper. Res. 122(1), 11\u201317 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"10_CR12","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, B.L., Levy, L., Vohra, R.: The orienteering problem. Nav. Res. Logist. 34(3), 307\u2013318 (1987)","journal-title":"Nav. Res. Logist."},{"key":"10_CR13","series-title":"Operations Research\/Computer Science Interfaces","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-0-387-39934-8_16","volume-title":"Perspectives in Operations Research","author":"DJ Gulczynski","year":"2006","unstructured":"Gulczynski, D.J., Heath, J.W., Price, C.C.: The close enough traveling salesman problem: a discussion of several heuristics. In: Alt, F.B., Fu, M.C., Golden, B.L. (eds.) Perspectives in Operations Research. Operations Research\/Computer Science Interfaces, vol. 36, pp. 271\u2013283. Springer, Boston (2006). https:\/\/doi.org\/10.1007\/978-0-387-39934-8_16"},{"key":"10_CR14","unstructured":"Kara, I., Bekta\u015f, T.: Integer linear programming formulation of the generalized vehicle routing problem. In: Proceedings of the 5th EURO\/INFORMS Joint International Meeting (2003)"},{"issue":"12","key":"10_CR15","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1057\/jors.1996.190","volume":"47","author":"G Laporte","year":"1996","unstructured":"Laporte, G., Asef-Vaziri, A., Sriskandarajah, C.: Some applications of the generalized travelling salesman problem. J. Oper. Res. Soc. 47(12), 1461\u20131467 (1996)","journal-title":"J. Oper. Res. Soc."},{"key":"10_CR16","unstructured":"Mennell, W.K.: Heuristics for solving three routing problems: Close-enough traveling salesman problem, close-enough vehicle routing problem, sequence-dependent team orienteering problem. Ph.D. thesis, University of Maryland (2009)"},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1057\/jors.2011.25","volume":"63","author":"L Moccia","year":"2012","unstructured":"Moccia, L., Cordeau, J.-F., Laporte, G.: An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. J. Oper. Res. Soc. 63(2), 232\u2013244 (2012)","journal-title":"J. Oper. Res. Soc."},{"issue":"9","key":"10_CR18","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1057\/palgrave.jors.2601420","volume":"53","author":"U Palekar","year":"2002","unstructured":"Palekar, U., Laporte, G.: Some applications of the clustered travelling salesman problem. J. Oper. Res. Soc. 53(9), 972\u2013976 (2002)","journal-title":"J. Oper. Res. Soc."},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Pop, P., Pintea, C., Dumitrescu, D.: An ant colony algorithm for solving the dynamic generalized vehicle routing problem. Ovidius University Annals of Constanta. Series of Civil Engineering, vol. 1, pp. 373\u2013382 (2009)","DOI":"10.1063\/1.3130618"},{"issue":"1","key":"10_CR20","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.apm.2011.05.037","volume":"36","author":"PC Pop","year":"2012","unstructured":"Pop, P.C., Kara, I., Marc, A.H.: New mathematical models of the generalized vehicle routing problem and extensions. Appl. Math. Model. 36(1), 97\u2013107 (2012)","journal-title":"Appl. Math. Model."},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.neucom.2012.03.032","volume":"109","author":"PC Pop","year":"2013","unstructured":"Pop, P.C., Matei, O., Sitar, C.P.: An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing 109, 76\u201383 (2013)","journal-title":"Neurocomputing"},{"key":"10_CR22","unstructured":"Sevaux, M., S\u00f6rensen, K., et al.: Hamiltonian paths in large clustered routing problems. In: Proceedings of the EU\/MEeting 2008 Workshop on Metaheuristics for Logistics and Vehicle Routing, EU\/ME, vol. 8, pp. 411\u2013417 (2008)"},{"key":"10_CR23","series-title":"Operations Research\/Computer Science Interfaces","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-0-387-77778-8_2","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"R Shuttleworth","year":"2008","unstructured":"Shuttleworth, R., Golden, B.L., Smith, S., Wasil, E.: Advances in meter reading: heuristic solution of the close enough traveling salesman problem over a street network. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research\/Computer Science Interfaces, vol. 43, pp. 487\u2013501. Springer, Boston (2008). https:\/\/doi.org\/10.1007\/978-0-387-77778-8_2"},{"issue":"9","key":"10_CR24","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T Tsiligirides","year":"1984","unstructured":"Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc 35(9), 797\u2013809 (1984)","journal-title":"J. Oper. Res. Soc"},{"issue":"7","key":"10_CR25","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1016\/j.cor.2010.10.010","volume":"38","author":"CA Valle","year":"2011","unstructured":"Valle, C.A., Martinez, L.C., da Cunha, A.S., Mateus, G.R.: Heuristic and exact algorithms for a min-max selective vehicle routing problem. Comput. Oper. Res. 38(7), 1054\u20131065 (2011)","journal-title":"Comput. Oper. Res."},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.cor.2014.10.019","volume":"58","author":"T Vidal","year":"2015","unstructured":"Vidal, T., Battarra, M., Subramanian, A., Erdogan, G.: Hybrid metaheuristics for the clustered vehicle routing problem. Comput. Oper. Res. 58, 87\u201399 (2015)","journal-title":"Comput. Oper. Res."}],"container-title":["Communications in Computer and Information Science","Applied Computer Sciences in Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00353-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,24]],"date-time":"2019-10-24T00:01:06Z","timestamp":1571875266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00353-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030003524","9783030003531"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00353-1_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]}}}