{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T01:13:58Z","timestamp":1752282838285,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030597467"},{"type":"electronic","value":"9783030597474"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-59747-4_15","type":"book-chapter","created":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T11:02:30Z","timestamp":1601118150000},"page":"231-245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Metaheuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows and Step Cost Functions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6946-6149","authenticated-orcid":false,"given":"Jo\u00e3o L. V.","family":"Manguino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7647-2328","authenticated-orcid":false,"given":"D\u00e9bora P.","family":"Ronconi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.cor.2018.02.007","volume":"106","author":"F Arnold","year":"2019","unstructured":"Arnold, F., S\u00f6rensen, K.: What makes a VRP solution good? The generation of problem-specific knowledge for heuristics. Comput. Oper. Res. 106, 280\u2013288 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1111\/j.1540-5915.1983.tb00172.x","volume":"14","author":"MO Ball","year":"1983","unstructured":"Ball, M.O., Golden, B., Assad, A., Bodin, L.: Planning for truck fleet size in the presence of a common-carrier option. Decis. Sci. 14(1), 103\u2013120 (1983)","journal-title":"Decis. Sci."},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Ramaekers, K., Van Nieuwenhuyse, I.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99, 300\u2013313 (2016)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"15_CR4","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. Manag. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manag. Sci."},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"TA Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8(2), 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.: Greedy randomized adaptive search procedures. J. Global Optimiz. 6(2), 109\u2013133 (1995)","journal-title":"J. Global Optimiz."},{"key":"15_CR7","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-01085-9_4","volume-title":"Foundations of Computational Intelligence Volume 3","author":"P Festa","year":"2009","unstructured":"Festa, P., Resende, M.G.C.: Hybrid GRASP heuristics. In: Abraham, A., Hassanien, A.E., Siarry, P., Engelbrecht, A. (eds.) Foundations of Computational Intelligence Volume 3. SCI, vol. 203, pp. 75\u2013100. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01085-9_4"},{"issue":"1","key":"15_CR8","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.: The fleet size and mix vehicle routing problem. Comput. Oper. Res. 11(1), 49\u201366 (1984)","journal-title":"Comput. Oper. Res."},{"key":"15_CR9","unstructured":"Hansen, P., Mladenovic, N.: A tutorial on variable neighborhood search. Groupe d\u2019\u00c9tudes et de Recherche en Analyse des D\u00e9cisions, HEC Montr\u00e9al (2003)"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175(1), 367\u2013407 (2010). https:\/\/doi.org\/10.1007\/s10479-009-0657-6","journal-title":"Ann. Oper. Res."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.cor.2015.05.004","volume":"64","author":"\u00c7 Ko\u00e7","year":"2015","unstructured":"Ko\u00e7, \u00c7., Bekta\u015f, T., Jabali, O., Laporte, G.: A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows. Comput. Oper. Res. 64, 11\u201327 (2015)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"15_CR12","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)","journal-title":"Transp. Sci."},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"104","DOI":"10.5325\/transportationj.54.1.0104","volume":"54","author":"RC Lieb","year":"2015","unstructured":"Lieb, R.C., Lieb, K.J.: The north American third-party logistics industry in 2013: the provider CEO perspective. Transp. J. 54(1), 104\u2013121 (2015)","journal-title":"Transp. J."},{"issue":"7","key":"15_CR14","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1057\/palgrave.jors.2600763","volume":"50","author":"FH Liu","year":"1999","unstructured":"Liu, F.H., Shen, S.Y.: The fleet size and mix vehicle routing problem with time windows. J. Oper. Res. Soc. 50(7), 721\u2013732 (1999)","journal-title":"J. Oper. Res. Soc."},{"key":"15_CR15","unstructured":"Manguino, J.L.V.: Heuristic methods applied to the mixed fleet vehicle routing problem with time windows and step costs per distance range. Ph.D. Thesis, Escola Polit\u00e9cnica, Universidade de S\u00e3o Paulo, S\u00e3o Paulo (2020). www.teses.usp.br"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Manguino, J.L.V., Ronconi, D.P.: Step cost functions in a fleet size and mix vehicle routing problem with time windows. Ann. Opera. Res. (2020, submitted)","DOI":"10.1007\/s10479-020-03915-y"},{"issue":"1","key":"15_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.ijpe.2007.05.017","volume":"113","author":"A Marasco","year":"2008","unstructured":"Marasco, A.: Third-party logistics: a literature review. Int. J. Prod. Econ. 113(1), 127\u2013147 (2008)","journal-title":"Int. J. Prod. Econ."},{"issue":"11","key":"15_CR18","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.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.cor.2015.11.007","volume":"78","author":"PJ Palomo-Mart\u00ednez","year":"2017","unstructured":"Palomo-Mart\u00ednez, P.J., Salazar-Aguilar, M.A., Laporte, G., Langevin, A.: A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints. Comput. Oper. Res. 78, 408\u2013419 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"15_CR20","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"JY Potvin","year":"1995","unstructured":"Potvin, J.Y., Rousseau, J.M.: An exchange heuristic for routeing problems with time windows. J. Oper. Res. Soc. 46(12), 1433\u20131446 (1995). https:\/\/doi.org\/10.1057\/jors.1995.204","journal-title":"J. Oper. Res. Soc."},{"key":"15_CR21","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-1-4419-1665-5_10","volume-title":"Handbook of Metaheuristics","author":"MG Resende","year":"2010","unstructured":"Resende, M.G., Ribeiro, C.C.: Greedy randomized adaptive search procedures: advances, hybridizations, and applications. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. ISOR, vol. 146, pp. 283\u2013319. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_10"},{"issue":"2","key":"15_CR22","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.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"issue":"2","key":"15_CR23","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"\u00c9 Taillard","year":"1997","unstructured":"Taillard, \u00c9., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31(2), 170\u2013186 (1997)","journal-title":"Transp. Sci."},{"issue":"1","key":"15_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","volume":"231","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231(1), 1\u201321 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"15_CR25","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","volume":"234","author":"T Vidal","year":"2014","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A unified solution framework for multi-attribute vehicle routing problems. Eur. J. Oper. Res. 234(3), 658\u2013673 (2014)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59747-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,4]],"date-time":"2021-04-04T08:26:09Z","timestamp":1617524769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59747-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030597467","9783030597474"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59747-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Enschede","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccl2020.nl\/","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":"73","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":"49","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":"67% - 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":"2,5","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":"2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}