{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:59:34Z","timestamp":1740099574648,"version":"3.37.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030310189"},{"type":"electronic","value":"9783030310196"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-31019-6_62","type":"book-chapter","created":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T19:03:32Z","timestamp":1570561412000},"page":"735-751","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Mixed-Integer Linear Programming Models for One-Commodity Pickup and Delivery Traveling Salesman Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0081-8470","authenticated-orcid":false,"given":"Juan D.","family":"Palacio","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2160-3180","authenticated-orcid":false,"given":"Juan Carlos","family":"Rivera","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,9]]},"reference":[{"issue":"3","key":"62_CR1","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1016\/j.ejor.2014.04.026","volume":"238","author":"C Archetti","year":"2014","unstructured":"Archetti, C., Bianchessi, N., Speranza, M.G.: Branch-and-cut algorithms for the split delivery vehicle routing problem. Eur. J. Oper. Res. 238(3), 685\u2013698 (2014)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20132","key":"62_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/j.1475-3995.2011.00811.x","volume":"19","author":"C Archetti","year":"2012","unstructured":"Archetti, C., Speranza, M.G.: Vehicle routing problems with split deliveries. Int. Trans. Oper. Res. 19(1\u20132), 3\u201322 (2012)","journal-title":"Int. Trans. Oper. Res."},{"issue":"8","key":"62_CR3","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1057\/palgrave.jors.2600595","volume":"49","author":"J Brandao","year":"1998","unstructured":"Brandao, J., Mercer, A.: The multi-trip vehicle routing problem. J. Oper. Res. Soc. 49(8), 799\u2013805 (1998)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"62_CR4","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.disopt.2012.11.005","volume":"10","author":"D Chemla","year":"2013","unstructured":"Chemla, D., Meunier, F., Wolfler Calvo, R.: Bike sharing systems: Solving the static rebalancing problem. Discrete Optim. 10(2), 120\u2013146 (2013)","journal-title":"Discrete Optim."},{"issue":"2","key":"62_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ejor.2015.09.047","volume":"250","author":"VN Coelho","year":"2016","unstructured":"Coelho, V.N., Grasas, A., Ramalhinho, H., Coelho, I.M., Souza, M.J., Cruz, R.C.: An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints. Eur. J. Oper. Res. 250(2), 367\u2013376 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"62_CR6","doi-asserted-by":"crossref","unstructured":"Cordeau, J.F., Laporte, G., Savelsbergh, M.W., Vigo, D.: Vehicle routing. In: Handbooks in Operations Research and Management Science, vol. 14, pp. 367\u2013428 (2007)","DOI":"10.1016\/S0927-0507(06)14006-2"},{"key":"62_CR7","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.cor.2016.09.025","volume":"79","author":"F Cruz","year":"2017","unstructured":"Cruz, F., Subramanian, A., Bruck, B.P., Iori, M.: A heuristic algorithm for a single vehicle static bike sharing rebalancing problem. Comput. Oper. Res. 79, 19\u201333 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"62_CR8","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.: The truck dispatching problem. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"key":"62_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.cor.2016.01.011","volume":"71","author":"M Dell\u2019Amico","year":"2016","unstructured":"Dell\u2019Amico, M., Iori, M., Novellani, S., St\u00fctzle, T.: A destroy and repair algorithm for the bike sharing rebalancing problem. Comput. Oper. Res. 71, 149\u2013162 (2016)","journal-title":"Comput. Oper. Res."},{"key":"62_CR10","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-981-13-0761-4_52","volume-title":"Harmony Search and Nature Inspired Optimization Algorithms","author":"A Dixit","year":"2019","unstructured":"Dixit, A., Mishra, A., Shukla, A.: Vehicle routing problem with time windows using meta-heuristic algorithms: a survey. In: Yadav, N., Yadav, A., Bansal, J.C., Deep, K., Kim, J.H. (eds.) Harmony Search and Nature Inspired Optimization Algorithms. AISC, vol. 741, pp. 539\u2013546. Springer, Singapore (2019). \n                    https:\/\/doi.org\/10.1007\/978-981-13-0761-4_52"},{"key":"62_CR11","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.trb.2014.10.003","volume":"71","author":"IA Forma","year":"2015","unstructured":"Forma, I.A., Raviv, T., Tzur, M.: A 3-step math heuristic for the static repositioning problem in bike-sharing systems. Transp. Res. Part B Methodol. 71, 230\u2013247 (2015)","journal-title":"Transp. Res. Part B Methodol."},{"key":"62_CR12","doi-asserted-by":"publisher","first-page":"101488","DOI":"10.1016\/j.scs.2019.101488","volume":"47","author":"LS Franca","year":"2019","unstructured":"Franca, L.S., Ribeiro, G.M., Chaves, G.D.L.D.: The planning of selective collection in a real-life vehicle routing problem: a case in Rio de Janeiro. Sustain. Cities Soc. 47, 101488 (2019)","journal-title":"Sustain. Cities Soc."},{"issue":"7","key":"62_CR13","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/S0305-0548(98)00085-9","volume":"26","author":"M Gendreau","year":"1999","unstructured":"Gendreau, M., Laporte, G., Vigo, D.: Heuristics for the traveling salesman problem with pickup and delivery. Comput. Oper. Res. 26(7), 699\u2013714 (1999)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"62_CR14","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1016\/j.cor.2008.03.008","volume":"36","author":"H Hern\u00e1ndez-P\u00e9rez","year":"2009","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., Rodr\u00edguez-Mart\u00edn, I., Salazar-Gonz\u00e1lez, J.J.: A hybrid GRASP\/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem. Comput. Oper. Res. 36(5), 1639\u20131645 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"62_CR15","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.dam.2003.09.013","volume":"145","author":"H Hern\u00e1ndez-P\u00e9rez","year":"2004","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., Salazar-Gonz\u00e1lez, J.J.: A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Appl. Math. 145(1), 126\u2013139 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"62_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1287\/trsc.1030.0086","volume":"38","author":"H Hern\u00e1ndez-P\u00e9rez","year":"2004","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., Salazar-Gonz\u00e1lez, J.J.: Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transp. Sci. 38(2), 245\u2013255 (2004)","journal-title":"Transp. Sci."},{"key":"62_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2018.04.016","volume":"97","author":"H Hern\u00e1ndez-P\u00e9rez","year":"2018","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., Salazar-Gonz\u00e1lez, J.J., Santos-Hern\u00e1ndez, B.: Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem. Comput. Oper. Res. 97, 1\u201317 (2018)","journal-title":"Comput. Oper. Res."},{"key":"62_CR18","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1016\/j.trb.2016.11.003","volume":"95","author":"SC Ho","year":"2017","unstructured":"Ho, S.C., Szeto, W.Y.: A hybrid large neighborhood search for the static multi-vehicle bike-repositioning problem. Transp. Res. Part B Methodol. 95, 340\u2013363 (2017)","journal-title":"Transp. Res. Part B Methodol."},{"key":"62_CR19","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.cie.2016.02.002","volume":"95","author":"AA Kadri","year":"2016","unstructured":"Kadri, A.A., Kacem, I., Labadi, K.: A branch-and-bound algorithm for solving the static rebalancing problem in bicycle-sharing systems. Comput. Ind. Eng. 95, 41\u201352 (2016)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"62_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1287\/trsc.22.3.161","volume":"22","author":"G Laporte","year":"1988","unstructured":"Laporte, G., Nobert, Y., Taillefer, S.: Solving a family of multi-depot vehicle routing and location-routing problems. Transp. Sci. 22(3), 161\u2013172 (1988)","journal-title":"Transp. Sci."},{"issue":"2","key":"62_CR21","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0377-2217(94)90360-3","volume":"79","author":"G Mosheiov","year":"1994","unstructured":"Mosheiov, G.: The travelling salesman problem with pick-up and delivery. Eur. J. Oper. Res. 79(2), 299\u2013310 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"62_CR22","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-030-00353-1_10","volume-title":"Applied Computer Sciences in Engineering","author":"A Posada","year":"2018","unstructured":"Posada, A., Rivera, J.C., Palacio, J.D.: A mixed-integer linear programming model for a selective vehicle routing problem. In: Figueroa-Garc\u00eda, J.C., Villegas, J.G., Orozco-Arroyave, J.R., Maya Duque, P.A. (eds.) WEA 2018. CCIS, vol. 916, pp. 108\u2013119. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-030-00353-1_10"},{"issue":"6","key":"62_CR23","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1016\/j.engappai.2008.10.006","volume":"22","author":"C Prins","year":"2009","unstructured":"Prins, C.: Two memetic algorithms for heterogeneous fleet vehicle routing problems. Eng. Appl. Artif. Intell. 22(6), 916\u2013928 (2009)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"62_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-88439-2_4","volume-title":"Hybrid Metaheuristics","author":"C Prodhon","year":"2008","unstructured":"Prodhon, C., Prins, C.: A memetic algorithm with population management (MA\u2014PM) for the periodic location-routing problem. In: Blesa, M., et al. (eds.) HM 2008. LNCS, vol. 5296, pp. 43\u201357. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-88439-2_4"},{"issue":"3","key":"62_CR25","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s13676-012-0017-6","volume":"2","author":"T Raviv","year":"2013","unstructured":"Raviv, T., Tzur, M., Forma, I.: Static repositioning in a bike-sharing system: models and solution approaches. EURO J. Transp. Logist. 2(3), 187\u2013229 (2013)","journal-title":"EURO J. Transp. Logist."},{"issue":"1","key":"62_CR26","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ejor.2015.08.067","volume":"249","author":"JC Rivera","year":"2016","unstructured":"Rivera, J.C., Afsar, H.M., Prins, C.: Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem. Eur. J. Oper. Res. 249(1), 93\u2013104 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"62_CR27","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.trb.2015.02.014","volume":"75","author":"JJ Salazar-Gonz\u00e1lez","year":"2015","unstructured":"Salazar-Gonz\u00e1lez, J.J., Santos-Hern\u00e1ndez, B.: The split-demand one-commodity pickup-and-delivery travelling salesman problem. Transp. Res. Part B: Methodol. 75, 58\u201373 (2015)","journal-title":"Transp. Res. Part B: Methodol."},{"issue":"3","key":"62_CR28","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W.: A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper. Res. 60(3), 611\u2013624 (2012)","journal-title":"Oper. Res."},{"issue":"4","key":"62_CR29","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1016\/j.cie.2008.10.014","volume":"56","author":"F Zhao","year":"2009","unstructured":"Zhao, F., Li, S., Sun, J., Mei, D.: Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem. Comput. Ind. Eng. 56(4), 1642\u20131648 (2009)","journal-title":"Comput. Ind. Eng."}],"container-title":["Communications in Computer and Information Science","Applied Computer Sciences in Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31019-6_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T19:06:34Z","timestamp":1570561594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31019-6_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030310189","9783030310196"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31019-6_62","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WEA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Engineering Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Marta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"woea2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ieee.udistrital.edu.co\/wea2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}