Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet

Annals of Operations Research

Volumn 236, Issue 2, 2016, Pages 383-404

  Dominguez, Oscar ^a   Juan, Angel A ^b   Barrios, Barry ^b   Faulin, Javier ^c   Agustin, Alba ^c  

^a UNIVERSITY OF LAS PALMAS DE GRAN CANARIA   (Spain)

^b UNIVERSITAT OBERTA DE CATALUNYA   (Spain)

^c PUBLIC UNIVERSITY OF NAVARRE   (Spain)

Author keywords

Heterogeneous vehicle routing problem; Multi start algorithms; Randomized heuristics; Two dimensional bin packing problem

Indexed keywords

EID: 84955180691     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-014-1551-4     Document Type: Article

References (50)

1. 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–27). New York: Springer.
2. Baldacci, R., Toth, P., & Vigo, D. (2010). Exact algorithms for routing problems under vehicle capacity constraints. Annals of Operations Research,175(1), 213–245.
3. 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–932.
4. Burke, E. K., Kendall, G., & Whitwell, G. (2004). A new placement heuristic for the orthogonal stock-cutting problem. Operations Research,52, 655–671.
5. Clarke, G., & Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research,12, 568–581.
6. 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.
7. Couillard, J., & Martel, A. (1990). Vehicle fleet planning in the road transportation industry. IEEE Transactions on Engineering Management,37, 31–36.
8. Drexl, M. (2012). Rich vehicle routing in theory and practice. Logistics Research,5(1–2), 47–63. doi:10.1007/s12159-012-0080-2.
9. 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.
10. 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–640.
11. 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–673.
12. 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–18.
13. 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–1173.
14. Golden, B., Assad, A. A., Levy, L., & Gheysens, F. G. (1984). The fleet size and mix vehicle routing problem. Computers & Operations Research,11, 49–66.
15. 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–286). Philadelphia: SIAM.
16. Golden, B., Raghavan, S., & Wasil, E. (Eds.). (2008). The Vehicle Routing Problem: Latest Advances and New Challenges. New York: Springer.
17. Hoff, A., Andersson, H., Christiansen, M., Hasle, G., & Løkketangen, A. (2010). Industrial aspects and literature survey: Fleet composition and routing. Computers & Operations Research,37, 2041–2061.
18. Iori M (2005). Metaheuristic Algorithms for Combinatorial Optimization Problems. 4OR, 3:163–166.
19. Iori, M., & Martello, S. (2010). Routing problems with loading constraints. TOP,18, 4–27.
20. 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–264.
21. Juan, A., Faulin, J., Ferrer, A., Lourenço, H., & Barrios, B. (2013). MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems. TOP,21, 109–132.
22. 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–1097.
23. Laporte, G. (1992). The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research,59, 345–358.
24. 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.
25. 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–210.
26. 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–2), 61–82.
27. 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–215.
28. 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–176.
29. 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–445.
30. 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–732.
31. 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–357.
32. 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–195.
33. 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–292.
34. Oppen, J., Løkketangen, A., & Desrosiers, J. (2010). Solving a rich vehicle routing and inventory problem using column generation. Computers & Operations Research,37(7), 1308–1317.
35. 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–153). Wiley: Chichester.
36. 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–150.
37. Privé, 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–1052.
38. 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–358.
39. 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–606.
40. 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–112.
41. Sbihi, A., & Eglese, R. W. (2010). Combinatorial optimization and green logistics. Annals of Operations Research,175, 159–175.
42. Semet, F., & Taillard, E. (1993). Solving real-life vehicle routing problems efficiently using tabu search. Annals of Operations Research,175, 159–175.
43. Taillard, E. D. (1999). A heuristic column generation method for the heterogeneous fleet VRP. RAIRO,33, 1–14.
44. Tarantilis, C. D., & Kiranoudis, C. T. (2002). BoneRoute: An adaptive memory-based method for effective fleet management. Annals of Operations Research,115(1), 227–241.
45. 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–822.
46. 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–425.
47. Toth, P., & Vigo, D. (2002). The vehicle routing problem, monographs on discrete mathematics and applications. Philadelphia: SIAM Publishers.
48. 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–8.
49. 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–606. doi:10.1109/CSO.2009.127.
50. 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–743.