{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:46:11Z","timestamp":1742913971260,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031530241"},{"type":"electronic","value":"9783031530258"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-53025-8_29","type":"book-chapter","created":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T20:02:12Z","timestamp":1706731332000},"page":"424-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Consistent Vehicle Routing Problem: An Application to\u00a0the\u00a0Pharmaceutical Supply Chain"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6106-812X","authenticated-orcid":false,"given":"Manuel","family":"Eus\u00e9bio","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1087-7941","authenticated-orcid":false,"given":"Telmo","family":"Pinto","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6702-5876","authenticated-orcid":false,"given":"Miguel","family":"Vieira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,1]]},"reference":[{"key":"29_CR1","unstructured":"Martins, S.S.B.: Configura\u00e7\u00e3o da cadeia log\u00edstica de um grossista farmac\u00eautico. Faculdade de Engenharia da Universidade do Porto (2014)"},{"issue":"1","key":"29_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2011.07.037","volume":"218","author":"R Baldacci","year":"2012","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R.: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218(1), 1\u20136 (2012). https:\/\/doi.org\/10.1016\/j.ejor.2011.07.037","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"29_CR3","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte, G.: Fifty years of vehicle routing. Transp. Sci. 43(4), 408\u2013416 (2009). https:\/\/doi.org\/10.1287\/trsc.1090.0301","journal-title":"Transp. Sci."},{"issue":"1","key":"29_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2015.07.020","volume":"249","author":"\u00c7 Ko\u00e7","year":"2016","unstructured":"Ko\u00e7, \u00c7., Bekta\u015f, T., Jabali, O., Laporte, G.: Thirty years of heterogeneous vehicle routing. Eur. J. Oper. Res. 249(1), 1\u201321 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2015.07.020","journal-title":"Eur. J. Oper. Res."},{"key":"29_CR5","doi-asserted-by":"publisher","unstructured":"Baldacci, R., Battarra, M., Vigo, D.: Routing a heterogeneous fleet of vehicles. 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. 3\u201327. Springer, Boston (2008). https:\/\/doi.org\/10.1007\/978-0-387-77778-8_1","DOI":"10.1007\/978-0-387-77778-8_1"},{"issue":"2","key":"29_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"SN Parragh","year":"2008","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems: part ii: transportation between pickup and delivery locations. J. fur Betriebswirtschaft 58(2), 81\u2013117 (2008). https:\/\/doi.org\/10.1007\/s11301-008-0036-4","journal-title":"J. fur Betriebswirtschaft"},{"issue":"2","key":"29_CR7","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00291-014-0386-3","volume":"37","author":"H Pollaris","year":"2015","unstructured":"Pollaris, H., Braekers, K., Caris, A., Janssens, G.K., Limbourg, S.: Vehicle routing problems with loading constraints: state-of-the-art and future directions. OR Spectrum 37(2), 297\u2013330 (2015). https:\/\/doi.org\/10.1007\/s00291-014-0386-3","journal-title":"OR Spectrum"},{"issue":"1","key":"29_CR8","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1111\/itor.12509","volume":"27","author":"T Pinto","year":"2020","unstructured":"Pinto, T., Alves, C., Val\u00e9rio de Carvalho, J.: Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls. Int. Trans. Oper. Res. 27(1), 549\u2013572 (2020). https:\/\/doi.org\/10.1111\/itor.12509","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"29_CR9","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1287\/trsc.1060.0165","volume":"41","author":"M Iori","year":"2007","unstructured":"Iori, M., Salazar-Gonz\u00e1lez, J.J., Vigo, D.: An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transp. Sci. 41(2), 253\u2013264 (2007). https:\/\/doi.org\/10.1287\/trsc.1060.0165","journal-title":"Transp. Sci."},{"key":"29_CR10","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2019.0904LNCS","author":"J-F C\u00f4t\u00e9","year":"2013","unstructured":"C\u00f4t\u00e9, J.-F., Gendreau, M., Potvin, J.-Y.: The vehicle routing problem with stochastic two-dimensional items. Transp. Sci. (2013). https:\/\/doi.org\/10.1287\/trsc.2019.0904LNCS","journal-title":"Transp. Sci."},{"issue":"3","key":"29_CR11","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/trsc.1050.0145","volume":"40","author":"M Gendreau","year":"2006","unstructured":"Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search algorithm for a routing and container loading problem. Transp. Sci. 40(3), 342\u2013350 (2006). https:\/\/doi.org\/10.1287\/trsc.1050.0145","journal-title":"Transp. Sci."},{"issue":"3","key":"29_CR12","doi-asserted-by":"publisher","first-page":"713","DOI":"10.3390\/math11030713","volume":"11","author":"A Moura","year":"2023","unstructured":"Moura, A., Pinto, T., Alves, C., Val\u00e9rio de Carvalho, J.: A matheuristic approach to the integration of three-dimensional bin packing problem and vehicle routing problem with simultaneous delivery and pickup. Mathematics 11(3), 713 (2023). https:\/\/doi.org\/10.3390\/math11030713","journal-title":"Mathematics"},{"issue":"4","key":"29_CR13","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1287\/msom.1080.0243","volume":"11","author":"C Gro\u00ebr","year":"2009","unstructured":"Gro\u00ebr, C., Golden, B., Smith, R.H., Wasil, E.: The consistent vehicle routing problem. Manuf. Serv. Oper. Manage. 11(4), 630\u2013643 (2009). https:\/\/doi.org\/10.1287\/msom.1080.0243","journal-title":"Manuf. Serv. Oper. Manage."},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1590\/s0101-74382010000100005","volume":"30","author":"L Junqueira","year":"2010","unstructured":"Junqueira, L., Morabito, R., Yamashita, D.S.: Modelos de otimiza\u00e7\u00e3o para problemas de carregamento de cont\u00eaineres com considera\u00e7\u00f5es de estabilidade e de empilhamento. Pesquisa Operacional 30(1), 73\u201398 (2010). https:\/\/doi.org\/10.1590\/s0101-74382010000100005","journal-title":"Pesquisa Operacional"},{"key":"29_CR15","unstructured":"Lespay, H., Suchan, K.: A case study of consistent vehicle routing problem with time windows (2019). http:\/\/arxiv.org\/abs\/1912.05929"},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-0-387-77778-8-21","volume":"43","author":"RT Wong","year":"2008","unstructured":"Wong, R.T.: Vehicle routing for small package delivery and pickup services. Oper. Res. Comput. Sci. Interfaces Ser. 43, 475\u2013485 (2008). https:\/\/doi.org\/10.1007\/978-0-387-77778-8-21","journal-title":"Oper. Res. Comput. Sci. Interfaces Ser."},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/j.cie.2019.01.045","volume":"129","author":"M Vieira","year":"2019","unstructured":"Vieira, M., Pinto-Varela, T., Barbosa-P\u00f3voa, A.P.: A model-based decision support framework for the optimisation of production planning in the biopharmaceutical industry. Comput. Ind. Eng. 129, 354\u2013367 (2019). https:\/\/doi.org\/10.1016\/j.cie.2019.01.045","journal-title":"Comput. Ind. Eng."},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-68496-3_1","volume-title":"Computational Logistics","author":"V Schmid","year":"2017","unstructured":"Schmid, V., Ehmke, J.F.: An effective large neighborhood search for the team orienteering problem with time windows. In: ICCL 2017. LNCS, vol. 10572, pp. 3\u201318. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68496-3_1"},{"issue":"1","key":"29_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.ejor.2018.07.030","volume":"273","author":"P Campelo","year":"2019","unstructured":"Campelo, P., Neves-Moreira, F., Amorim, P., Almada-Lobo, B.: Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector. Eur. J. Oper. Res. 273(1), 131\u2013145 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.07.030","journal-title":"Eur. J. Oper. Res."},{"key":"29_CR20","doi-asserted-by":"publisher","unstructured":"Fisher, M.: Vehicle routing. In: Handbooks in Operations Research and Management Science, vol. 8, no. C, pp. 1\u201333. Elsevier (1995). https:\/\/doi.org\/10.1016\/S0927-0507(05)80105-7","DOI":"10.1016\/S0927-0507(05)80105-7"}],"container-title":["Communications in Computer and Information Science","Optimization, Learning Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53025-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T20:16:42Z","timestamp":1706732202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53025-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031530241","9783031530258"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53025-8_29","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OL2A","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization, Learning Algorithms and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ponta Delgada","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ol2a2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ol2a.ipb.pt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"162","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}