{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T00:19:30Z","timestamp":1769818770580,"version":"3.49.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,2,8]],"date-time":"2014-02-08T00:00:00Z","timestamp":1391817600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10479-014-1551-4","type":"journal-article","created":{"date-parts":[[2014,2,7]],"date-time":"2014-02-07T15:29:12Z","timestamp":1391786952000},"page":"383-404","source":"Crossref","is-referenced-by-count":53,"title":["Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet"],"prefix":"10.1007","volume":"236","author":[{"given":"Oscar","family":"Dominguez","sequence":"first","affiliation":[]},{"given":"Angel A.","family":"Juan","sequence":"additional","affiliation":[]},{"given":"Barry","family":"Barrios","sequence":"additional","affiliation":[]},{"given":"Javier","family":"Faulin","sequence":"additional","affiliation":[]},{"given":"Alba","family":"Agustin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,8]]},"reference":[{"key":"1551_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-0-387-77778-8_1","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"R Baldacci","year":"2008","unstructured":"Baldacci, R., Battarra, M., & Vigo, D. (2008). Routing a heterogeneous fleet of vehicles. In B. L. Golden, S. Raghavan, & E. A. Wasil (Eds.), The vehicle routing problem: latest advances and new challenges (pp. 3\u201327). New York: Springer."},{"issue":"1","key":"1551_CR2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s10479-009-0650-0","volume":"175","author":"R Baldacci","year":"2010","unstructured":"Baldacci, R., Toth, P., & Vigo, D. (2010). Exact algorithms for routing problems under vehicle capacity constraints. Annals of Operations Research, 175(1), 213\u2013245.","journal-title":"Annals of Operations Research"},{"key":"1551_CR3","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1016\/j.ejor.2006.10.013","volume":"183","author":"M-C Bolduc","year":"2007","unstructured":"Bolduc, M.-C., Renaud, J., & Boctor, F. F. (2007). A heuristic for the routing and carrier selection problem. European Journal of Operational Research, 183, 926\u2013932.","journal-title":"European Journal of Operational Research"},{"key":"1551_CR4","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.1040.0109","volume":"52","author":"EK Burke","year":"2004","unstructured":"Burke, E. K., Kendall, G., & Whitwell, G. (2004). A new placement heuristic for the orthogonal stock-cutting problem. Operations Research, 52, 655\u2013671.","journal-title":"Operations Research"},{"key":"1551_CR5","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G., & Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12, 568\u2013581.","journal-title":"Operations Research"},{"key":"1551_CR6","volume-title":"Logistics systems: Design and optimization","author":"JF Cordeau","year":"2005","unstructured":"Cordeau, J. F., Gendreau, M., Hertz, A., Laporte, G., & Sormany, J. S. (2005). New Heuristics for the vehicle routing problem. In A. Langevin & D. Riopel (Eds.), Logistics systems: Design and optimization. Boston: Kluwer."},{"key":"1551_CR7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/17.45262","volume":"37","author":"J Couillard","year":"1990","unstructured":"Couillard, J., & Martel, A. (1990). Vehicle fleet planning in the road transportation industry. IEEE Transactions on Engineering Management, 37, 31\u201336.","journal-title":"IEEE Transactions on Engineering Management"},{"issue":"1\u20132","key":"1551_CR8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s12159-012-0080-2","volume":"5","author":"M Drexl","year":"2012","unstructured":"Drexl, M. (2012). Rich vehicle routing in theory and practice. Logistics Research, 5(1\u20132), 47\u201363. doi: 10.1007\/s12159-012-0080-2 .","journal-title":"Logistics Research"},{"key":"1551_CR9","doi-asserted-by":"crossref","unstructured":"Duhamel, C., Lacomme, P., Quilliot, A., Toussaint, H. (2009). 2L-CVRP: A GRASP resolution scheme based on RCPSP. International Conference on Computers & Industrial Engineering. CIE 2009.","DOI":"10.1109\/ICCIE.2009.5223772"},{"issue":"3","key":"1551_CR10","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.cor.2010.08.017","volume":"38","author":"C Duhamel","year":"2011","unstructured":"Duhamel, C., Lacomme, P., Quilliot, A., & Toussaint, H. (2011). A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Computers & Operations Research, 38(3), 617\u2013640.","journal-title":"Computers & Operations Research"},{"key":"1551_CR11","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1016\/j.cor.2007.10.021","volume":"36","author":"G Fuellerer","year":"2009","unstructured":"Fuellerer, G., Doerner, K., Hartl, R., & Iori, M. (2009). Ant colony optimization for the two-dimensional loading vehicle routing problem. Computers & Operations Research, 36, 655\u2013673.","journal-title":"Computers & Operations Research"},{"key":"1551_CR12","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1002\/net.20192","volume":"51","author":"M Gendreau","year":"2008","unstructured":"Gendreau, M., Iori, M., Laporte, G., & Martello, S. (2008). A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks, 51, 4\u201318.","journal-title":"Networks"},{"key":"1551_CR13","doi-asserted-by":"crossref","first-page":"1153","DOI":"10.1016\/S0305-0548(98)00100-2","volume":"26","author":"M Gendreau","year":"1999","unstructured":"Gendreau, M., Laporte, G., Musaraganyi, C., & Taillard, E. D. (1999). A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers & Operations Research, 26, 1153\u20131173.","journal-title":"Computers & Operations Research"},{"key":"1551_CR14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0305-0548(84)90007-8","volume":"11","author":"B Golden","year":"1984","unstructured":"Golden, B., Assad, A. A., Levy, L., & Gheysens, F. G. (1984). The fleet size and mix vehicle routing problem. Computers & Operations Research, 11, 49\u201366.","journal-title":"Computers & Operations Research"},{"key":"1551_CR15","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1137\/1.9780898718515.ch10","volume-title":"The vehicle routing problem","author":"B Golden","year":"2002","unstructured":"Golden, B., Assad, A. A., & Wasil, E. (2002). Routing vehicles in the real world: Applications in the solid waste, beverage, food, dairy, and newspaper industries. In P. Toth & D. Vigo (Eds.), The vehicle routing problem (pp. 245\u2013286). Philadelphia: SIAM."},{"key":"1551_CR16","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","year":"2008","unstructured":"Golden, B., Raghavan, S., & Wasil, E. (Eds.). (2008). The Vehicle Routing Problem: Latest Advances and New Challenges. New York: Springer."},{"key":"1551_CR17","doi-asserted-by":"crossref","first-page":"2041","DOI":"10.1016\/j.cor.2010.03.015","volume":"37","author":"A Hoff","year":"2010","unstructured":"Hoff, A., Andersson, H., Christiansen, M., Hasle, G., & L\u00f8kketangen, A. (2010). Industrial aspects and literature survey: Fleet composition and routing. Computers & Operations Research, 37, 2041\u20132061.","journal-title":"Computers & Operations Research"},{"key":"1551_CR18","unstructured":"Iori M (2005). Metaheuristic Algorithms for Combinatorial Optimization Problems. 4OR, 3:163\u2013166."},{"key":"1551_CR19","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s11750-010-0144-x","volume":"18","author":"M Iori","year":"2010","unstructured":"Iori, M., & Martello, S. (2010). Routing problems with loading constraints. TOP, 18, 4\u201327.","journal-title":"TOP"},{"issue":"2","key":"1551_CR20","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/trsc.1060.0165","volume":"41","author":"M Iori","year":"2007","unstructured":"Iori, M., Salazar, J. J., & Vigo, D. (2007). An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transportation Science, 41(2), 253\u2013264.","journal-title":"Transportation Science"},{"key":"1551_CR21","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s11750-011-0245-1","volume":"21","author":"A Juan","year":"2013","unstructured":"Juan, A., Faulin, J., Ferrer, A., Louren\u00e7o, H., & Barrios, B. (2013). MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems. TOP, 21, 109\u2013132.","journal-title":"TOP"},{"issue":"6","key":"1551_CR22","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1057\/jors.2010.29","volume":"62","author":"A Juan","year":"2011","unstructured":"Juan, A., Faulin, J., Jorba, J., Riera, D., Masip, D., & Barrios, B. (2011). On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright saving heuristics. Journal of the Operational Research Society, 62(6), 1085\u20131097.","journal-title":"Journal of the Operational Research Society"},{"key":"1551_CR23","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G. (1992). The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research, 59, 345\u2013358.","journal-title":"European Journal of Operational Research"},{"key":"1551_CR24","unstructured":"Lee Y H, Kim J I, Kang K H, and Kim K H (2006). A heuristic for vehicle fleet mix problem using tabu search and set partitioning. Technical Report Seoul, South Korea: Yonsei University."},{"key":"1551_CR25","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.ejor.2012.09.023","volume":"225","author":"SCH Leung","year":"2013","unstructured":"Leung, S. C. H., Zhang, Z., Zhang, D., Hua, X., & Lim, M. K. (2013). A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints. European Journal of Operational Research, 225, 199\u2013210.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20132","key":"1551_CR26","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10696-010-9061-4","volume":"22","author":"SCH Leung","year":"2010","unstructured":"Leung, S. C. H., Zheng, J., Zhang, D., & Zhou, X. (2010a). Simulated Annealing for the Vehicle Routing Problem with Two-dimensional Loading Constraints. Flexible Services and Manufacturing Journal, 22(1\u20132), 61\u201382.","journal-title":"Flexible Services and Manufacturing Journal"},{"key":"1551_CR27","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.cor.2010.04.013","volume":"38","author":"SCH Leung","year":"2010","unstructured":"Leung, S. C. H., Zhou, X., Zhang, D., & Zheng, J. (2010b). Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem. Computers & Operations Research, 38, 205\u2013215.","journal-title":"Computers & Operations Research"},{"key":"1551_CR28","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.endm.2004.06.027","volume":"18","author":"CMRdR Lima","year":"2004","unstructured":"Lima, C M Rd R, Goldbarg, M. C., & Goldbarg, E. F. G. (2004). A memetic algorithm for the heterogeneous fleet vehicle routing problem. Electronic Notes in Discrete Mathematics, 18, 171\u2013176.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"1551_CR29","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/j.tre.2008.10.003","volume":"45","author":"S Liu","year":"2009","unstructured":"Liu, S., Huang, W., & Ma, H. (2009). An effective genetic algorithm for the fleet size and mix vehicle routing problem. Transportation Research Part E, 45, 434\u2013445.","journal-title":"Transportation Research Part E"},{"issue":"7","key":"1551_CR30","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1057\/palgrave.jors.2600763","volume":"50","author":"F-H Liu","year":"1999","unstructured":"Liu, F.-H., & Shen, S.-Y. (1999). The fleet size and mix vehicle routing problem with time windows. Journal of the Operational Research Society, 50(7), 721\u2013732.","journal-title":"Journal of the Operational Research Society"},{"key":"1551_CR31","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1287\/ijoc.11.4.345","volume":"11","author":"A Lodi","year":"1999","unstructured":"Lodi, A., Martello, S., & Vigo, D. (1999). Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing, 11, 345\u2013357.","journal-title":"INFORMS Journal on Computing"},{"key":"1551_CR32","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BFb0055938","volume":"1391","author":"LS Ochi","year":"1998","unstructured":"Ochi, L. S., Vianna, D. S., Drummond, M. A., & Victor, A. O. (1998a). An evolutionary hybrid metaheuristic for solving the vehicle routing problem with heterogeneous fleet. Lecture Notes in Computer Science, 1391, 187\u2013195.","journal-title":"Lecture Notes in Computer Science"},{"key":"1551_CR33","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0167-739X(98)00034-X","volume":"14","author":"LS Ochi","year":"1998","unstructured":"Ochi, L. S., Vianna, D. S., Drummond, M. A., & Victor, A. O. (1998b). A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet. Future Generation Computer Systems, 14, 285\u2013292.","journal-title":"Future Generation Computer Systems"},{"issue":"7","key":"1551_CR34","doi-asserted-by":"crossref","first-page":"1308","DOI":"10.1016\/j.cor.2009.09.014","volume":"37","author":"J Oppen","year":"2010","unstructured":"Oppen, J., L\u00f8kketangen, A., & Desrosiers, J. (2010). Solving a rich vehicle routing and inventory problem using column generation. Computers & Operations Research, 37(7), 1308\u20131317.","journal-title":"Computers & Operations Research"},{"key":"1551_CR35","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-1-4613-1361-8","volume-title":"Modern heuristic search methods","author":"IH Osman","year":"1996","unstructured":"Osman, I. H., & Salhi, S. (1996). Local search strategies for the vehicle fleet mix problem. In V. J. Rayward-Smith, I. H. Osman, C. R. Reeves, & G. D. Smith (Eds.), Modern heuristic search methods (pp. 131\u2013153). Wiley: Chichester."},{"key":"1551_CR36","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/A:1016516326823","volume":"1","author":"C Prins","year":"2002","unstructured":"Prins, C. (2002). Efficient heuristics for the heterogeneous fleet multi trip VRP with application to a large-scale real case. Journal of Mathematical Modelling and Algorithms, 1, 135\u2013150.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"1551_CR37","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1057\/palgrave.jors.2602087","volume":"57","author":"J Priv\u00e9","year":"2006","unstructured":"Priv\u00e9, J., Renaud, J., Boctor, F., & Laporte, G. (2006). Solving a vehicle routing problem arising in soft-drink distribution. Journal of Operational Research Society, 57, 1045\u20131052.","journal-title":"Journal of Operational Research Society"},{"key":"1551_CR38","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10479-010-0748-4","volume":"181","author":"J Rieck","year":"2010","unstructured":"Rieck, J., & Zimmermann, J. (2010). A new mixed integer linear model for a rich vehicle routing problem with docking constraints. Annals of Operations Research, 181, 337\u2013358.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"1551_CR39","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/S0377-2217(03)00265-0","volume":"153","author":"R Ruiz","year":"2004","unstructured":"Ruiz, R., Maroto, C., & Alcaraz, J. (2004). A decision support system for a real vehicle routing problem. European Journal of Operational Research, 153(3), 593\u2013606.","journal-title":"European Journal of Operational Research"},{"key":"1551_CR40","doi-asserted-by":"crossref","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, 95\u2013112.","journal-title":"European Journal of Operational Research"},{"key":"1551_CR41","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10479-009-0651-z","volume":"175","author":"A Sbihi","year":"2010","unstructured":"Sbihi, A., & Eglese, R. W. (2010). Combinatorial optimization and green logistics. Annals of Operations Research, 175, 159\u2013175.","journal-title":"Annals of Operations Research"},{"key":"1551_CR42","first-page":"159","volume":"175","author":"F Semet","year":"1993","unstructured":"Semet, F., & Taillard, E. (1993). Solving real-life vehicle routing problems efficiently using tabu search. Annals of Operations Research, 175, 159\u2013175.","journal-title":"Annals of Operations Research"},{"key":"1551_CR43","doi-asserted-by":"crossref","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, 33, 1\u201314.","journal-title":"RAIRO"},{"issue":"1","key":"1551_CR44","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1021157406318","volume":"115","author":"CD Tarantilis","year":"2002","unstructured":"Tarantilis, C. D., & Kiranoudis, C. T. (2002). BoneRoute: An adaptive memory-based method for effective fleet management. Annals of Operations Research, 115(1), 227\u2013241.","journal-title":"Annals of Operations Research"},{"key":"1551_CR45","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1016\/j.ejor.2005.03.059","volume":"179","author":"CD Tarantilis","year":"2007","unstructured":"Tarantilis, C. D., & Kiranoudis, C. T. (2007). A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector. European Journal of Operational Research, 179, 806\u2013822.","journal-title":"European Journal of Operational Research"},{"key":"1551_CR46","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/j.jfranklin.2005.12.002","volume":"344","author":"R Tavakkoli-Moghaddam","year":"2007","unstructured":"Tavakkoli-Moghaddam, R., Safeai, N., Kah, M. M. O., & Rabbani, M. (2007). A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing. Journal of the Franklin Institute, 344, 406\u2013425.","journal-title":"Journal of the Franklin Institute"},{"key":"1551_CR47","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718515","volume-title":"The vehicle routing problem, monographs on discrete mathematics and applications","author":"P Toth","year":"2002","unstructured":"Toth, P., & Vigo, D. (2002). The vehicle routing problem, monographs on discrete mathematics and applications. Philadelphia: SIAM Publishers."},{"key":"1551_CR48","doi-asserted-by":"crossref","unstructured":"Vallejo, M., Vargas, P., and Corne, D. (2012). A fast approximative approach for the vehicle routing problem. 12th Workshop UK on Computational Intelligence (UKCI) pp 1\u20138.","DOI":"10.1109\/UKCI.2012.6335752"},{"key":"1551_CR49","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1109\/CSO.2009.127","volume":"2","author":"F Wang","year":"2009","unstructured":"Wang, F., Tao, Y., & Shi, N. (2009). A survey on vehicle routing problem with loading constraints. International Joint Conference on Computational Sciences and Optimization, 2, 602\u2013606. doi: 10.1109\/CSO.2009.127 .","journal-title":"International Joint Conference on Computational Sciences and Optimization"},{"key":"1551_CR50","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1016\/j.ejor.2007.05.058","volume":"195","author":"EE Zachariadis","year":"2009","unstructured":"Zachariadis, E. E., Tarantilis, C. D., & Kiranoudis, C. T. (2009). A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. European Journal of Operational Research, 195, 729\u2013743.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1551-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-014-1551-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1551-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,15]],"date-time":"2020-08-15T05:32:22Z","timestamp":1597469542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-014-1551-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,8]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["1551"],"URL":"https:\/\/doi.org\/10.1007\/s10479-014-1551-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,8]]}}}